374 search results - page 25 / 75 » acl 2009 |
95
Voted
ACL
2009
14 years 8 months ago
2009
Tree substitution grammars (TSGs) offer many advantages over context-free grammars (CFGs), but are hard to learn. Past approaches have resorted to heuristics. In this paper, we le...
ACL
2009
14 years 8 months ago
2009
We describe an algorithm for Japanese analysis that does both base phrase chunking and dependency parsing simultaneously in linear-time with a single scan of a sentence. In this p...
ACL
2009
14 years 8 months ago
2009
This paper describes an incremental parser based on an adjoining operation. By using the operation, we can avoid the problem of infinite local ambiguity in incremental parsing. Th...
106
click to vote
ACL
2009
14 years 8 months ago
2009
We compare the CCG parser of Clark and Curran (2007) with a state-of-the-art Penn Treebank (PTB) parser. An accuracy comparison is performed by converting the CCG derivations into...
74
Voted
ACL
2009
14 years 8 months ago
2009
One of the basic problems of efficiently generating information-seeking dialogue in interactive question answering is to find the topic of an information-seeking question with res...