Transactions of the Association for Computational Linguistics · 2016 · 148 citations · 27 references
ComputingComputer ScienceComputational LinguisticsNatural Language ProcessingPhonologyLanguage LearningLanguage ModelingLanguage ModelsGrammar InferenceLocal InferenceNatural Language InferencePolynomial Time ComplexityPolynomial-time Algorithms
The Tier-based Strictly 2-Local (TSL 2 ) languages are a class of formal languages which have been shown to model long-distance phonotactic generalizations in natural language (Heinz et al., 2011). This paper introduces the Tier-based Strictly 2-Local Inference Algorithm (2TSLIA), the first nonenumerative learner for the TSL 2 languages. We prove the 2TSLIA is guaranteed to converge in polynomial time on a data sample whose size is bounded by a constant.
27
Language identification in the limit
Eric Gold · Information and Control · 1967 · 3.6K citations
A Typology of Consonant Agreement as Correspondence
Sharon Rose, Rachel Walker · Language · 2004 · 682 citations
Dana Angluin, Philip Laird · Machine Learning · 1988 · 667 citations · Full text
Adjacency parameters in phonology
David Odden · Language · 1994 · 384 citations
Some controversial questions in phonological theory
Noam Chomsky, Morris Halle · Journal of Linguistics · 1965 · 366 citations