Transducers from rewrite rules with backreferences

9th Conference of the European Chapter of the Association for Computational Linguistics, EACL 1999

Volumn , Issue , 1999, Pages 126-133

  Gerdemann, Dale ^a   van Noord, Gertjan ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS; TRANSDUCERS;

CONTEXT-SENSITIVE; FINITE STATE TRANSDUCERS; GENERAL SOLUTIONS; REWRITE RULES;

SPEECH PROCESSING;

EID: 84896379455     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Steve Abney. 1990. Rapid incremental parsing with repair. In Proceedings of the 6th New OED Conference: Electronic Text Rese arch, pages 1-9.
2. Steven Abney. 1996. Partial parsing via finite-state cascades. In Proceedings of the ESSLLI '96 Robust Parsing Workshop.
3. Jeffrey Friedl. 1997. Mastering Regular Expressions. O'Reilly & Associates, Inc.
4. C. Douglas Johnson. 1972. Formal Aspects of Phonological Descriptions. Mouton, The Hague.
5. Ronald Kaplan and Martin Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3):331-379.
6. L. Karttunen, J-P. Chanod, G. Grefenstette, and A. Schiller. 1996. Regular expressions for language engineering. Natural Language Engineering, 2(4):305-238.
7. Lauri Karttunen. 1995. The replace operator. In 33th Annual Meeting of the Association for Computational Linguistics, M.I.T. Cambridge Mass.
8. Lauri Karttunen. 1996. Directed replacement. In 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz.
9. Lauri Karttunen. 1997. The replace operator. In Emannual Roche and Yves Schabes, editors, Finite-State Language Processing, pages 117-147. Bradford, MIT Press.
10. Lauri Karttunen. 1998. The proper treatment of optimality theory in computational phonology. In Finite-state Methods in Natural Language Processing, pages 1-12, Ankara, June.
11. Nils Klarlund. 1997. Mona & Fido: The logic automaton connection in practice. In CSL '97.
12. Mehryar Mohri and Richard Sproat. 1996. An efficient compiler for weighted rewrite rules. In 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz.
13. Emmanuel Roche and Yves Schabes. 1995. Deterministic part-of-speech tagging with finite-state transducers. Computational Linguistics, 21:227-263. Reprinted in Roche & Schabes (1997).
14. Emmanuel Roche and Yves Schabes, editors. 1997a. Finite-State Language Processing. MIT Press, Cambridge.
15. Emmanuel Roche and Yves Schabes. 1997b. Introduction. In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing. MIT Press, Cambridge, Mass.
16. Gertjan van Noord and Dale Gerdemann. 1999. An extendible regular expression compiler for finite-state approaches in natural language processing. In Workshop on Implementing Automata 99, Potsdam Germany.
17. Gertjan van Noord. 1997. Fsa utilities. The FSA Utilities toolbox is available free of charge under Gnu General Public License at http://www.let.rug.nl/-vannoord/Fsa/.