Word Clustering and Disambiguation Based on Co-occurrence Data
We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word
165 indexed results
We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word
Recent observations in the theory of verse and empirical metrics have suggested that constructing a verse line involves a pattern-matching
This paper describes the National Research Council (NRC) Word Sense Disambiguation (WSD) system, as applied to the English Lexical Sample
Word sense disambiguation algorithms, with few exceptions, have made use of only one lexical knowledge source. We describe a system
Parallel texts (bitexts) have properties that distinguish them from other kinds of parallel data. First, most words translate to only
Word sense disambiguation assumes word senses. Within the lexicography and linguistics literature, they are known to be very slippery entities.
The eventual goal of a language model is to accurately predict the value of a missing word given its context.
This paper describes a set of comparative experiments, including cross-corpus evaluation, between five alternative algorithms for supervised Word Sense Disambiguation
This paper presents a corpus-based approach to word sense disambiguation where a decision tree assigns a sense to an ambiguous
One often wishes to quickly add a few overlined characters such as anti-B0 or anti-neutrino to a Microsoft Word document.
This paper presents a model-based, unsupervised algorithm for recovering word boundaries in a natural-language text from which they have been
This paper presents a corpus-based approach to word sense disambiguation that builds an ensemble of Naive Bayesian classifiers, each of
A statistical model for segmentation and word discovery in child directed speech is presented. An incremental unsupervised learning algorithm to
A statistical model for segmentation and word discovery in continuous speech is presented. An incremental unsupervised learning algorithm to infer
In this paper Schapire and Singer's AdaBoost.MH boosting algorithm is applied to the Word Sense Disambiguation (WSD) problem. Initial experiments
This paper presents a partial solution to a component of the problem of lexical choice: choosing the synonym most typical,
Real applications of natural language document processing are very often confronted with domain specific lexical gaps during the analysis of
Resolution of lexical ambiguity, commonly termed ``word sense disambiguation'', is expected to improve the analytical accuracy for tasks which are
In relatively free word order languages, grammatical functions are intricately related to case marking. Assuming an ordered representation of the
Memory-based learning, keeping full memory of learning material, appears a viable approach to learning NLP tasks, and is often superior
We want to achieve efficiency for the exact computation of the dot product of two vectors over word-size finite fields.
We investigate correlations in information carriers, e.g. texts and pieces of music, which are represented by strings of letters. For
The most effective paradigm for word sense disambiguation, supervised learning, seems to be stuck because of the knowledge acquisition bottleneck.
The paper presents a method for word sense disambiguation based on parallel corpora. The method exploits recent advances in word