Compiling regular formalisms with rule features into finite-state automata

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1997-July, Issue , 1997, Pages 329-336

  Kiraz, George Anton ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

FINITE-STATE AUTOMATA; REWRITE RULES;

AUTOMATA THEORY;

EID: 11244326578     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Bear, J. 1988. Morphology with two-level rules and negative rule features. In COLING-88: Papers Presented to the 12thInternational Conference on Computational Linguistics, volume 1, pages 28-31.
2. Goldsmith, J. 1976. Autosegmental Phonology. Ph.D. thesis, MIT. Published as Autosegmental and Metrical Phonology, Oxford 1990.
3. Grimley-Evans, E., G. Kiraz, and S. Pulman. 1996. Compiling a partition-based two-level formalism. In COLING-96: Papers Presented to the 16th International Conference on Computational Linguistics.
4. Hopcroft, J. and J. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
5. Kaplan, R. and M. Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3):331-78.
6. Kiraz, G. 1995. Introduction to Syriac Spirantization. Bar Hebraeus Verlag, The Netherlands.
7. Kiraz, G. [1996]. Syriac morphology: From a linguistic description to a computational implementation. In R. Lavenant, editor, VIItum Symposium Syriacum 1996, Forthcoming in Orientalia Christiana Analecta. Pontificio Institutum Studio-rum Orientalium.
8. Kiraz, G. [Forthcoming]. Computational Approach to Nonlinear Morphology: with emphasis on Semitic languages. Cambridge University Press.
9. McCarthy, J. 1981. A prosodic theory of nonconcatenative morphology. Linguistic Inquiry, 12(3):373-418.
10. Mohri, M. 1994. On some applications of finite-state automata theory to natural language processing. Technical report, Institut Gaspard Monge.
11. Mohri, M. and S. Sproat. 1996. An efficient compiler for weighted rewrite rules. In Proceedings of the 3~th Annual Meeting of the Association for Computational Linguistics, pages 231-8.
12. Roche, E. and Y. Schabes. 1995. Deterministic part-of-speech tagging with finite-state transducers. CL, 21(2):227-53.