Articles

We present an approach to the incremental ac- crual of lexical information for unknown words that is constraint-based and compatible with standard unification-based grammars. Although the tech- niques are language-independent and can be applied to all kinds of information, in this paper we concen- trate on the domain of German …...

Agglutinative languages present rich morphology and for some applications they need deep analysis at word level. The work here presented proposes a model for designing a full morpho- logical analyzer. The model integrates the two-level formalism and a unification-based formalism. In contrast to other works, we propose to separate the …...

This paper treats the classification of the se- mantic functions performed by adnominal con- stituents in Japanese, where many parts of speech act as adnominal constituents. In order to establish a formal treatment of the semantic roles, the similarities and differences among ad- nominal constituents, i.e. adjectives and "noun + …...

Computational linguists have traditionally sought to model language by finding underlying parameters which govern numerous examples. I describe a different approach which argues that numerous examples themselves, by virtue of their many possible arrangements, provide the only way to specify a sufficiently rich set of "parameters". Essentially I argue for …...

This paper will describe a way to organize the salient objects, their attributes, and relationships between the objects in a given domain. This organization allows us to assign an information value to each col- lection, and to the domain as a whole, which cor- responds to the number of things …...

In this paper we describe a method for analyzing the reading comprehension task. First, we describe a method of classifying facts (information) into cat- egories or levels; where each level signifies a different degree of difficulty of extracting a fact from a piece of text containing it. We then proceed …...

Word Sense Disambiguation (WSD) is a central task in the area of Natural Language Processing. In the past few years several context-based probabilistic and machine learning methods for WSD have been presented in literature. However, an important area of research that has not been given the attention it deserves is …...

This paper describes an automatic method for extracting systematic polysemy from a hierar- chically organized semantic lexicon (WordNet). Systematic polysemy is a set of word senses that are related in systematic and predictable ways. Our method uses a modification of a tree generalization technique used in (Li and Abe, 1998), …...

This paper presents an algorithm for finding systematic polysemous classes in WordNet and similar semantic databases, based on a definition in (Apresjan 1973). The...

We propose a method for dealing with semantic complexities occurring in information retrieval systems on the basis of linguistic observations. Our method follows from an analysis indicating that long runs of content words appear in a stopped document cluster, and our observation that these long runs predominately originate from the …...

In experiments on a natural language information retrieval system that retrieves images based on textual captions, we show that syntactic complexity actually aids retrieval. We compare two types of captioned images, those characterized with full sentences in English, and those characterized by lists of words and phrases. The full-sentence captions …...

There are many challenging problems for Vietnamese language processing. It will be a long time before these challenges are met. Even some apparently simple problems such as spelling correction are quite difficult and have not been approached systematically yet. In this paper, we will discuss one aspect of this type …...

We propose a distribution-based pruning of n-gram backoff language models. Instead of the conventional approach of pruning n-grams that are infrequent in training data, we prune n-grams that are likely to be infrequent in a new document. Our method is based on the n-gram distribution i.e. the probability that an …...

As an application of NLP to computer-assisted language learn- ing(CALL) , we propose a diag- nostic processing of Japanese be- ing able to detect errors and inap- propriateness of sentences composed by the students in the given situ- ation and the context of the exer- cise texts. Using LTAG(Lexicalized Tree …...

Writing English is a big barrier for most Chinese users. To build a computer-aided system that helps Chinese users not only on spelling checking and grammar checking but also on writing in the way of native-English is a challenging task. Although machine translation is widely used for this purpose, how …...

The paper proposes an information-theory- based method for feature types analysis in probabilistic evaluation modelling for statistical parsing. The basic idea is that we use entropy and conditional entropy to measure whether a feature type grasps some of the information for syntactic structure prediction. Our experiment quantitatively analyzes several feature …...

In recent years, statistical approaches on ATR (Automatic Term Recognition) have achieved good results. However, there are scopes to improve the performance in extracting terms still further. For example, domain dictionaries can improve the performance in ATR. This paper focuses on a method for extracting terms using a dictionary hierarchy. …...

This paper describes a language independent method for alignment of parallel texts that makes use of homograph tokens for each pair of languages. In order to filter out tokens that may cause misalignment, we use confidence bands of linear regression lines instead of heuristics which are not theoreti- cally supported. …...

Building a bilingual dictionary for transfer in a machine translation system is conventionally done by hand and is very time-consuming. In order to overcome this bottleneck, we propose a new mechanism for lexical transfer, which is simple and suitable for learning from bilingual corpora. It exploits a vector-space model developed …...

In this paper, we outline a theory of referential accessibility called Veins Theory (VT). We show how VT addresses the problem of "left satellites", currently a problem for stack-based models, and show that VT can be used to significantly reduce the search space for antecedents. We also show that VT …...