640 search results - page 9 / 128 » Growing Semantic Grammars |
ACL
1989
13 years 9 months ago
1989
We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to ...
ACL
1996
13 years 9 months ago
1996
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures...
EACL
1989
ACL Anthology
13 years 9 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...
AI
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A top-down parsing algorithm has been constructed to accommodate any form of ambiguous context-free grammar, augmented with semantic rules with arbitrary attribute depend...
CALCO
2009
Springer
14 years 2 months ago
2009
Springer
We generalize the unfolding semantics, previously developed for concrete formalisms such as Petri nets and graph grammars, to the setting of (single pushout) rewriting over adhesiv...