Sciweavers

108 search results - page 1 / 22
» Incremental Finite-State Parsing
Sort
View
ANLP
1997
106views more  ANLP 1997»
13 years 5 months ago
Incremental Finite-State Parsing
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
Salah Ait-Mokhtar, Jean-Pierre Chanod
CICLING
2008
Springer
13 years 5 months ago
Arabic Morphology Parsing Revisited
In this paper we propose a new approach to the description of Arabic morphology using 2-tape finite state transducers, based on a particular and systematic use of the operation of ...
Suhel Jaber, Rodolfo Delmonte
IC
2004
13 years 5 months ago
Constructing Finite State Automata for High-Performance XML Web Services
This paper describes a validating XML parsing method based on deterministic finite state automata (DFA). XML parsing and validation is performed by a schema-specific XML parser th...
Robert van Engelen
COLING
1994
13 years 4 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
ACL
1998
13 years 5 months ago
Terminology Finite-State Preprocessing for Computational LFG
This paper presents a technique to deal with multiword nominal terminology in a computational Lexical Functional Grammar. This method treats multiword terms as single tokens by mo...
Caroline Brun