Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 180

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Efficient learning of context-free grammars from positive structural examples

Open access
Sakakibara, Yasubumi · 1992 · Information and Computation

Abstract

In this paper, we introduce a new normal form for context-free grammars, called reversible context-free grammars, for the problem of learning context-free grammars from positive-only examples. A context-free grammar G = (N, @S, P, S) is said to be reversible if (1) A -> @a and B -> @a in P implies A = B and (2) A -> @[email protected] and A -> @[email protected] in P implies B = C. We show that the class of reversible context-free grammars can be identified in the limit from positive samples of structural descriptions and there exists an efficient algorithm to identify them from positive samples of structural descriptions, where a structural description of a context-free grammar is an unlabelled derivation tree of the grammar. This implies that if positive structural examples of a reversible context-free grammar for the target language are available to the learning algorithm, the full class of context-free languages can be learned efficiently from positive samples.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/0890-5401(92)90003-x

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 180

Metadata

Authors
Sakakibara, Y.
Venue
Information and Computation
Publisher
Elsevier BV
Published
1992-03
Volume
97
Issue
1
Pages
23-60
ISSN
0890-5401 (ISSN-L)
OpenAlex
W2083367980
Cited by
180
References
2
FWCI
5.58
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Efficient learning of context-free grammars from positive structural examples. https://app.cochat.ai/papers/10.1016/0890-5401(92)90003-x
The paper
Sakakibara, Y. (1992). Efficient learning of context-free grammars from positive structural examples. Information and Computation. https://doi.org/10.1016/0890-5401(92)90003-x

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.