The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A bibliographical study of grammatical inference
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.
Integrity signals
Registry
Cites
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.
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
Language identification in the limit
Gold, E. M. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91165-5 · Cited by 3,572 · cited 9×
“A first convincing model for the case of grammatical inference was introduced by Gold[32]: identification in the limit.”
BackgroundInfluentialA formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
Cited by
Learning Long-Distance Phonotactics
Heinz, J. (2010) · Linguistic Inquiry · doi:10.1162/ling_a_00015 · Cited by 257
Inferring extended finite state machine models from software executions
Walkinshaw, N., Taylor, R., & Derrick, J. (2016) · Empirical Software Engineering · doi:10.1007/s10664-015-9367-7 · Cited by 127
“Within the Machine Learning field of Grammar Inference, there have been extensive efforts to infer much broader families of ‘automata’ (albeit characterised as languages or grammars) [16].”
BackgroundMeta-interpretive learning: application to grammatical inference
Muggleton, S. H., Lin, D., Pahlavi, N., & Tamaddoni-Nezhad, A. (2014) · Machine Learning · doi:10.1007/s10994-013-5358-3 · Cited by 144
“Algorithms for learning the Regular languages have been widely studied since the 1970s within the topic of Grammatical Inference (de la Higuera 2005).”
Background
Metadata
- Authors
- de la Higuera, C.
- Venue
- Pattern Recognition
- Publisher
- Elsevier BV
- Published
- 2005-09
- Volume
- 38
- Issue
- 9
- Pages
- 1332-1348
- ISSN
- 0031-3203 (ISSN-L)
- OpenAlex
- W2120437191
- Cited by
- 237
- References
- 4
- FWCI
- 12.86
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.