Sciweavers

4 search results - page 1 / 1
» A Nearest-Neighbor Method for Resolving PP-Attachment Ambigu...
Sort
View
KONVENS
2000
13 years 8 months ago
Scaling up. Using the WWW to Resolve PP Attachment Ambiguities
We have developed a method to resolve ambiguities in prepositional phrase (PP) attachment in German. We measure on the one hand the cooccurrence strength between nouns (N) and pre...
Martin Volk
IJCNLP
2004
Springer
13 years 10 months ago
A Nearest-Neighbor Method for Resolving PP-Attachment Ambiguity
We present a nearest-neighbor algorithm for resolving prepositional phrase attachment ambiguities. Its performance is significantly higher than previous corpus-based methods for P...
Shaojun Zhao, Dekang Lin
ACL
2011
12 years 8 months ago
Web-Scale Features for Full-Scale Parsing
Counts from large corpora (like the web) can be powerful syntactic cues. Past work has used web counts to help resolve isolated ambiguities, such as binary noun-verb PP attachment...
Mohit Bansal, Dan Klein
ACL
2003
13 years 6 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