Building natural language generation systems
Building natural language generation systems
Concepts, Techniques, and Models of Computer Programming
Concepts, Techniques, and Models of Computer Programming
An algebra for semantic construction in constraint-based grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A relational syntax-semantics interface based on dependency grammar
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Multiword expressions as dependency subgraphs
MWE '04 Proceedings of the Workshop on Multiword Expressions: Integrating Processing
The XDG grammar development kit
MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz
| Hi-index | 0.00 |
In spite of its potential for bidirectionality, Extensible Dependency Grammar (XDG) has so far been used almost exclusively for parsing. This paper represents one of the first steps towards an XDG-based integrated generation architecture by tackling what is arguably the most basic among generation tasks: lexicalization. Herein we present a constraint-based account of disjunction in lexicalization, i.e. a way to enable an XDG grammar to generate all paraphrases --- along the lexicalization axis, of course --- realizing a given input semantics. Our model is (i) efficient, yielding strong propagation, (ii) modular and (iii) favourable to synergy inasmuch as it allows collaboration between modules, notably semantics and syntax. We focus on constraints ensuring well-formedness and completeness and avoiding over-redundancy.