Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
A rich environment for experimentation with unification grammars
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Auxiliaries and clitics in French UCG grammar
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on 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
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Generation as structure driven derivation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Structure-driven generation from separate semantic representations
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
ELU: an environment for machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Generating French with a reversible unification grammar
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
Recent developments in generation algorithms have enabled work in unification-based computational linguistics to approach more closely the ideal of grammars as declarative statements of linguistic facts, neutral between analysis and synthesis. From this perspective, however, the situation is still far from perfect; all known methods of generation impose constraints on the grammars they assume.We briefly consider a number of proposals for generation, outlining their consequences for the form of grammars, and then report on experience arising from the addition of a generator to an existing unification environment. The algorithm in question (based on that of Shieber et al. (1989)), though among the most permissive currently available, excludes certain classes of parsable analyses.