In this paper, we perform WSD study based on large scale real-world corpus using two unsupervised learning algorithms based on ±n-improved Bayesian model and Dependency Grammar (DG)-improved Bayesian model.
Babelfy is a unified graph-based approach to multilingual Entity Linking and Word Sense Disambiguation based on a loose identification of candidate meanings coupled with a densest subgraph heuristic which selects high-coherence semantic interpretations.
This paper describes an experimental comparison between two standard supervised learning methods, namely Naive Bayes and Exemplar--based classification, on the Word Sense Disambiguation (WSD) problem.
As the use of a Bayesian probability calculation on a simple co-occurrence frequency table created from the same data has similar disambiguation capabilities, the paper also incorporates comparison of LSA with the Bayesian model.
Common sense - been through lots of iterations. Frame sentences, prompted sentences, questions asked, random sentences. Sentences/propositions recently given scores and normalised to single natural language representation; now one can vote on them.
L. Màrquez, G. Exsudero, D. Martínez, und G. Rigau. Word Sense Disambiguation: Algorithms and Applications, Volume 33 von Text, Speech and Language Technology, Springer, Dordrecht, The Netherlands, (2006)