1423 search results - page 123 / 285 » Languages of Nested Trees |
123
Voted
EMNLP
2009
15 years 1 months ago
2009
This work introduces a model free approach to sentence compression, which grew out of ideas from Nomoto (2008), and examines how it compares to a state-of-art model intensive appr...
134
Voted
EMNLP
2011
14 years 3 months ago
2011
Machine-produced text often lacks grammaticality and fluency. This paper studies grammaticality improvement using a syntax-based algorithm based on CCG. The goal of the search pr...
144
Voted
CC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
105
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is...
128
click to vote
PLANX
2008
15 years 5 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...