Sciweavers

242 search results - page 43 / 49
» A non-projective dependency parser
Sort
View
FLAIRS
2006
13 years 11 months ago
Constrained Lexical Attraction Models
Lexical Attraction Models (LAMs) were first introduced by Deniz Yuret in (Yuret 1998) to exemplify how an algorithm can learn word dependencies from raw text. His general thesis i...
Radu Ion, Verginica Barbu Mititelu
ACL
2001
13 years 11 months ago
A Common Framework for Syntactic Annotation
It is widely recognized that the proliferation of annotation schemes runs counter to the need to re-use language resources, and that standards for linguistic annotation are becomi...
Nancy Ide, Laurent Romary
ACL
1998
13 years 11 months ago
HPSG-Style Underspecified Japanese Grammar with Wide Coverage
This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspec...
Yutaka Mitsuishi, Kentaro Torisawa, Jun-ichi Tsuji...
EMNLP
2009
13 years 7 months ago
Polynomial to Linear: Efficient Classification with Conjunctive Features
This paper proposes a method that speeds up a classifier trained with many conjunctive features: combinations of (primitive) features. The key idea is to precompute as partial res...
Naoki Yoshinaga, Masaru Kitsuregawa
ACL
2011
13 years 1 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez