1388 search results - page 61 / 278 » Querying Linguistic Trees |
104
click to vote
COLING
2010
14 years 7 months ago
2010
We employ Maximum Entropy model to conduct sub-tree alignment between bilingual phrasal structure trees. Various lexical and structural knowledge is explored to measure the syntac...
123
Voted
ACL
2009
14 years 10 months ago
2009
Articles in the Penn TreeBank were identified as being reviews, summaries, letters to the editor, news reportage, corrections, wit and short verse, or quarterly profit reports. Al...
120
click to vote
ACL
2012
13 years 2 months ago
2012
We present a holistic data-driven approach to image description generation, exploiting the vast amount of (noisy) parallel image data and associated natural language descriptions ...
100
click to vote
ALT
2010
Springer
15 years 2 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
102
Voted
TOC
2010
14 years 7 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...