Wyniki wyszukiwania - BazTech

1

Integrating LFG’s binding theory with PCDRT

Dalrymple M., Haug D. T. T., Lowe J. J.

Journal of Language Modelling

|

2018

|

Vol. 6, No. 1

87--129

EN

We provide a formal model for the interaction of syntax and pragmatics in the interpretation of anaphoric binding constraints on personal and reflexive pronouns. We assume a dynamic semantics, where type e expressions introduce discourse referents, and contexts are assignments of individuals to discourse referents. We adopt the Partial Compositional Discourse Representation Theory (PCDRT) of Haug (2014b), whereby anaphoric resolution is modelled in terms of a pragmatically-established relation between discourse referents. We integrate PCDRT into the constraint-based grammatical framework of Lexical Functional Grammar (LFG), and show how it is possible to state syntactic constraints on the pragmatic resolution of singular and plural anaphora within this framework.

2

Factivity and presupposition in Dependent Type Semantics

Tanaka R., Mineshima K., Bekki D.

Journal of Language Modelling

|

2017

|

Vol. 5, No. 2

385--420

EN

Dependent type theory has been applied to natural language semantics to provide a formally precise and computationally adequate account of dynamic aspects of meaning. One of the frameworks of natural language semantics based on dependent type theory is Dependent Type Semantics (DTS), which focuses on the compositional interpretations of anaphoric expressions. In this paper, we extend the framework of DTS with a mechanism to handle logical entailment and presupposition associated with factive verbs such as know. Using the notion of proof objects as first-class objects, we provide a compositional account of presuppositional inferences triggered by factive verbs. The proposal also gives a formal reconstruction of the type-distinction between propositions and facts, and thereby accounts for the lexical semantic differences between factive and non-factive verbs in a typetheoretical setting.

3

Versatility of 'Continuations' in Discourse Semantics

Dinu A.

Fundamenta Informaticae

|

2011

|

Vol. 112, nr 4

263-280

EN

We show in this paper how the computer science concept of ’continuations’, togetherwith categorial grammars and a type shiftingmechanism, is able to account for a wide range of natural language semantic phenomena, such as hierarchical discourse structure, ellipses, accommodation and free-focus and bound-focus anaphora. The merit of continuations in the dynamic semantics framework is that they abstract away from assignment functions that are essential to the formulations of Dynamic Intensional Logic, DynamicMontague Grammar, Dynamic Predicate Logic and Discourse Representation Theory, Thus, continuation style semantic do not pose problems such as the destructive assignment problem in Dynamic Predicate Logic or the variable clash problem in Discourse Representation Theory. We argue that continuations are a versatile and powerful tool, particularly well suited to manipulate scope and long distance dependencies, phenomena that abound in natural language semantics.

4

Discourse interpretation based on dynamic constraints

Piasecki M.

Archives of Control Sciences

|

2005

|

Vol. 15, no. 3

403-414

EN

Our main objective will be to construct a fully compositional representation of nominal anaphora in discourse. The proposed representation is not dependent on the remote ascription (i.e. done outside the formal representation) of syntactic indexes, which identify anaphoric links. A formal language of variable free logic is introduced. It is based on dynamic semantics paradigm and is a variant of many-sorted type logic. We will also present the scope free treatment of quantification in multiple quantifier sentences. The interpretation of multiple quantifiers is defined by means of a construction of the polyadic Generalised Quantifier (GQ). The polyadic GQ is a constraint that should be satisfied by the denotation of a ?clausal? predicate.