675 search results - page 73 / 135 » On Compression of Parse Trees |
110
click to vote
ACL
2006
15 years 5 months ago
2006
This paper describes the development of QuestionBank, a corpus of 4000 parseannotated questions for (i) use in training parsers employed in QA, and (ii) evaluation of question par...
191
click to vote
ECMDAFA
2008
Springer
15 years 6 months ago
2008
Springer
Model driven development suggests to make models the main artifact in software development. To get executable models in most cases code generation to a "traditional" prog...
127
click to vote
ACL
2004
15 years 5 months ago
2004
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...
148
click to vote
CAV
2012
Springer
13 years 6 months ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
137
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...