Sciweavers

284 search results - page 31 / 57
» Efficient Parsing for French
Sort
View
NLE
2008
140views more  NLE 2008»
13 years 8 months ago
Active learning and logarithmic opinion pools for HPSG parse selection
For complex tasks such as parse selection, the creation of labelled training sets can be extremely costly. Resource-efficient schemes for creating informative labelled material mu...
Jason Baldridge, Miles Osborne
ENTCS
2006
114views more  ENTCS 2006»
13 years 8 months ago
Towards Efficient, Typed LR Parsers
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...
François Pottier, Yann Régis-Gianas
ACL
2010
13 years 6 months ago
Efficient Third-Order Dependency Parsers
We present algorithms for higher-order dependency parsing that are "third-order" in the sense that they can evaluate substructures containing three dependencies, and &qu...
Terry Koo, Michael Collins
ACL
2006
13 years 10 months ago
Multi-Tagging for Lexicalized-Grammar Parsing
With performance above 97% accuracy for newspaper text, part of speech (POS) tagging might be considered a solved problem. Previous studies have shown that allowing the parser to ...
James R. Curran, Stephen Clark, David Vadas
ECEASST
2008
88views more  ECEASST 2008»
13 years 8 months ago
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
: Graph parsing is known to be computationally expensive. For this reason the construction of special-purpose parsers may be beneficial for particular graph languages. In the domai...
Steffen Mazanek, Mark Minas