Abstract. A specific sense of a word can be determined by collocation of the words gathered from the large corpus that includes context patterns. However, homonym collocation often causes semantic ambiguity. Therefore, the results extracted from corpus should be classified according to every meaning of a word in order to ensure correct collocation. In this paper, K-means clustering is used to solve this problem. This paper reports collocation conditions as well as normalized algorithms actually adopted to address this problem. As a result of applying the proposed method to selected homonyms, the optimal number of semantic clusters showed similarity to those in the dictionary. This approach can disambiguate the sense of homonyms optimally us...
Learning word sense classes has been shown to be useful in fine-grained word sense disambiguation [K...
SenseClusters is a freely available intelligent system that clusters together similar contexts in na...
In this paper, we introduce a new similarity measure between words, and a graph-based word clusterin...
In this paper we present a new unsupervised approach for Word Sense Disambiguation (WSD) based on cl...
The main disadvantage of collocation-based word sense disambiguation is that the recall is low, with...
When clustering together synonyms, complications arise in cases of the words having multiple senses ...
When clustering together synonyms, complications arise in cases of the words having multiple senses ...
When clustering together synonyms, complications arise in cases of the words having multiple senses ...
This article presents a comparison of different Word Sense Induction (wsi) clustering algorithms on ...
The main disadvantage of collocation-based word sense disambiguation is that the recall is low, with...
In this paper we define two parallel data sets based on pseudowords, extracted from the same corpus....
Most previous corpus-based algorithms disambiguate a word with a classifier trained from previous us...
This thesis deals with semantic similarity of words. It describes and compares existing models that ...
This paper investigates the task of noun compound interpretation, building on the sense collocation ...
Discovering synonyms and other related words among the words in a document collection can be seen as...
Learning word sense classes has been shown to be useful in fine-grained word sense disambiguation [K...
SenseClusters is a freely available intelligent system that clusters together similar contexts in na...
In this paper, we introduce a new similarity measure between words, and a graph-based word clusterin...
In this paper we present a new unsupervised approach for Word Sense Disambiguation (WSD) based on cl...
The main disadvantage of collocation-based word sense disambiguation is that the recall is low, with...
When clustering together synonyms, complications arise in cases of the words having multiple senses ...
When clustering together synonyms, complications arise in cases of the words having multiple senses ...
When clustering together synonyms, complications arise in cases of the words having multiple senses ...
This article presents a comparison of different Word Sense Induction (wsi) clustering algorithms on ...
The main disadvantage of collocation-based word sense disambiguation is that the recall is low, with...
In this paper we define two parallel data sets based on pseudowords, extracted from the same corpus....
Most previous corpus-based algorithms disambiguate a word with a classifier trained from previous us...
This thesis deals with semantic similarity of words. It describes and compares existing models that ...
This paper investigates the task of noun compound interpretation, building on the sense collocation ...
Discovering synonyms and other related words among the words in a document collection can be seen as...
Learning word sense classes has been shown to be useful in fine-grained word sense disambiguation [K...
SenseClusters is a freely available intelligent system that clusters together similar contexts in na...
In this paper, we introduce a new similarity measure between words, and a graph-based word clusterin...