For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this spirit we investigate two instances of the interpretation method: matrix interpretations and context dependent interpretations. We introduce a subclass of matrix interpretations, denoted as triangular matrix interpreta...

In this our first participation in CLEF, we have applied Natural Language Processing techniques for single word and multi-word term conflation. We have tested several approaches at different levels of text processing in our experiments: firstly, we have lemmatized the text to avoid inflectional variation; secondly, we have expanded the queries through synonyms according to a fixed threshold of ...

In this paper we present the problem of representing the morphosyntactic relations in wordnets, especially the problems that arise when wordnets for languages that differ significantly from English are being developed on the basis of the Princeton wordnet, which is the case for Bulgarian and Serbian. We present the derivational characteristics of these two languages, how these characteristics a...

We propose a novel approach to translating from a morphologically complex language. Unlike previous research, which has targeted word inflections and concatenations, we focus on the pairwise relationship between morphologically related words, which we treat as potential paraphrases and handle using paraphrasing techniques at the word, phrase, and sentence level. An important advantage of this f...

We present in this paper an unsupervised method to learn suuxes and suuxation operations from an innectional lexicon of a language. The elements acquired with our method are used to build stemming procedures and can assist lexicographers in the development of new lexical resources.

A common reason for the use of analogy in (computational) problem solving is the lack of appropriate object-level knowledge, e.g. rules, necessary to solve the problem from first principles. Hence, the absence of sufficient (object-level) domain knowledge is assumed in most case-based reasoning (CBR) systems. Even those CBR systems that combine rule-based and casebased reasoning rely on a simil...

Deviating from the definition originally presented in [12], Stabler [13] introduced— inspired by some recent proposals in terms of a minimalist approach to transformational syntax—a (revised) type of a minimalist grammar (MG) as well as a certain type of a strict minimalist grammar (SMG). These two types can be shown to determine the same class of derivable string languages.

This paper deals with the derivational morphology of automatic word form recognition. It presents a set of declarative rules which augment lexical entries with information governing the allomorphic changes of derivation in addition to the existing allomorphy rules for inflection. The resulting component generates a single lexicon for derivational and inflectional allomorphy from an elementary b...

It is well known that the phonological form of a word can depend on its morphological structure. In serial approaches, this follows naturally from the fact that words have derivational histories: morphologically complex words undergo successive levels of phonology as they are constructed. A crucial distinction is typically made, however, between derivational and inflectional morphology. Whereas...