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.
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.
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.
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.
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.
P. Kanerva, J. Kristofersson, and A. Holst. Proceedings of the 22nd Annual Conference of the Cognitive Science Society, 1036, Erlbaum, New Jersey, (2000)
J. Boyd-Graber, and D. Blei. Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval-2007), page 277--281. Prague, Czech Republic, Association for Computational Linguistics, (June 2007)
H. Dyvik. Proceedings of the Second Baltic Conference on Human Language Technologies, page 27--38. Tallinn, Institute of Cybernetics, Tallinn University of Technology & Institute of the Estonian Language, (2005)