• No results found

Similarity based Word Sense Disambiguation

N/A
N/A
Protected

Academic year: 2020

Share "Similarity based Word Sense Disambiguation"

Copied!
20
0
0

Loading.... (view fulltext now)

Full text

Figure

Figure 1 Iterative computation of word and sentence similarities.
Table 2 A summary of the algorithm's performance on the four test words.
Table 3 The drug experiment; the nearest neighbors of the highest-weight words.
Figure 3 The drug experiment; an illustration of the development of the support for a particular sense with iteration
+2

References

Related documents

In this paper we in- vestigate a label propagation based semi- supervised learning algorithm for WSD, which combines labeled and unlabeled data in learning process to fully realize

By manually examining a subset of about 1,000 examples, we estimate that the sense-tag error rate of training examples (tagged with lumped senses) obtained by our parallel

Corpora contain examples of words that enable the development of statistical models of word senses and their contexts (Ide and Veronis, 1998; Leacock and Chodorow,

In order to show that our approach allows for capturing large amounts of data, we created a corpus using the dis- ambiguation pages of the whole German Wikipedia.. For

We analyze the obtained data and perform a correlation analysis between several relevant variables, including word frequency, number of senses, sense distribution skewness,

empirically demonstrate that a) Basic Level Con- cepts group senses into an adequate level of ab- straction in order to perform supervised class– based WSD, b) that these

We propose an automatic method to estimate the number of senses (or sense number, model or- der) of a target word in mixed data (tagged cor- pus+untagged corpus) by maximizing

In order to show that our approach allows for capturing large amounts of data, we created a corpus using the dis- ambiguation pages of the whole German Wikipedia.. For