Abstract
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (quantifier raising) or complicated denotations for phrases (Cooper storage). These complications are one of the motivations for the development of categorial semantic theories. However, these theories appear to face their own difficulties in accounting for the full range of scoping possibilities in natural language, and have been losing some of their original elegance. Experiments suggest that the insights of the traditional theories may be revived in a semantically more respectable form by taking advantage of the abstraction mechanisms of higher-order hereditary Harrop formulae, as implemented in λProlog, to represent scoping and extraction dependencies without the need for formal conditions on logical forms or elaborate denotations for phrases. The technique used is an adaptation of a method of Felty and Miller for dispensing with side conditions in sequent-calculus rules. Finally, it will be seen that this approach is after all a close relative of categorial semantics.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
H. Alshawi, D. M. Carter, J. van Eijck, R. C. Moore, D. B. Moran, F. C. N. Pereira, S. G. Pulman, and A. G. Smith. Research programme in natural language processing. Final report, Cambridge Research Centre, SRI International, Cambridge, England, July 1989.
A. R. Anderson and N. D. Belnap, Jr. Entailment: the Logic of Relevance and Necessity, Volume I. Princeton University Press, Princeton, New Jersey, 1975.
J. van Benthem. Categorial grammar and lambda calculus. In D. Skordev, editor, Mathematical Logic and its Application, pages 39–60. Plenum Press, New York, New York, 1986.
J. van Benthem. Essays in Logical Semantics. Number 29 in Studies in Linguistics and Philosophy. D. Reidel, Dordrecht, Holland, 1986.
J. van Benthem. The Lambek calculus. In R. T. Oehrle, E. Bach, and D. Wheeler, editors, Categorial Grammars and Natural Language Structures, pages 35–68. D. Reidel, Dordrecht, Holland, 1988.
J. van Benthem. Categorial grammar and type theory. Journal of Philosophical Logic, 1989. to appear.
A. Colmerauer. Metamorphosis grammars. In L. Bolc, editor, Natural Language Communication with Computers, pages 133–187. Springer-Verlag, 1978. First appeared as “Les Grammaires de Metamorphose”, Groupe d'Intelligence Artificielle, Université de Marseille II, November 1975.
R. Cooper. Quantification and Syntactic Theory. Number 21 in Synthese Language Library. D. Reidel, Dordrecht, Netherlands, 1983.
H. B. Curry and R. Feys. Combinatory Logic, Volume I. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, Holland, 1968. Second printing.
M. Dalrymple, S. M. Shieber, and F. C. N. Pereira. Ellipsis and higher-order unification. Submitted for publication, 1990.
J. M. Dunn. Relevance logic and entailment. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Volume III, chapter III.3, pages 117–224. D. Reidel, Dordrecht, Holland, 1986.
J. van Eijck. Aspects of Quantification in Natural Language. PhD thesis, University of Groningen, Groningen, Holland, February 1985.
A. P. Felty. Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, Pennsylvania, 1989.
A. P. Felty and D. A. Miller. Specifying theorem provers in a higher-order logic programming language. In E. L. Lusk and R. A. Overbeek, editors, 9th International Conference on Automated Deduction, Argonne, Illinois, 1988.
M. Gawron and S. Peters. Anaphora and Quantification in Situation Theory. Number 19 in CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, California, 1990. Distributed by Chicago University Press.
J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Number 7 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, England, 1989.
B. J. Grosz, K. S. Jones, and B. L. Webber, editors. Readings in Natural Language Processing. Morgan Kaufmann, Los Altos, California, 1986.
P.-K. Halvorsen and R. M. Kaplan. Projections and semantic description in lexical-functional grammar. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 1116–1122, Tokyo, Japan, 1988. Institute for New Generation Computer Technology.
R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. In Proceedings of the Second Symposium on Logic in Computer Science, Ithaca, New York, 1987. Cornell University, IEEE.
H. Hendriks. Type change in semantics: the scope of quantification and coordination. In E. Klein and J. van Benthem, editors, Categories, Polymorphism and Unification, pages 95–120. Centre for Cognitive Science, University of Edinburgh, Edinburgh, Scotland, 1987.
J. R. Hindley and J. P. Seldin. Introduction to Combinators and λ-Calculus, volume 1 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, England, 1986.
J. R. Hobbs and S. M. Shieber. An algorithm for generating quantifier scopings. Computational Linguistics, 13:47–63, 1987.
W. Howard. The formulae-as-types notion of construction. In J. Seldin and J. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479–490. Academic Press, London, England, 1980.
E. L. Keenan and L. M. Faltz. Boolean Semantics for Natural Language. Number 23 in Synthese Language Library. D. Reidel, Dordrecht, Holland, 1985.
E. Klein. VP-ellipsis in DR theory. In J. Groenendijk and M. Stokhof, editors, Studies in Discourse Representation Theory and the Theory of Generalized Quantifiers. Foris, Dordrecht, Holland, 1987.
I. Lewin. A quantifier scoping algorithm without a free variable constraint. In H. Karlgren, editor, COLING-90, Volume 3, Finland, 1990. Helsinki University.
P. Martin-Löf. Constructive mathematics and computer programming. In Logic, Methodology and Philosophy of Science, VI, pages 153–175. North-Holland, 1982.
D. A. Miller. A logic programming language with lambda abstraction, function variables and simple unification. In P. Schroeder-Heister, editor, Extensions of Logic Programming, Lecture Notes in Artificial Intelligence. Springer-Verlag, 1990.
D. A. Miller, G. Nadathur, and A. Scedrov. Hereditary Harrop formulas and uniform proof systems. In Proceedings of the Second Symposium on Logic in Computer Science, Ithaca, New York, 1987. Cornell University, IEEE.
R. Montague. English as a formal language. In R. H. Thomason, editor, Formal Philosphy. Yale University Press, 1974.
R. Montague. The proper treatment of quantification in ordinary English. In R. H. Thomason, editor, Formal Philosophy. Yale University Press, 1974.
R. Montague. Universal grammar. In R. H. Thomason, editor, Formal Philosophy. Yale University Press, 1974.
R. C. Moore. Unification-based semantic interpretation. In 27th Annual Meeting of the Association for Computational Linguistics, pages 33–41, Vancouver, British Columbia, 26–29 June 1989. Association for Computational Linguistics, Morristown, New Jersey.
M. Moortgat. Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus. PhD thesis, University of Amsterdam, Amsterdam, Holland, October 1988.
D. B. Moran. Quantifier scoping in the SRI Core Language Engine. In 26th Annual Meeting of the Association for Computational Linguistics, pages 33–47, Buffalo, New York, 1988. Association for Computational Linguistics, Morristown, New Jersey.
G. Nadathur. A Higher-Order Logic as the Basis for Logic Programming. PhD thesis, University of Pennsylvania, 1986.
G. Nadathur and D. A. Miller. An overview of λProlog. In Fifth International Logic Programming Conference, pages 810–827, Seattle, Washington, August 1988. MIT Press.
R. Pareschi and D. A. Miller. Extending definite clause grammars with scoping constructs. In D. H. D. Warren and P. Szeredi, editors, Seventh International Conference on Logic Programming, Jerusalem, Israel, 1990. MIT Press.
F. C. N. Pereira. Logic for Natural Language Analysis. PhD thesis, University of Edinburgh, Edinburgh, Scotland, 1982. Reprinted as Technical Note 275, January 1983, Artificial Intelligence Center, SRI International, Menlo Park, California.
F. C. N. Pereira. Categorial semantics and scoping. Computational Linguistics, 16(1):1–10, 1990.
F. C. N. Pereira and S. M. Shieber. Prolog and Natural-Language Analysis. Number 10 in CSLI Lecture Notes. Center for the Study of Language and Information, Stanford, California, 1985. Distributed by Chicago University Press.
F. C. N. Pereira and D. H. D. Warren. Definite clause grammars for language analysis—a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence, 13:231–278, 1980. Reprinted in [17].
D. Prawitz. Natural Deduction: A Proof-Theoretical Study. Almqvist and Wiksell, Uppsala, Sweden, 1965.
S. Stenlund. Combinators, λ-Terms and Proof Theory. D. Reidel, Dordrecht, Holland, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pereira, F.C.N. (1991). Semantic interpretation as higher-order deduction. In: van Eijck, J. (eds) Logics in AI. JELIA 1990. Lecture Notes in Computer Science, vol 478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018435
Download citation
DOI: https://doi.org/10.1007/BFb0018435
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53686-4
Online ISBN: 978-3-540-46982-7
eBook Packages: Springer Book Archive