Journal of Symbolic Computation
Grammar bidirectionality through controlled backward deduction
Logic and logic grammars for language processing
Proving termination and multiset orderings
Proving termination and multiset orderings
A semantic-head-driven generation algorithm for unification-based formalisms
ACL '89 Proceedings of the 27th 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
A symmetrical approach to parsing and generation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A uniform architecture for parsing and generation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to characterize formal criteria for termination in a derivation process. The notion of universal guides also offers a new framework in which both parsing and generation can be viewed merely as two different instances of the same generic process: guide consumption. This technique generalizes and exemplifies a new and original use of an existing concept of "proper guides" recently proposed in literature for controlling top-down left-to-right (TDLR) exccution in logic programs. We show that universal guides are independent of a particular grammar evaluation strategy. Also, unlike proper guides they can be specified in the same manner for any given algorithm without knowing in advance whether the algorithm is a parsing or a generation algorithm. Their introduction into a grammar prevents as well the occurrence of certain grammar rules an infinite number of times during a derivation process.