A full-fledged model of machine translation
We present a system providing a set of tools for developing natural language processing (NLP) applications such as natural language interfaces, communication aid systems, etc. This system is based on two principles: modularity of knowledge representation to ensure the portability of the system, and guided sentence composition to ensure transparency, i.e. to ensure that the produced sentences are well-formed at the lexical, syntactic, semantic and conceptual levels. We first describe the formalisms...
The aim of this paper is to develop a new aggregating method for the decision problem in which the possible values of rewards are known in linguistic terms. We show new operators for solving this problem, as well as the way in which OWA operators provide us with an adequate framework for representing the optimism degree of the decision maker in case we have no information about the real state.
The evaluation of quantified sentences is used to solve several problems. Most of the methods proposed in the literature are not satisfactory because they do not verify some intuitive properties. In this paper we propose an extension of both possibilistic and probabilistic methods, based on the Sugeno and the Choquet fuzzy integrals respectively, for the evaluation of type II sentences, the most general kind of sentences. These methods verify good properties, and they are shown to be better than...
The paper discusses the application of a similarity metric based on compression to the measurement of the distance among Bulgarian dia- lects. The similarity metric is de ned on the basis of the notion of Kolmo- gorov complexity of a le (or binary string). The application of Kolmogorov complexity in practice is not possible because its calculation over a le is an undecidable problem. Thus, the actual similarity metric is based on a real life compressor which only approximates the Kolmogorov complexity....
Étant donné l'importance que prennent les grammaires catégorielles dans le domaine de la linguistique computationnelle, il nous a semblé intéressant de dresser un panorama sur cette question. Nous espérons fournir, aux chercheurs intéressés, un matériau de base susceptible de les aider à approfondir par eux-mêmes le sujet.
False friends are pairs of words in two languages that are perceived as similar but have different meanings. We present an improved algorithm for acquiring false friends from sentence-level aligned parallel corpus based on statistical observations of words occurrences and co-occurrences in the parallel sentences. The results are compared with an entirely semantic measure for cross-lingual similarity between words based on using the Web as a corpus through analyzing the words’ local contexts extracted...