2019 · 88 citations · 17 references
ComputingComputer ScienceAlgorithmsMachine LearningPhonologyPhonological ProcessingPhonological RepresentationPhonological LearningPolynomial Time ComplexityPolynomial-time Algorithms
This paper characterizes the Output Tier-based Strictly k-Local (OTSL k ) class of string-tostring functions, which are relevant for modeling long-distance phonological processes as input-output maps. After showing that any OTSL k function can be learned when k and the tier are given, we present a new algorithm that induces the tier itself when k = 2 and provably learns any total OTSL 2 function in polynomial time and data-the first such learner for any class of tier-based functions.
17
Language identification in the limit
Eric Gold · Information and Control · 1967 · 3.6K citations
Autosegmental and metrical phonology
Janet B. Pierrehumbert · Journal of Phonetics · 1993 · 789 citations
Adjacency parameters in phonology
David Odden · Language · 1994 · 384 citations