Abstract
This paper attempts to clarify two distinct notions of "reversibility": (i)Uniformity of implementationof parsing and generation, and (ii) reversibility as aninherent (or intrinsic) property ofgrammars. On the one hand, we explain why grammars specified as definite programs (or the various related "unification grammars") lead to uniformity of implementation. On the other hand, we define different intrinsic reversibility properties for such grammars—the most important being finitereversibilitywhich says that both parsing and generation arefinitelyenumerable (see text)— and give examples and counter-examples of grammars which possess or do not possess these intrinsic properties. We also show that, under a certain "moderation" condition on linguistic description, finite enumerability of parsing is equivalent to finite enumerability of generation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. J. Cutland.Computability.Cambridge University Press, Cambridge, England, 1980.
Marc Dymetman and Pierre Isabelle. Reversible logic grammars for machine translation. In Proceedings of the Second International Conference on Theoretical and Methodological Issues in Machine Translation of Natural Languages, Pittsburgh, PA, June 1988. Carnegie Mellon University.
Marc Dymetman, Pierre Isabelle, and Francois Perrault. A symmetrical approach to parsing and generation. InProceedings of the 13th International Conference on Computational Linguisticsvolume 3, pages 90–96, Helsinki, August 1990.
Marc Dymetman. Inherently reversible grammars, logic programming, and computability. InProceedings of the ACL Workshop: Reversible Grammar in Natural Language Processingpages 20–30, Berkeley, CA, June 1991.
Marc Dymetman. A Generalized Greibach Normal Form for Definite Clause Grammars. InProceedings of the 14th International Conference on Computational Linguisticspages 366–72, Nantes, France, 1992.
Marc Dymetman. Transformations de Grammaires Logiques et Riversibiliti en Traduction Automatique. Thhse d'Etat, Universiti Joseph Fourier, Grenoble, France, 1992.
L. T. F. Gamut. Logic, Language and Meaning, volume 2: Intensional Logic and Logical Grammar. The University of Chicago Press, Chicago, IL, 1991.
M. R. Garey and D. S. Johnson.Computers and Intractability: A Guide to the theory of NP-Completeness. W.H. Freeman, San Francisco, CA, 1976.
Gerald Gazdar, Ewan Klein, Geoffrey Pullum, and Ivan Sag.Generalized Phrase Structure Grammar.Basil Blackwell, Oxford, England, 1985.
Mark Johnson.Attribute-Value Logic and the Theory of Grammar.CSLI lecture note No. 16. Center for the Study of Language and Information, Stanford, CA, 1988.
John Wylie Lloyd.Foundations of Logic Programming.Springer-Verlag, Berlin, second edition, 1987.
Roger C. Lyndon.Notes on Logic.Van Nostrand, New York, NY, 1966.
Richard Montague.Formal Philosophy: Selected papers of Richard Montague.Yale University Press, 1974. Edited and with an introduction by Richmond H. Thomason.
Michael Moortgat.Categorial Investigations: Logical and Linguistic aspects of the Lambek Calculus.Foris Publications, Dordrecht, 1988.
Richard A. O'Keefe.The Craft of Prolog.MIT Press, Cambridge, MA, 1990.
Fernando C. N. Pereira and David H. D. Warren. Parsing as deduction. InProceedings of the 21th Annual Meeting of the Association for Computational Linguisticspages 137–144, MIT, Cambridge, MA, June 1983.
Francois Perrault.Un nouveau formalisme de grammaire logique réversible. Master's thesis, McGill University, Montréal, Canada, 1991.
R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems.Communications of the ACM21:120–126, February 1978.
Stuart M. Shieber. An Introduction to Unification-Based Approaches to Grammar. CSLI lecture note No. 4, Stanford, CA, 1986.
Stuart M. Shieber. A uniform architecture for parsing and generation. InProceedings of the 12th International Conference on Computational Linguisticspages 614–619, Budapest, August 1988.
Stuart M. Shieber. Parsing and type inference for natural and computer languages. Technical note 460, SRI International, Menlo Park, CA, 1989. (Ph.D. dissertation, Department of Computer Science, Stanford University).
Stuart M. Shieber, Gertjan van Noord, Robert Moore, and Fernando Pereira. A semantic-head-driven generation algorithm for unification-based formalisms. InProceedings of the 27th Annual Meeting of the Association for Computational Linguisticspages 7–17, Vancouver, BC, Canada, June 1989.
Tomek Strzalkowski and Ping Peng. Automated inversion of logic grammars for generation. InProceedings of the 28th Annual Meeting of the Association for Computational Linguisticspages 212–19, Pittsburgh, PA, June 1990.
Tomek Strzalkowski. A general computational method for grammar inversion. InProceedings of the ACL Workshop: Reversible Grammar in Natural Language Processingpages 91–99, Berkeley, CA, June 1991.
Gertjan van Noord.BUG: A directed bottom-up generator for unification based formalisms. Technical report, RUU, Department of Linguistics, Utrecht, Holland, 1989.
Gertjan van Noord. Towards convenient bi-directional grammar formalisms. InProceedings of the 13th International Conference on Computational Linguisticsvolume 2, pages 294–298, Helsinki, August 1990.
Gertjan van Noord. Reversibility in Natural Language Processing. CIPGegevens Koninklijke Bibliotheek, Den Haag, Holland, 1993. (Ph.D. dissertation).
R00E9mi Zajac. A uniform architecture for parsing, generation and transfer. In Proceedings of the ACL Workshop:Reversible Grammar in Natural Language Processing, Berkeley, CA, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Dymetman, M. (1994). Inherently Reversible Grammars. In: Strzalkowski, T. (eds) Reversible Grammar in Natural Language Processing. The Springer International Series in Engineering and Computer Science, vol 255. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2722-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2722-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6173-2
Online ISBN: 978-1-4615-2722-0
eBook Packages: Springer Book Archive