Computational semantics in type theory
Author:
Open Access
- 1 January 2004
- journal article
- Published by OpenEdition in Mathématiques et sciences humaines
- Vol. 165 (165)
Abstract
This paper aims to show how Montague-style grammars can be completely formalized and thereby declaratively implemented by using the Grammatical Framework GF. The implementation covers the fundamental operations of Montague’s PTQ model: the construction of analysis trees, the linearization of trees into strings, and the interpretation of trees as logical formulas. Moreover, a parsing algorithm is derived from the grammar. Given that GF is a constructive type theory with dependent types, the technique extends from explain anaphoric reference. On the other hand, GF has a built-in compositionality requirement that is stronger than in PTQ and prevents us from formulating quantifying-in rules of Montague style. This leads us to alternative formulations of such rules in terms of combinators and discontinuous constituents. The PTQ fragment will moreover be presented as an example of how a GF grammar is modified by replacing English with another target language, French. The paper concludes by a discussion of the complementary rôles of logically and linguistically oriented syntax.Keywords
This publication has 5 references indexed in Scilit:
- Head-driven Phrase Structure Grammar. By Carl Pollard and Ivan A. Sag Chicago & London: The University of Chicago Press, 1994. Pp. xi, 440.Language, 1996
- Type-Theoretical Grammar1995
- Prolog and natural language analysis . By Fernando C.N. Pereira and Stuart M. Shieber (CSLI Lecture Notes 10.) Stanford: Center for the Study of Language and Information, 1987. Pp. viii, 266.Language, 1988
- Computational realization of a generalized phrase structure grammarACM SIGART Bulletin, 1982
- A parsing method for montague grammarsLinguistics and Philosophy, 1978