An extendible regular expression compiler for finite-state approaches in natural language processing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2214, Issue , 2001, Pages 122-139

  van Noord, Gertjan ^a   Gerdemann, Dale ^b  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; PATTERN MATCHING; PROGRAM COMPILERS;

BASIC OPERATION; COMPLEMENTATION; FINITE STATE; KLEENE-CLOSURE; LEVEL OF ABSTRACTION; NATURAL LANGUAGE PROCESSING; REGULAR EXPRESSIONS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 84957536564     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45526-4_12     Document Type: Conference Paper

References (27)

1. Steven Abney. Partial parsing via finite-state cascades. In John Carroll, editor, Workshop on Robust Parsing; Eight European Summer School in Logic, Language and Information, pages 8-15, 1995
2. Alfred V. Aho, John E. Hop croft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974
3. Gosse Bouma. A modern computational linguistics course using dutch. In EACL 99: Computer and Internet Supported Education in Language and Speech Technology. Proceedings of a Workshop sponsored by ELSNET and The Association for Computational Linguistics, Bergen Norway, 1999
4. Christian S. Calude, Kai Salomaa, and Sheng Yu. Metric lexical analysis. In O. Boldt, H. Juergensen, and L. Robbins, editors, Workshop on Implementing Automata; WIA99 Pre-Proceedings, Potsdam Germany, 1999
5. Jean-Pierre Chanod and Pasi Tapanainen. A robust finite-state grammar for French. In John Carroll, editor, Workshop on Robust Parsing, Prague, 1996. These proceedings are also available as Cognitive Science Research Paper #435; School of Cognitive and Computing Sciences, University of Sussex.
6. P.C. Uit den Boogaart. Woord frequenties in geschreven en gesproken Nederlands. Oosthoek, Scheltema & Holkema, Utrecht, 1975.W erkgroep Frequentie-onderzoek van het Nederlands.
7. Dale Gerdemann and Gertjan van Noord. Transducers from rewrite rules with backreferences. In Ninth Conference of the European Chapter of the Association for Computational Linguistics, Bergen Norway, 1999
8. Gregory Grefenstette. Light parsing as finite-state filtering. In EACI 1996 Workshop Extended Finite-State Models of Language, Budapest, 1996
9. John E. Hop croft. An n log n algorithm for minimizing the states in a finite automaton. In Z. Kohavi, editor, The Theory of Machines and Computations, pages 189-196. Academic Press, 1971
10. John E. Hop croft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison Wesley, 1979
11. C. Douglas Johnson. Formal Aspects of Phonological Descriptions. Mouton, The Hague, 1972
12. Ronald Kaplan and Martin Kay. Regular models of phonological rule systems. Computational Linguistics, 20(3):331-379, 1994
13. Lauri Karttunen. The replace operator. In 33th Annual Meeting of the Association for Computational Linguistics, M.I.T. Cambridge Mass., 1995
14. Lauri Karttunen. Directed replacement. In 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz, 1996
15. Lauri Karttunen. The replace operator. In Emannual Roche and Yves Schabes, editors, Finite-State Language Processing, pages 117-147. Bradford, MIT Press, 1997
16. Lauri Karttunen. The proper treatment of optimality theory in computational phonology. In Finite-state Methods in Natural Language Processing, pages 1-12, Ankara, 1998
17. George Anton Kiraz and Edmund Grimley-Evans. Multi-tape automata for speech and language systems: A prolog implementation. In Derick Wood and Sheng Yu, editors, Automata Implementation. Second Internation Workshop on Implementing Automata, WIA ’97, pages 87-103. Springer Lecture Notes in Computer Science 1436, 1998
18. Mehryar Mohri, Fernando C.N. Pereira, and Michael Riley. A rational design for a weighted finite-state transducer library. In Automata Implementation. Second International Workshop on Implementing Automata, WIA ’97. Springer Verlag, 1998. Lecture Notes in Computer Science 1436
19. Mehryar Mohri and Richard Sproat. An efficient compiler for weighted rewrite rules. In 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz, 1996
20. Alan Prince and Paul Smolensky. Optimality theory: Constraint interaction in generative grammar. Technical Report TR-2, Rutgers University Cognitive Science Center, New Brunswick, NJ, 1993.MIT Press, To Appear.
21. D. Raymond and D. Wood. The grail papers. Technical Report TR-491, University of Western Ontario, Department of Computer Science, London Ontario, 1996
22. Emmanuel Roche. Parsing with finite-state transducers. In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 241-281.MIT Press, Cambridge, 1997
23. Emmanuel Roche and Yves Schabes. Introduction. In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing. MIT Press, Cambridge, Mass, 1997
24. Gertjan van Noord. FSA Utilities: A toolbox to manipulate finite-state automata. In Darrell Raymond, Derick Wood, and Sheng Yu, editors, Automata Implementation, pages 87-108. Springer Verlag, 1997. Lecture Notes in Computer Science 1260
25. Gertjan van Noord. FSA Utilities (version 5), 1998. The FSA Utilities toolbox is available free of charge under Gnu General Public License at http://www.let.rug.nl/˜vannoord/Fsa/.
26. Gertjan van Noord. The treatment of epsilon moves in subset construction. In Finite-state Methods in Natural Language Processing, Ankara, 1998.cmplg/ 9804003. Accepted for Computational Linguistics.
27. Bruce W. Watson. Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Eindhoven University of Technology, 1995.