In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining different criteria. All current investigations to analyze the derivational complexity are based on a single termination proof, possibly preceded by transformations. We prove that the modular framework is strictly more powerful than th...

Dept. of Computational Linguistics, School of Languages, Mahatma Gandhi Antarrashtriya Hindi VishwaVidyalaya,Wardha (MS) Abstract: Morphological analysis is the most remarkable stage for the development of Maithili-English-Hindi MT system under NLP. This paper is motivated to design a morph analyzer for Maithili language and as add-on of Maithili MT system for appropriate analysis at the morpho...

DEVELOPMENT OF A TRANSLATION MEMORY SYSTEM FOR TURKISH TO ENGLISH This thesis studies on translation memory systems and development of a translation memory system on Turkish to English. A translation memory system is a tool that is designed for helping human translators during translation. It uses a database that consists of text parts such as blocks, paragraphs, sentences, or phrases in one la...

Abstract Context-sensitive rewriting is a restriction of where reduction steps are allowed on specific arguments $$\mu (f)\subseteq \{1,\ldots ,k\}$$ μ ( f ) ⊆ { 1 , … <mml:mi...

Recent work in syntactic theory has been much concerned with the issue of derivationality vs. representationality in the application of syntactic principles. Arguments for an essentially derivational approach to syntactic relations, whereby syntactic principles apply in an on-line fashion, during the course of the derivation, rather than at independently identified levels of representation such...

It is a tacit assumption of much linguistic inquiry that all distinct derivations of a string should assign distinct meanings. But despite the tidiness of such derivational uniqueness, there seems to be no a priori reason to assume that a gramma r must have this property. If a grammar exhibits derivational equivalence, whereby distinct derivations of a string assign the same meanings, naive exh...

The present work is a continuation of [5] and [6]. In [5] we have obtained derivational equations of a submanifold XM of a generalized Riemannian space GRN . Since the basic tensor in GRN is asymmetric and in this way the connection is also asymmetric, in a submanifold the connection is generally asymmetric too. By reason of this, we define 4 kinds of covariant derivative and obtain 4 kinds of ...

This research presents a new algorithm for Arabic root extraction, which aims to improve the accuracy of Natural Language Processing Algorithms by addressing weaknesses and errors existing algorithms. The proposed utilizes database, that includes collection roots, patterns, affixes, generate potential derivation roots word without eliminating affixes initially. By matching derived with patterns...

This study investigated the relations of three aspects of morphological awareness to word recognition and spelling skills of Dutch speaking children. Tasks of inflectional and derivational morphology and lexical compounding, as well as measures of phonological awareness, vocabulary and mathematics were administered to 104 first graders (mean age 6 years, 11 months) and 112 sixth graders (mean a...