Bi-directional Automata to Extract Complex Phrases from Texts

Authors:
Thierry Poibeau
Affiliations:
-
Venue:
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Year:
1998

Citing 4
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
The B-book: assigning programs to meanings

The B-book: assigning programs to meanings
Finite-State Language Processing

Finite-State Language Processing
Regular expressions for language engineering

Natural Language Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an experiment to develop natural-language tools to improve the quality of documents. These softwares are using finite-state automata enriched with notions of proximity, optionality and contextual information. They are called bi-directional because they need to parse a sequence not only from the left to right-hand side of a sentence, but on both sides of a word. This method improves efficiency.