Sciweavers

284 search results - page 13 / 57
» Efficient Parsing for French
Sort
View
NAACL
2010
14 years 9 months ago
An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
Yoav Goldberg, Michael Elhadad
IC
2004
15 years 1 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
ANLP
1997
106views more  ANLP 1997»
15 years 1 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
ACL
2009
14 years 9 months ago
K-Best A* Parsing
A parsing makes 1-best search efficient by suppressing unlikely 1-best items. Existing kbest extraction methods can efficiently search for top derivations, but only after an exhau...
Adam Pauls, Dan Klein
BMCBI
2008
116views more  BMCBI 2008»
14 years 12 months ago
GBParsy: A GenBank flatfile parser library with high speed
Background: GenBank flatfile (GBF) format is one of the most popular sequence file formats because of its detailed sequence features and ease of readability. To use the data in th...
Tae-Ho Lee, Yeon-Ki Kim, Baek Hie Nahm