Semantic and Pragmatic computing with GETARUNS

5Citations
Citations of this article
71Readers
Mendeley users who have this article in their library.

Abstract

We present a system for text understanding called GETARUNS, in its deep version applicable only to Closed Domains. We will present the low level component organized according to LFG theory. The system also does pronominal binding, quantifier raising and temporal interpretation. Then we will introduce the high level component where the Discourse Model is created from a text. Texts belonging to closed domains are characterized by the fact that their semantics is controlled or under command of the system; and most importantly, sentences making up the texts are fully parsed without failures. In practice, these texts are short and sentences are also below a certain threshold, typically less than 25 words. For longer sentences the system switches from the topdown to the bottomup system. In case of failure it will backoff to the partial system which produces a very lean and shallow semantics with no inference rules. The small text we will present contains what is called a "psychological statement" sentence which contributes an important bias as to the linking of the free pronominal expression contained in the last sentence.

Cite

CITATION STYLE

APA

Delmonte, R. (2008). Semantic and Pragmatic computing with GETARUNS. In Semantics in Text Processing, STEP 2008 - Conference Proceedings (pp. 287–298). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1626481.1626504

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free