Regular Expressions for language Engineering
Lauri Karttunen, Jean-Pierre Chanod, Greg Grefenstette, Anne Schiller
Many of the processing steps in natural language engineering can be performed using finite-state transducers.
An optimal way to create such transducers is to compile them from regular expressions. This paper is an
introduction to the regular expression calculus, extended with certain operators that have proved very useful in
natural language applications ranging from tokenization to light parsing. The examples in the paper illustrate in
concrete detail some of these applications.
Journal of Natural Language Engineering vol 2 no 4 (1997) pp 307-330, 1997 Cambridge University Press ISSN:1351-3249
karttunen96regular.pdf (312.79 kB)