Sciweavers

64 search results - page 4 / 13
» Minimally Lexicalized Dependency Parsing
Sort
View
COLING
2002
13 years 6 months ago
Can Subcategorization Help a Statistical Dependency Parser?
Today there is a relatively large body of work on automatic acquisition of lexicosyntactical preferences (subcategorization) from corpora. Various techniques have been developed t...
Daniel Zeman
ACL
2003
13 years 7 months ago
Accurate Unlexicalized Parsing
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
Dan Klein, Christopher D. Manning
COLING
2010
13 years 1 months ago
Benchmarking of Statistical Dependency Parsers for French
We compare the performance of three statistical parsing architectures on the problem of deriving typed dependency structures for French. The architectures are based on PCFGs with ...
Marie Candito, Joakim Nivre, Pascal Denis, Enrique...
ACL
2012
11 years 8 months ago
Attacking Parsing Bottlenecks with Unlabeled Data and Relevant Factorizations
Prepositions and conjunctions are two of the largest remaining bottlenecks in parsing. Across various existing parsers, these two categories have the lowest accuracies, and mistak...
Emily Pitler
ACL
2008
13 years 7 months ago
Simple Semi-supervised Dependency Parsing
We present a simple and effective semisupervised method for training dependency parsers. We focus on the problem of lexical representation, introducing features that incorporate w...
Terry Koo, Xavier Carreras, Michael Collins