Jane Chandlee
2019
Autosegmental Input Strictly Local Functions
Jane Chandlee | Adam Jardine
Transactions of the Association for Computational Linguistics, Volume 7
Jane Chandlee | Adam Jardine
Transactions of the Association for Computational Linguistics, Volume 7
Autosegmental representations (ARs; Goldsmith, 1976) are claimed to enable local analyses of otherwise non-local phenomena Odden (1994). Focusing on the domain of tone, we investigate this ability of ARs using a computationally well-defined notion of locality extended from Chandlee (2014). The result is a more nuanced understanding of the way in which ARs interact with phonological locality.
Quantifier-free least fixed point functions for phonology
Jane Chandlee | Adam Jardine
Proceedings of the 16th Meeting on the Mathematics of Language
Jane Chandlee | Adam Jardine
Proceedings of the 16th Meeting on the Mathematics of Language
Learning with Partially Ordered Representations
Jane Chandlee | Remi Eyraud | Jeffrey Heinz | Adam Jardine | Jonathan Rawski
Proceedings of the 16th Meeting on the Mathematics of Language
Jane Chandlee | Remi Eyraud | Jeffrey Heinz | Adam Jardine | Jonathan Rawski
Proceedings of the 16th Meeting on the Mathematics of Language
2015
Output Strictly Local Functions
Jane Chandlee | Rémi Eyraud | Jeffrey Heinz
Proceedings of the 14th Meeting on the Mathematics of Language (MoL 2015)
Jane Chandlee | Rémi Eyraud | Jeffrey Heinz
Proceedings of the 14th Meeting on the Mathematics of Language (MoL 2015)
2014
Learning Strictly Local Subsequential Functions
Jane Chandlee | Rémi Eyraud | Jeffrey Heinz
Transactions of the Association for Computational Linguistics, Volume 2
Jane Chandlee | Rémi Eyraud | Jeffrey Heinz
Transactions of the Association for Computational Linguistics, Volume 2
We define two proper subclasses of subsequential functions based on the concept of Strict Locality (McNaughton and Papert, 1971; Rogers and Pullum, 2011; Rogers et al., 2013) for formal languages. They are called Input and Output Strictly Local (ISL and OSL). We provide an automata-theoretic characterization of the ISL class and theorems establishing how the classes are related to each other and to Strictly Local languages. We give evidence that local phonological and morphological processes belong to these classes. Finally we provide a learning algorithm which provably identifies the class of ISL functions in the limit from positive data in polynomial time and data. We demonstrate this learning result on appropriately synthesized artificial corpora. We leave a similar learning result for OSL functions for future work and suggest future directions for addressing non-local phonological processes.