Let A be a unital R-algebra and M be a unital A-bimodule. It is shown that every Jordan derivation of the trivial extension of A by M, under some conditions, is the sum of a derivation and an antiderivation.

This work is about derivational suffixes, endings and prefixes of the Spanish language, which are useful for the establishment of about 70 000 suffixal and 11 000 prefixal extended morpholexical relationships deduced from a corpus of 134 109 canonical forms. A computational tool is developed capable of solving and answering to any morphological aspect of a Spanish word. The tool encompasses eve...

The paper is concentrated on modeling the Estonian morphology in the framework of twolevel morphology model. The result is a consistent description of Estonian morphology, which consists of a network of lexicons (root lexicons cover 2500 most frequent word roots) and two-level rules. The main rule set contains 45 rules, which describe various stem changes. The subset of rules dealing with stem ...

A coupled acousticand language-modeling approach is presented for the recognition of spontaneous speech primarily in agglutinative languages. The effectiveness of the approach in large vocabulary spontaneous speech recognition is demonstrated on the Hungarian MALACH corpus. The derivation of morphs from word forms is based on a statistical morphological segmentation tool while the mapping of mo...

Homophone words is one of the specific problems of Automatic Speech Recognition (ASR) in French. Moreover, this phenomenon is particularly high for some inflections like the singular/plural inflection (72% of the 40.7K lemma of our 240K word dictionary have inflected forms which are homophonic). In order to take into account worddependencies spanning over a variable number of words, it is inter...

We present a derivation of the alignment template model for statistical machine translation and an implementation of the model using weighted finite state transducers. The approach we describe allows us to implement each constituent distribution of the model as a weighted finite state transducer or acceptor. We show that bitext word alignment and translation under the model can be performed wit...

Despite their significant limitations, readability measures that are easy to apply have definite appeal. With this in mind, we have been exploring the prospects for more insightful measures that are computer-based and, thereby, still easily applied. The orthodox reliance on intrinsic syntactic features is an inherent limitation of most readability measures, since they have no reference to the l...

Chapter 1: Introduction 1.1 Conversion: an overview 1.2 Background literature relating to conversion 1.2.1 Definitions 1.2.1.1 Functional change or shift 1.2.1.2 Zero-derivation or zero-affixation 1.2.1.3 Conversion 1.2.2 Outline of the controversies associated with conversion 1.2.2.1 Controversy 1: ‘Zero’ vs Conversion 1.2.2.1.1 Arguments for the presence of a ‘zero’ in the conversion process ...

Morpho Challenge is an annual evaluation campaign for unsupervised morpheme analysis. In morpheme analysis, words are segmented into smaller meaningful units. This is an essential part in processing complex word forms in many large-scale natural language processing applications, such as speech recognition, information retrieval, and machine translation. The discovery of morphemes is particularl...

In a word association task, the probability of producing a certain response to a cue is considered to be a direct measure of associative strength between words in the mental lexicon. The common single word association procedure is limited, since the number of words connected to a cue might be underestimated when a single response is asked. The continued association task overcomes this limitatio...