The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Learnability in Optimality Theory
Open accessAbstract
In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. The resulting learning procedure specifically exploits the grammatical structure of Optimality Theory, independent of the content of substantive constraints defining any given grammatical module. We decompose the learning problem and present formal results for a central subproblem, deducing the constraint ranking particular to a target language, given structural descriptions of positive examples. The structure imposed on the space of possible grammars by Optimality Theory allows efficient convergence to a correct grammar. We discuss implications for learning from overt data only, as well as other learning issues. We argue that Optimality Theory promotes confluence of the demands of more effective learnability and deeper linguistic explanation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Foundations of statistical natural language processing
Manning, C. D., & Schütze, H. (1999) · Cited by 9,816
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
Journal of the Royal Statistical Society (B)
Fildes, R. (1993) · International Journal of Forecasting · doi:10.1016/0169-2070(93)90088-5 · Cited by 3,437
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
Baum, L. E., & Petrie, T. (1966) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177699147 · Cited by 2,775
Faithfulness and reduplicative identity
McCarthy, J. J., & Prince, A. S. (1995) · GLSA (Graduate Linguistic Student Association), Dept. of Linguistics, University of Massachusetts · doi:10.7282/t31r6nj9 · Cited by 1,759
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Steps toward Artificial Intelligence
Minsky, M. (1961) · Proceedings of the IRE · doi:10.1109/jrproc.1961.287775 · Cited by 1,675
Information processing in dynamical systems: foundations of harmony theory
Smolensky, P. (1986) · The MIT Press eBooks · Cited by 1,671
Self-citationA statistical approach to machine translation
Brown, P. F., Cocke, J., Pietra, S. A. D., Pietra, V. J. D., Jelinek, F., Lafferty, J., Mercer, R. L., & Roossin, P. S. (1990) · doi:10.5555/92858.92860 · Cited by 1,655
Cited by
Empirical Tests of the Gradual Learning Algorithm
Boersma, P., & Hayes, B. (2001) · Linguistic Inquiry · doi:10.1162/002438901554586 · Cited by 1,115
Positional faithfulness, positional neutralisation and Shona vowel harmony
Beckman, J. N. (1997) · Phonology · doi:10.1017/s0952675797003308 · Cited by 615
BRIDGING THE GAP BETWEEN L2 SPEECH PERCEPTION RESEARCH AND PHONOLOGICAL THEORY
Escudero, P., & Boersma, P. (2004) · Studies in Second Language Acquisition · doi:10.1017/s0272263104040021 · Cited by 459
Analytic bias and phonological typology
Moreton, E. (2008) · Phonology · doi:10.1017/s0952675708001413 · Cited by 431
Wilson, C. (2006) · Cognitive Science · doi:10.1207/s15516709cog0000_89 · Cited by 398
Metadata
- Authors
- Tesar, B., & Smolensky, P.
- Venue
- Linguistic Inquiry
- Publisher
- MIT Press
- Published
- 1998-04
- Volume
- 29
- Issue
- 2
- Pages
- 229-268
- ISSN
- 0024-3892 (ISSN-L)
- 1530-9150
- OpenAlex
- W2108443500
- Cited by
- 684
- References
- 40
- FWCI
- 203.70
- Type
- journal article
- Language
- en
- Open access
- green
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: Learnability in Optimality Theory. https://app.cochat.ai/papers/10.1162/002438998553734
- The paper
- Tesar, B., & Smolensky, P. (1998). Learnability in Optimality Theory. Linguistic Inquiry. https://doi.org/10.1162/002438998553734
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.
