Abstract
The idea of viewing parsing as deduction has been a powerful way of explaining formally the foundations of natural language processing systems. According to this view, the role of grammatical description is to write logical axioms from which the well-formedness of sentences in a natural language can be deduced.
However, this view is at odds with work on unification grammars, where categories are given complex descriptions and the process of building satisfying models is at least as relevant as that of building deductive proofs. In some work feature logics are even used to replace the context-free component of grammars. From this work emerges the view that grammatical description is more like writing down a set of constraints, with well-formed sentences being the possible solutions to these constraints. In this paper, we concentrate on Definite Clause Grammars (DCGs), the paradigm example of “parsing as deduction”. The fact that DCGs are based on using deduction (validity) and unification grammar approaches are based on constructing models (satisfiability) seems to indicate a significant divergence of views. However, we show that, under some plausible assumptions, the computation involved in using deduction to derive consequences of DCG clauses produces exactly the same results as would be produced by a process of model building using a set of axioms derived syntactically from the original clauses.
This then suggests that there is a single view of parsing (and generation) that reconciles the two approaches. This is a view of parsing as model-building, not a view of parsing as deduction. Even in the original paradigm case there is some doubt as to whether “parsing as deduction” is the best, or only, explanation of what is happening.
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
Aït-Kaci, H. and Podelski, A., “Towards a Meaning of LIFE”, Journal of Logic Programming Vol 16, Nos 3,4, 1993.
Clark, K. L., “Negation as Failure” in Gallaire, H. and Minker, J. (Eds), Logic and Databases, Plenum Press, 1978.
Emele, M. and Zajac, R., “Typed Unification Grammars”, in Procs of the 13th International COLING, 1990.
Emele, M., “Die TFS Sprache und ihre Implementierung”, IMS, Universität Stuttgart, Germany, 1994.
Höhfeld, M. and Smolka, G., “Definite Relations over Constraint Languages”, LILOG report 53, IBM Deutschland, 1988.
Johnson, M., “Two Ways of Formalizing Grammars”, Cognitive and Linguistic Sciences, Brown University, 1992.
Bresnan, J. and Kaplan, R., “Lexical-Functional Grammar: A Formal System for Grammatical Representation”, in Bresnan, J., Ed., The Mental Representation of Grammatical Relations, MIT Press, 1982.
Colmerauer, A., “Metamorphosis Grammars”, in Bolc, L., Ed., Natural Language Communication with Computers, Springer Verlag, 1978.
Hobbs, J., Stickel, M., Appelt, D. and Martin, P., “Interpretation as Abduction”, Artificial Intelligence Vol 63, Nos 1–2, pp69–142, 1993.
Kasper, R. and Rounds, W., “A Logical Semantics for Feature Structures”, in Proceedings of the 24th Annual Meeting of the ACL, 1986.
Kowalski, R., Logic for Problem Solving, North Holland, 1979, Chapter 11.
Lloyd, J. W. Foundations of Logic Programming, Springer Verlag, Second Edition, 1987.
Manandhar, S., Relational Extensions to Feature Logic: Applications to Constraint-Based Grammars, PhD thesis, University of Edinburgh, 1993.
Manaster-Ramer, A. and Rounds, W., “A Logical Version of Functional Grammar”, in Procs of the 25th Annual Meeting of the ACL, 1987.
Pereira, F. and Warren, D., “Definite Clause Grammars for Language Analysis-a Survey of the Formalism and a Comparison with Augmented Transition Networks”, Artificial Intelligence Vol 13, pp231–278, 1980.
Pereira, F. and Warren, D., “Parsing as Deduction”, in Proceedings of the 21st Annual Meeting of the ACL, 1983.
Reiter, R. and Mackworth, A. K., “A Logical Framework for Depiction and Image Interpretation”, Artificial Intelligence Vol 41, pp125–155, 1989/90.
Shieber, S., An Introduction to Unification-Based Theories of Grammar, CSLI Lecture Notes Series, University of Chicago Press, 1986.
Shieber, S., “A uniform architecture for parsing and generation”, Procs of 12th COLING, 1988.
Smolka, G., “Feature Constraint Logics for Unification Grammars”, Journal of Logic Programming Vol 12, Nos 1&2, pp51–88, 1992.
Wedekind, J., (Ed.), “A Survey of Linguistically Motivated Extensions to Unification-Based Formalisms”, Deliverable R3.1.A, ESPRIT Basic Research Action BR3175 (DYANA), 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mellish, C. (2002). DCGs: Parsing as Deduction?. In: Kakas, A.C., Sadri, F. (eds) Computational Logic: Logic Programming and Beyond. Lecture Notes in Computer Science(), vol 2408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45632-5_21
Download citation
DOI: https://doi.org/10.1007/3-540-45632-5_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43960-8
Online ISBN: 978-3-540-45632-2
eBook Packages: Springer Book Archive