Feature structures: a logical theory with application to language analysis
Feature structures: a logical theory with application to language analysis
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
D-PATR: a development environment for unification-based grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
Categorial unification grammars
COLING '86 Proceedings of the 11th coference on Computational linguistics
A concept of derivation for LFG
COLING '86 Proceedings of the 11th coference on Computational linguistics
A lexical functional grammar system in PROLOG
COLING '86 Proceedings of the 11th coference on Computational linguistics
Semantic-head-driven generation
Computational Linguistics
HLT '91 Proceedings of the workshop on Speech and Natural Language
Inheritance and constraint-based grammar formalisms
Computational Linguistics - Special issue on inheritance: I
Proceedings of the 11th international conference on World Wide Web
Issues in the choice of a source for natural language generation
Computational Linguistics - Special issue on using large corpora: I
Translation by structural correspondences
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
A language for the statement of binary relations over feature structures
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
Structural non-correspondence in translation
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A semantic-head-driven generation algorithm for unification-based formalisms
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Tricolor DAGs for machine translation
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Asymmetry in parsing and generating with unification grammars: case studies from ELU
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Automated inversion of logic grammars for generation
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Comparing two grammar-based generation algorithms: a case study
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Syntactic-head-driven generation
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Generation from under- and overspecified structures
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Shalt2: a symmetric machine translation system with conceptual transfer
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Shalt2: a symmetric machine translation system with conceptual transfer
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
A bottom-up generation for principle-based grammars using constraint propagation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Reversible unification based machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Fluency and completeness in instance-based natural language generation
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Offline compilation of chains for head-driven generation with constraint-based grammars
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Bidirectional chart generation of natural language texts
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
| Hi-index | 0.00 |
This paper describes two algorithms which construct two different types of generators for lexical functional grammars (LFGs). The first type generates sentences from functional structures and the second from semantic structures. The latter works on the basis of oxtended LFGs, which contain a mapping from f-structures into semantic structures. Both algorithms can be used on all grammars within the respective class of LFG-grammars. Thus sentences can be generated from input structures by means of LFG-grammars and the same grammar formalism, although not necessarily the same grammar, can be used for both analysis and synthesis.