2015 | OriginalPaper | Buchkapitel
A Grammatical Inference Model for Measuring Language Complexity
verfasst von : Leonor Becerra-Bonache, M. Dolores Jiménez-López
Erschienen in: Advances in Computational Intelligence
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The 21st century has re-opened the interest of Linguistics on the complexity of natural languages. The equi-complexity dogma –the idea that all languages must be equally complex– has been challenged by a number of researchers that claim that indeed natural languages differ in complexity. In the last fifteen years, challengers of the equi-complexity dogma have proposed many complexity measures that depend on their way of defining complexity. In this paper, we propose a grammatical inference model to measure the relative complexity of languages. The computational tool we introduce is the result of an interdisciplinary study inspired in the process of natural language acquisition.