论文信息 - Regular Models of Phonological Rule Systems

Regular Models of Phonological Rule Systems

This paper presents a set of mathematical and computational tools for manipulating and reasoning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of context-sensitive rewriting rules and also to grammars in Koskenniemi's two-level formalism. This analysis provides a common representation of phonological constraints that supports efficient generation and recognition by a single simple interpreter.

Martin Kay | Ronald M. Kaplan | R. Kaplan | M. Kay

[1] Noam Chomsky,et al. The Sound Pattern of English , 1968 .

[2] C. Douglas Johnson,et al. Formal Aspects of Phonological Description , 1972 .

[3] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[5] Michael Kenstowicz,et al. Generative Phonology: Description and Theory , 1979 .

[6] Kimmo Koskenniemi,et al. A General Computational Model for Word-Form Recognition and Production , 1984, ACL.

[7] Kimmo Koskenniemi. Compilation of automata from morphological two-level rules , 1985, NODALIDA.

[8] Martin Kay,et al. Nonconcatenative Finite-State Morphology , 1987, EACL.

[9] Kimmo Koskenniemi,et al. A Compiler for Two-level Phonological Rules , 1987 .

[10] Michael A. Arbib,et al. An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[11] Graeme D. Ritchie. Languages Generated by Two-Level Morphological Rules , 1992, Comput. Linguistics.

[12] Lauri Karttunen,et al. Two-level rule compiler , 1992 .

[13] Lauri Karttunen,et al. Two-Level Morphology with Composition , 1992, COLING.