254 search results - page 17 / 51 » Efficient Transformation-Based Parsing |
FINTAL
2006
13 years 11 months ago
2006
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
WIA
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
ACL
2010
13 years 5 months ago
2010
We propose a top-down algorithm for extracting k-best lists from a parser. Our algorithm, TKA is a variant of the kbest A (KA) algorithm of Pauls and Klein (2009). In contrast to ...
EMNLP
2004
13 years 9 months ago
2004
We present a novel discriminative approach to parsing inspired by the large-margin criterion underlying support vector machines. Our formulation uses a factorization analogous to ...