Parsing natural language idioms with bi-directional finite-state machines

Authors:
T. Poibeau
Affiliations:
Thomson-CSF, Orsay, France, and Institut Galilée, Villetaneuse, France
Venue:
Theoretical Computer Science
Year:
2001

Citing 4
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Finite-State Language Processing

Finite-State Language Processing
An information extraction core system for real world German text processing

ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Regular expressions for language engineering

Natural Language Engineering

A Generic Finite State Compiler for Tagging Rules

Machine Translation

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we introduce the notion of bidirectional finite-state automata (BFSA). A BFSA is defined by the following sequence: Aleft.&ohgr;.Aright, where &ohgr; is a word called pivot, Aright a FSA that should be read from the left to the right and a FSA that should be read from the right to the left. &ohgr; is an edge linking the initial state of Aleft to the initial state of Aright. We present the use of such devices for natural language processing. In this context, BFSA have to be enriched with notions of proximity, optionality and contextual information. Some concrete examples are examined. Copyright Elsevier Science B.V.