Results 1  10
of
122
On the Semantics and Pragmatics of Linguistic Feedback
 JOURNAL OF SEMANTICS
, 1993
"... This paper is an exploration in the semantics and pragmatics of linguistic feedback, i.e., linguistic mechanisms which enable the participants in spoken interaction to exchange information about basic communicative functions, such as contact, perception, understanding, and attitudinal reactions to t ..."
Abstract

Cited by 167 (31 self)
 Add to MetaCart
(Show Context)
This paper is an exploration in the semantics and pragmatics of linguistic feedback, i.e., linguistic mechanisms which enable the participants in spoken interaction to exchange information about basic communicative functions, such as contact, perception, understanding, and attitudinal reactions to the communicated content. Special attention is given to the type of reaction conveyed by feedback utterances, the communicative status of the information conveyed (i. e., the level of awareness and intentionality of the communicating sender), and the context sensitivity of feedback expressions. With regard to context sensitivity, which is one of the most characteristic features of feedback expressions, the discussion focuses on the way in which the type of speech act (mood), the factual polarity and the information status of the preceding utterance influence the interpretation of feedback utterances. The different content dimensions are exemplified by data from recorded dialogues and by data given through linguistic intuition. Finally, two different ways of formalizing the analysis are examined, one using attributevalue matrices and one based on the theory of situation semantics.
A Method for Disjunctive Constraint Satisfaction
 In Masaru Tomita (ed.), Current Issues in Parsing Technologies
, 1991
"... A distinctive propertyofmanycurrent grammatical formalisms is their use of feature equality constraints to express a wide variety of grammatical dependencies. LexicalFunctional Grammar[6], HeadDriven PhraseStructure Grammar[14], PATR[8], FUG[12, 13], and the various forms of categorial uni cation ..."
Abstract

Cited by 107 (5 self)
 Add to MetaCart
A distinctive propertyofmanycurrent grammatical formalisms is their use of feature equality constraints to express a wide variety of grammatical dependencies. LexicalFunctional Grammar[6], HeadDriven PhraseStructure Grammar[14], PATR[8], FUG[12, 13], and the various forms of categorial uni cation grammar[9,15,16] all require an analysis of a sentence
An Expanded Logical Formalism for HeadDriven Phrase Structure Grammar
, 1994
"... . Though [Pollard and Sag 1994] assumes that an unspecified variant of the formal logic of [Carpenter 1992] will provide a formalism for HPSG, a precise formulation of the envisaged formalism is not immediately obvious, primarily because a principal tenet of [Carpenter 1992], that feature structures ..."
Abstract

Cited by 103 (8 self)
 Add to MetaCart
. Though [Pollard and Sag 1994] assumes that an unspecified variant of the formal logic of [Carpenter 1992] will provide a formalism for HPSG, a precise formulation of the envisaged formalism is not immediately obvious, primarily because a principal tenet of [Carpenter 1992], that feature structures represent partial information, seems to conflict with a principal tenet of [Pollard and Sag 1994], that feature structures represent abstract linguistic entities. This has caused many HPSGians to be mistakenly concerned with partialinformation specific notions, such as subsumption, that are appropriate for the [Carpenter 1992] logic but inappropriate for the formalism [Pollard and Sag 1994] envisages. This paper hopes to allay this concern and the confusion it engenders by substituting [King 1989] for [Carpenter 1992] as the basis of the envisaged formalism. It demonstrates that the formal logic of [King 1989] provides a formalism for HPSG that meets all [Pollard and Sag 1994] asks of the ...
Feature Constraint Logics for Unification Grammars
 Journal of Logic Programming
, 1992
"... This paper studies feature description languages that have been developed for use in unification grammars, logic programming and knowledge representation. The distinctive notational primitive of these languages are features that can be understood as unary partial functions on a domain of abstract ..."
Abstract

Cited by 92 (10 self)
 Add to MetaCart
(Show Context)
This paper studies feature description languages that have been developed for use in unification grammars, logic programming and knowledge representation. The distinctive notational primitive of these languages are features that can be understood as unary partial functions on a domain of abstract objects. We show that feature description languages can be captured naturally as sublanguages of firstorder predicate logic with equality and show the equivalence of a loose Tarski semantics with a fixed feature graph semantics for quantifierfree constraints. For quantifierfree constraints we give a constraint solving method and show the NPcompleteness of satisfiability checking. For general feature constraints with quantifiers satisfiability is shown to be undecidable. Moreover, we investigate an extension of the logic with sort predicates and setdenoting expressions called feature terms.
A Feature Logic with Subsorts
 LILOG Report 33, IWBS, IBM Deutschland
, 1992
"... This paper presents a set description logic with subsorts, feature selection (the inverse of unary function application), agreement, intersection, union and complement. We define a model theoretic open world semantics and show that sorted feature structures constitute a canonical model, that is, ..."
Abstract

Cited by 81 (4 self)
 Add to MetaCart
(Show Context)
This paper presents a set description logic with subsorts, feature selection (the inverse of unary function application), agreement, intersection, union and complement. We define a model theoretic open world semantics and show that sorted feature structures constitute a canonical model, that is, without loss of generality subsumption and consistency of set descriptions can be considered with respect to feature structures only. We show that deciding consistency of set descriptions is an NPcomplete problem. To appear in: J. Wedekind and C. Rohrer (eds.), Unification in Grammar. The MIT Press, 1992 This text is a minor revision of LILOG Report 33, May 1988, IBM Deutschland, IWBS, Postfach 800880, 7000 Stuttgart 80, Germany. The research reported here has been done while the author was with IBM Deutschland. The author's article [23] is a more recent work on feature logics. 1 1 Introduction This paper presents a set description logic that generalizes and integrates formalisms...
A Featurebased Constraint System for Logic Programming with Entailment
, 1992
"... This paper presents the constraint system FT, which we feel is an intriguing alternative to Herbrand both theoretically and practically. As does Herbrand, FT provides a universal data structure based on trees. However, the trees of FT (called feature trees) are more general than the trees of Herbran ..."
Abstract

Cited by 72 (20 self)
 Add to MetaCart
This paper presents the constraint system FT, which we feel is an intriguing alternative to Herbrand both theoretically and practically. As does Herbrand, FT provides a universal data structure based on trees. However, the trees of FT (called feature trees) are more general than the trees of Herbrand (called constructor trees), and the constraints of FT are finer grained and of different expressivity. The basic notion of FT are functional attributes called features, which provide for recordlike descriptions of data avoiding the overspecification intrinsic in Herbrand's constructorbased descriptions. The feature tree structure fixes an algebraic semantics for FT. We will also establish a logical semantics, which is given by three axiom schemes fixing the firstorder theory FT. FT is a constraint system for logic programming, providing a test for unsatisfiability, and a test for entailment between constraints, which is needed for advanced control mechanisms. The two major technical con...
The Computational Analysis of the Syntax and Interpretation of "Free" Word Order in Turkish
, 1995
"... ..."
Representation and Reasoning with Attributive Descriptions
 IWBS Report 81 , IBM Deutschland
, 1989
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 61 (12 self)
 Add to MetaCart
(Show Context)
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Phonological Events
 Journal of Linguistics
, 1990
"... this article concerns autosegmental representations, and not the rules which are presumed to manipulate them. Due to the expository goals of this paper we have not attempted to carry out a detailed analysis of a large body of phonological data, however we acknowledge that this is an important task a ..."
Abstract

Cited by 45 (9 self)
 Add to MetaCart
(Show Context)
this article concerns autosegmental representations, and not the rules which are presumed to manipulate them. Due to the expository goals of this paper we have not attempted to carry out a detailed analysis of a large body of phonological data, however we acknowledge that this is an important task and it is one that we intend to undertake in future work. Deriving the NoCrossing Constraint Sagey defines three relations on temporal units: simultaneity, precedence and overlap. Certain facts about the first two relations (and presumably the third also) are taken to be `included in our knowledge of the world' (p.110). We begin with a brief review of these facts. Temporal overlap is a twoplace relation which is reflexive, symmetric and nontransitive. If we employ the notation x ffi y for the statement `x overlaps y' then these facts about overlap can be stated as follows: (1) a. For any x, x ffi x overlap is reflexive
On the Expressivity of Feature Logics with Negation, Functional Uncertainty, and Sort Equations
 JOURNAL OF LOGIC, LANGUAGE AND INFORMATION
, 1993
"... Feature logics are the logical basis for socalled unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional uncertainty construct needed for the description of longdistance dependencies and obtain the following resu ..."
Abstract

Cited by 44 (13 self)
 Add to MetaCart
(Show Context)
Feature logics are the logical basis for socalled unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional uncertainty construct needed for the description of longdistance dependencies and obtain the following results: satisfiability of feature terms is undecidable, sort equations can be internalized, consistency of sort equations is decidable if there is at least one atom, and consistency of sort equations is undecidable if there is no atom.