The terminology and notation used in this paper have been introduced in the following articles: [29], [16], [12], [13], [11], [1], [2], [32], [18], [30], [24], [25], [26], [27], [3], [9], [34], [35], [33], [28], [15], [21], [37], [10], [31], [20], [23], [5], [14], [6], [22], [8], [4], [19], [36], and [7]. Let I be a set and let J be a relational structure yielding many sorted set indexed by I. ...

The task of binary relation extraction in IE [3] is based mainly on high-frequent verbs and patterns. During the extraction of a specific relation from MEDLINE English abstracts, it is noticed that besides the high-frequent verb itself which represents the specific relation, some other word forms, such as the nominal and adjective forms of this verb, as well as its synonyms, also play a very im...

1 Introduction Nowadays, very large volume of texts are created and stored in computer, and as a result the retrieval of texts which fits to a user's demand has become a difficult problem. Hypertext is a typical system to answer this problem , whose primary objective is to establish flexible as-sociative links between relevant text parts and to allow users to select and trace links to see relev...

We present a novel framework for word alignment that incorporates synonym knowledge collected from monolingual linguistic resources in a bilingual probabilistic model. Synonym information is helpful for word alignment because we can expect a synonym to correspond to the same word in a different language. We design a generative model for word alignment that uses synonym information as a regulari...

This paper extends the previous work on constructing reputation axiomatics [28] to define context-dependent reputation (e.g. occupation-specific). In short, to employ theoretic-set approach, both notions of reputation and recommendations are downcasted to the basic notion of responsibility. Notion of “a context” is understood as a synonym of “a universe of discourse”.

In this paper i is a set. Let I be a set, let f be a many sorted set indexed by I, and let p be a finite sequence of elements of I. One can check that f · p is finite sequence-like. Let S be a non empty many sorted signature. A sort symbol of S is an element of S. Let S be a non empty many sorted signature. (Def. 1) An element of the operation symbols of S is said to be an operation symbol of S...

In this paper, we present an approach for retrieving relevant articles from the biomedical corpus. Our first run considered four kinds of operators as query expansion. The operators are phrase, mandatory, optional and synonym set. The second run lowered the ranking of documents which contained query terms only in their MeSH fields. The results of the official runs and further experiments were l...

This document reports on the restructuring of the Inter-LingualIndex to provide a more efficient mapping across the wordnets. By adding so-called Composite ILIs that group closely related senses it is possible to connect synsets that cannot be matched otherwise. Status of the abstract Complete