Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-24T04:01:11.352Z Has data issue: false hasContentIssue false
  • English
  • Français

Regular expressions for language engineering

Published online by Cambridge University Press:  01 December 1996

L. KARTTUNEN ,
J-P. CHANOD ,
G. GREFENSTETTE  and
A. SCHILLE
L. KARTTUNEN
Affiliation:
Rank Xerox Research Centre (RXRC), 6 Chemin de Maupertuis, 38240 Meylan, France. e-mail: [email protected], [email protected], [email protected], [email protected]
J-P. CHANOD
Affiliation:
Rank Xerox Research Centre (RXRC), 6 Chemin de Maupertuis, 38240 Meylan, France. e-mail: [email protected], [email protected], [email protected], [email protected]
G. GREFENSTETTE
Affiliation:
Rank Xerox Research Centre (RXRC), 6 Chemin de Maupertuis, 38240 Meylan, France. e-mail: [email protected], [email protected], [email protected], [email protected]
A. SCHILLE
Affiliation:
Rank Xerox Research Centre (RXRC), 6 Chemin de Maupertuis, 38240 Meylan, France. e-mail: [email protected], [email protected], [email protected], [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Natural Language Engineering , Volume 2 , Issue 4 , December 1996 , pp. 305 - 328
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)