Semantic-driven generation with LFG-and PATR-style grammars
Computational Linguistics
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
OT syntax: decidability of generation-based optimization
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Processing optimality-theoretic syntax by interleaved chart parsing and generation
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Robust PCFG-based generation using automatically acquired LFG approximations
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Dependency-based n-gram models for general purpose sentence realisation
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
ACLstudent '05 Proceedings of the ACL Student Research Workshop
Accurate and robust LFG-based generation for Chinese
INLG '08 Proceedings of the Fifth International Natural Language Generation Conference
A translation from logic to English with dynamic semantics
JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence
Dependency-based n-gram models for general purpose sentence realisation
Natural Language Engineering
Building a formal grammar for a polysynthetic language
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Lfg generation by grammar specialization
Computational Linguistics
| Hi-index | 0.00 |
This paper examines the generation problem for a certain linguistically relevant subclass of LFG grammars. Our main result is that the set of strings that such a grammar relates to a particular f-structure is a context-free language. This result obviously extends to other context-free based grammatical formalisms, such as PATR, and also to formalisms that permit a context-free skeleton to be extracted (perhaps some variants of HPSG). The proof is constructive: from the given f-structure a particular context-free grammar is created whose yield is the desired set of strings. Many existing generation strategies (top-down, bottom-up, head-driven) can be understood as alternative ways of avoiding the creation of useless context-free productions. Our result can be established for the more general class of LFG grammars, but that is beyond the scope of the present paper.