135 search results - page 8 / 27 » A Deductive Approach to Dependency Parsing |
ACL
2007
13 years 9 months ago
2007
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...
COLING
2008
13 years 9 months ago
2008
In this paper, we focus on the adaptation problem that has a large labeled data in the source domain and a large but unlabeled data in the target domain. Our aim is to learn relia...
EMNLP
2008
13 years 9 months ago
2008
Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both appr...
EMNLP
2006
13 years 9 months ago
2006
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
ACL
2011
12 years 11 months ago
2011
Nested event structures are a common occurrence in both open domain and domain specific extraction tasks, e.g., a “crime” event can cause a “investigation” event, which c...