REVERSING A LEXICALLY BASED PARSER FOR GENERATION
- 1 April 1988
- journal article
- research article
- Published by Taylor & Francis in Applied Artificial Intelligence
- Vol. 2 (2) , 149-174
- https://doi.org/10.1080/08839518808949907
Abstract
It is practically advantageous and theoretically meaningful to base both a natural language generator and a parser on the same linguistic data. Neutrality of the representation can be advocated for all unification-based grammars. Yet the basic process in generation can also have several points in common with parsing. Specifically, not only is a unification-based approach proposed that produces from the initial semantic representation the sentence together with a functional structure but also the process is based on an adaptation of the concept of chart, which we call bi-chart (bidimensional chart). The chart is cast over the semantic representation and not over the string but has the same qualities as the classic one. The other relevant point here is that most of the data used in the process are distributed throughout the lexicon, and this results in a very flexible system.Keywords
This publication has 4 references indexed in Scilit:
- Functional unification grammar revisitedPublished by Association for Computational Linguistics (ACL) ,1987
- TOWARD A LANGUAGE-INDEPENDENT GENERATOR OF SENTENCESApplied Artificial Intelligence, 1987
- Functional Unification GrammarPublished by Association for Computational Linguistics (ACL) ,1984
- PHRANPublished by Association for Computational Linguistics (ACL) ,1980