Denna webbplats fungerar bättre i en webbläsare som stöder webbstandards, men är tillgänglig i alla webbläsare och andra typer av Interntapparater.

UPPSALA UNIVERSITET : Inst. f. lingvistik och filologi : M. Dahllöf
Uppsala universitet
Hoppa över länkar

Token Dependency Semantics

Mats Dahllöf

Token dependency semantics (TDS) is a surface-oriented and dependency-based approach to truth-conditional computational semantics. This framework represents an attempt to combine the constraint-based methods of HPSG with a Donald Davidson-style nominalist and ontologically parsimonious view of meaning. In particular, it uses ideas from Donald Davidson's so-called paratactic approach to intensional constructions. Donald Davidson's proposal has been developed into a computational approach with the help of mechanisms introduced in Minimal Recursion Semantics. The TDS analysis is applied directly to linguistic tokens, whose semantically elementary subtokens are connected by means of basic binary relations. Logical form is taken to be a matter of two dimensions: scope and coindexation. The scopal relations connect the semantically elementary subtokens into a dependency tree. See my article “Token Dependency Semantics and the Paratactic Analysis of Intensional Constructions”, Journal of Semantics 19 (2002), 333-368.

I have developed and used a typed feature structure grammar tool in the context of this research. It comes with a web interface and is called Prolog-embedding typed feature structure grammar and grammar tool (PETFSG-II) [web page]. I have used the PETFSG-II tool to implement (and develop) the TDS fragment of the Journal of Semantics article [documentation and demo].

Publications on Token Dependency Semantics

2003, “An Annotational Approach to Compositional Semantics”, in J. Nivre and E. Hinrichs (eds.) Proceedings of the Second Workshop on Treebanks and Linguistic Theories (TLT 2003), Växjö University Press, 33-44. [pdf]

2003, Two Reports on Computational Syntax and Semantics (RUUL vol. 36) (“Prolog-Embedding Typed Feature Structure Grammar (PETFSG-II.2) and Grammar Tool”, “An Implementation of Token Dependency Semantics for a Fragment of English”), Dept of Linguistics. [ps - pdf]

2002, “Token Dependency Semantics and the Paratactic Analysis of Intensional Constructions”, Journal of Semantics 19, 333-368.

1999, Three Papers on Computational Syntax and Semantics (RUUL vol. 34) (“Prolog-embedding feature structure grammar”, “Implementing token-based minimal recursion semantics”, “Predicate-functor logic”), Uppsala University, Dept of Linguistics. [ps - pdf]