Sciweavers

675 search results - page 8 / 135
» On Compression of Parse Trees
Sort
View
COLING
2008
13 years 9 months ago
Exploiting Constituent Dependencies for Tree Kernel-Based Semantic Relation Extraction
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the node...
Longhua Qian, Guodong Zhou, Fang Kong, Qiaoming Zh...
ACL
2006
13 years 9 months ago
A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles
The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument struc...
Reid Swanson, Andrew S. Gordon
EMNLP
2004
13 years 8 months ago
Dependencies vs. Constituents for Tree-Based Alignment
Given a parallel parsed corpus, statistical treeto-tree alignment attempts to match nodes in the syntactic trees for a given sentence in two languages. We train a probabilistic tr...
Daniel Gildea
DCC
2006
IEEE
14 years 7 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...
EMNLP
2007
13 years 9 months ago
Probabilistic Models of Nonprojective Dependency Trees
A notable gap in research on statistical dependency parsing is a proper conditional probability distribution over nonprojective dependency trees for a given sentence. We exploit t...
David A. Smith, Noah A. Smith