254 search results - page 10 / 51 » Efficient Transformation-Based Parsing |
190
click to vote
ACL
2009
15 years 5 months ago
2009
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...
202
Voted
BMCBI
2008
15 years 7 months ago
2008
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...
196
click to vote
ANLP
2000
15 years 8 months ago
2000
We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
194
Voted
COLING
2010
15 years 2 months ago
2010
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
172
Voted
ACL
1998
15 years 8 months ago
1998
This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification gramma...