Semantic-head-driven generation
Computational Linguistics
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Ambiguity-preserving generation with LFG-and PATR-style grammars
Computational Linguistics
Interleaving natural language parsing and generation through uniform processing
Artificial Intelligence
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Preserving Ambiguities in Generation via Automata Intersection
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Ambiguity management in natural language generation
Ambiguity management in natural language generation
Semantic-driven generation with LFG-and PATR-style grammars
Computational Linguistics
Forest-based statistical sentence generation
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Restriction and correspondence-based translation
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Generation that exploits corpus-based statistical knowledge
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
LFG generation produces context-free languages
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
An algorithm for functional uncertainty
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Constituent coordination in Lexical-Functional Grammar
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Two-level morphology with composition
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
OT syntax: decidability of generation-based optimization
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
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
Statistical ranking in tactical generation
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Charts, interaction-free grammars, and the compact representation of ambiguity
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
CCG chart realization from disjunctive inputs
INLG '06 Proceedings of the Fourth International Natural Language Generation Conference
Underspecifying and predicting voice for surface realisation ranking
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Reversible stochastic attribute-value grammars
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
High efficiency realization for a wide-coverage unification grammar
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
| Hi-index | 0.00 |
This article describes an approach to Lexical-Functional Grammar LFG generation that is based on the fact that the set of strings that an LFG grammar relates to a particular acyclic f-structure is a context-free language. We present an algorithm that produces for an arbitrary LFG grammar and an arbitrary acyclic input f-structure a context-free grammar describing exactly the set of strings that the given LFG grammar associates with that f-structure. The individual sentences are then available through a standard context-free generator operating on that grammar. The context-free grammar is constructed by specializing the context-free backbone of the LFG grammar for the given f-structure and serves as a compact representation of all generation results that the LFG grammar assigns to the input. This approach extends to other grammatical formalisms with explicit context-free backbones, such as PATR, and also to formalisms that permit a context-free skeleton to be extracted from richer specifications. It provides a general mathematical framework for understanding and improving the operation of a family of chart-based generation algorithms.