76 search results - page 2 / 16 » Semantics and Algorithms for Data-dependent Grammars |
71
Voted
EACL
1989
ACL Anthology
14 years 10 months ago
1989
ACL Anthology
We present an algorithm for the generation of sentences from the semantic representations of Unification Categorial Grammar. We discuss a variant of Shieber's semantic monoto...
102
click to vote
DLT
2003
14 years 11 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
76
Voted
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
COLING
2010
14 years 4 months ago
2010
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
ESOP
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...