語用論(Pragmatics)を考える

The Generative Lexicon

In this paper, I will discuss four major topics relating to current research in lexical semantics: methodology, descriptive coverage, adequacy of the representation, and the computational usefulness of representations. In addressing these issues, I will discuss what I think are some of the central problems facing the lexical semantics community, and suggest ways of best approaching these issues. Then, I will provide a method for the decomposition of lexical categories and outline a theory of lexical semantics embodying a notion of cocompositionality and type coercion, as well as several levels of semantic description, where the semantic load is spread more evenly throughout the lexicon. I argue that lexical decomposition is possible if it is performed generatively. Rather than assuming a fixed set of primitives. I will assume a fixed number of generative devices that can be seen as constructing semantic expressions. I develop a theory of Qualia Structure, a representation language for lexical items, which renders much lexical ambiguity in the lexicon unnecessary, while still explaining the systematic polysemy that words carry. Finally, I discuss how individual lexical structures can be integrated into the larger lexical knowledge base through a theory of lexical inheritance. This provides us with the necessary principles of global organization for the lexicon, enabling us to fully integrate our natural language lexicon into a conceptual whole.

The generative lexicon

The semantics of definite and indefinite noun phrases : a dissertation

In 1957, the Polish logician Andrej Mostowski pointed out that there are many mathematically interesting quantifiers that are not definable in terms of the first-order ∀, ∃ and initiated study of so-called generalized quantifiers (cf. Mostowski, 1957). Since then logicians have discovered and studied a large number of generalized quantifiers. At last count there were well over 200 research papers in this area. Most of this work has been directed toward cardinality quantifiers (e.g. Keisler, 1969) and topological quantifiers (e.g. Sgro, 1977) which are not particularly relevant to natural language, but even so, it has forced logicians to rethink the traditional theory of quantification.

Generalized quantifiers and natural language

This paper presents a novel account of the syntax and semantics of questions, making use of the framework for linguistic description developed by Richard Montague (1974). Certain features of the proposal are based on work by N. Belnap (1963), L. Aqvist (1965), C. L. Baker (1968, 1970), S. Kuno and J. Robinson (1972), C. L. Hamblin (1973), E. Keenan and R. Hull (1973), J. Hintikka (1974), Lewis (1975), and D. Wunderlich (1975), but it differs from all of its predecessors in one way or another. I will start with a number of observations which provide the basis for the treatment of questions presented in the second part of the paper and conclude with a summary and a brief discussion of how the proposed description compares with recent transformational analyses.

Syntax and Semantics of Questions

The finite-state paradigm of computer sciences has provided a basis for natural-language applications that are efficient, elegant and robust. This volume is a practical guide to finite-state theory and the affiliated programming languages lexc and xfst. Readers will learn how to write tokenizers, spelling checkers, and especially morphological analyzer/generators for words in English, French, Finnish, Hungarian and other languages. Included are graded introductions, examples, and exercises suitable for individual study as well as formal courses. These take advantage of widely tested lexc and xfst applications that are just becoming available for noncommercial use via the Internet.

Finite State Morphology

According to a pragmatic view, the presuppositions of a sentence detrmine the class of contexts in which the sentence could be felicitously uttered. Complex sentences present a difficult problem in this framework. No simple \"projection method\" has been found by which we could compute their presuppositions from those of their constituent clauses. This paper presents a way to eliminate the projection problem. A recursive definition of \"satisfaction of presuppositions\" is proposed that makes it unnecessary to have any explicit method for assigning presuppositions to compound sentences. A theory of presuppositions becomes a theory of contraints on successive contexts in a fully explicit discourse.

Presupposition and linguistic context

struction. This is because of many noar paraphrases of the f o l l o w i n g type. (23) (a) John wants a car. -John warts to heve a car. (b) I suggest an immediate halt ir~ the bombing I suggest that there be an i t r w r ~ d i a t e h a l t in the

Discourse referents

/pdf/presuppositions-of-compound-sentences-4vd5bfolyh.pdf

Lauri Karttunen

Papers

Syntax and Semantics of Questions

Finite State Morphology

Presupposition and linguistic context

Discourse referents

Presuppositions of Compound Sentences