An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing

Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstraction for thinking about finite-state languages and finite-state relations. More complex finite-state operations (such as contexted replacement) are defined on the basis of basic operations (such as Kleene closure, complementation, composition). In order to be able to experiment with such complex finite-state operations the FSA Utilities (version 5) provides an extendible regular expression compiler. The paper discusses the regular expression operations provided by the compiler, and the possibilities to create new regular expression operators. The benefits of such an extendible regular expression compiler are illustrated with a number of examples taken from recent publications in the area of finite-state approaches to NLP.

• Type: Conference
• Year: 1999
• Where: WIA
• Authors: Gertjan van Noord, Dale Gerdemann
• Keywords: Artificial Intelligence, Extendible Regular Expression, Regular Expression, Regular Expression Compiler, WIA 1999