{"_id":"EJdpQYhZGjE4XPWsF","bibbaseid":"anonymous-applyinganaivebayessimilaritymeasuretowordsensedisambiguation-2014","downloads":0,"creationDate":"2016-10-19T19:03:54.211Z","title":"Applying a naive Bayes similarity measure to word sense disambiguation","author_short":null,"year":2014,"bibtype":"inproceedings","biburl":"http://www.cs.toronto.edu/compling/all_bib.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Tong"],"propositions":[],"lastnames":["Wang"],"suffixes":[]},{"firstnames":["Graeme"],"propositions":[],"lastnames":["Hirst"],"suffixes":[]}],"title":"Applying a naive Bayes similarity measure to word sense disambiguation","address":"Baltimore","booktitle":"Proceedings, 52nd Annual Meeting of the Association for Computational Linguistics (ACL 2014)","pages":"531--537","year":"2014","month":"June","download":"http://ftp.cs.toronto.edu/pub/gh/Wang+Hirst-ACL-2014.pdf","note":"Conference poster available <a href=http://ftp.cs.toronto.edu/pub/gh/Wang+Hirst-ACL-2014-Poster.pdf>here</a>","abstract":"We replace the overlap mechanism of the Lesk algorithm with a simple, general-purpose Naive Bayes model that measures many-to-many association between two sets of random variables. Even with simple probability estimates such as maximum likelihood, the model gains significant improvement over the Lesk algorithm on word sense disambiguation tasks. With additional lexical knowledge from WordNet, performance is further improved to surpass the state-of-the-art results.","key":"Wang2014","id":"Wang2014","bibbaseid":"anonymous-applyinganaivebayessimilaritymeasuretowordsensedisambiguation-2014","role":"author","urls":{},"downloads":0},"search_terms":["applying","naive","bayes","similarity","measure","word","sense","disambiguation"],"keywords":[],"authorIDs":[],"dataSources":["2vBSdbWEoTEQZtb6g"]}