621 search results - page 48 / 125 » Parsing As Tree Traversal |
ACL
1989
13 years 11 months ago
1989
the syntactically impossible antecedents. This latter This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The a...
ACL
2010
13 years 8 months ago
2010
Finding a class of structures that is rich enough for adequate linguistic representation yet restricted enough for efficient computational processing is an important problem for d...
ACL
2008
13 years 11 months ago
2008
Conventional n-best reranking techniques often suffer from the limited scope of the nbest list, which rules out many potentially good alternatives. We instead propose forest reran...
ACL
2010
13 years 8 months ago
2010
We outline different methods to detect errors in automatically-parsed dependency corpora, by comparing so-called dependency rules to their representation in the training data and ...
NIPS
2001
13 years 11 months ago
2001
We describe the application of kernel methods to Natural Language Processing (NLP) problems. In many NLP tasks the objects being modeled are strings, trees, graphs or other discre...