144 search results - page 8 / 29 » Solving Regular Tree Grammar Based Constraints |
88
Voted
COLING
1992
15 years 24 days ago
1992
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
112
click to vote
EMNLP
2010
14 years 9 months ago
2010
The task of selecting information and rendering it appropriately appears in multiple contexts in summarization. In this paper we present a model that simultaneously optimizes sele...
EACL
2003
ACL Anthology
15 years 1 months ago
2003
ACL Anthology
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...
87
Voted
COORDINATION
2004
Springer
15 years 5 months ago
2004
Springer
As a case study that illustrates our view on coordination and component-based software engineering, we present the design and implementation of a parallel constraint solver. The pa...