The Greedy and Recursive Search for Morphological Productivity
Not on the map. Why?
Abstract (arXiv)
As children acquire the knowledge of their language's morphology, they invariably discover the productive processes that can generalize to new words. Morphological learning is made challenging by the fact that even fully productive rules have exceptions, as in the well-known case of English past tense verbs, which features the -ed rule against the irregular verbs. The Tolerance Principle is a recent proposal that provides a precise threshold of exceptions that a productive rule can withstand. Its empirical application so far, however, requires the researcher to fully specify rules defined over a set of words. We propose a greedy search model that automatically hypothesizes rules and evaluates their productivity over a vocabulary. When the search for broader productivity fails, the model recursively subdivides the vocabulary and continues the search for productivity over narrower rules. Trained on psychologically realistic data from child-directed input, our model displays developmental patterns observed in child morphology acquisition, including the notoriously complex case of German noun pluralization. It also produces responses to nonce words that, despite receiving only a fraction of the training data, are more similar to those of human subjects than current neural network models' responses are.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 3 of its 46 references that are in the map. First posted on arXiv 12 May 2021.
Builds on
3 of 46 references.
References · 3
- 2018Recurrent Neural Networks in Linguistic Theory: Revisiting Pinker and Prince (1988) and the Past Tense Debatecited by 27
- 2019Are we there yet? Encoder-decoder neural networks as cognitive models of English past tense inflectioncited by 13
- 2020Inflecting when there's no majority: Limitations of encoder-decoder neural networks as cognitive models for German pluralscited by 13
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1.
2 papers.