Sciweavers

254 search results - page 10 / 51
» Efficient Transformation-Based Parsing
Sort
View
ACL
2009
13 years 5 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»
13 years 7 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
ANLP
2000
124views more  ANLP 2000»
13 years 9 months ago
A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
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...
Günter Neumann, Christian Braun, Jakub Piskor...
COLING
2010
13 years 2 months ago
Data-Driven Parsing with Probabilistic Linear Context-Free Rewriting Systems
This paper presents a first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear ContextFree Rewriting Systems (PLCFRS), together with context-summ...
Laura Kallmeyer, Wolfgang Maier
ACL
1998
13 years 9 months ago
Translating a Unification Grammar with Disjunctions into Logical Constraints
This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification gramma...
Mikio Nakano, Akira Shimazu