References

  1. Mihir Bellare (1993): Interactive Proofs and Approximation: Reduction from Two Provers in One Round.. In: ISTCS, pp. 266–274, doi:10.1109/ISTCS.1993.253462.
  2. Roi Blanco & Paolo Boldi (2012): Extending BM25 with Multiple Query Operators. In: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '12. ACM, New York, NY, USA, pp. 921–930, doi:10.1145/2348283.2348406.
  3. Paolo Boldi & Sebastiano Vigna (2004): The WebGraph Framework I: Compression Techniques. In: Proc. of the Thirteenth International World Wide Web Conference (WWW 2004). ACM Press, Manhattan, USA, pp. 595–601, doi:10.1145/988672.988752.
  4. Razvan C. Bunescu & Marius Pasca (2006): Using Encyclopedic Knowledge for Named entity Disambiguation. In: EACL. The Association for Computer Linguistics.
  5. Pierluigi Crescenzi & Viggo Kann (1997): Approximation on the Web: A Compendium of NP Optimization Problems. In: RANDOM, pp. 111–118, doi:10.1007/3-540-63248-4_10.
  6. Montse Cuadros & German Rigau (2008): KnowNet: A proposal for building highly connected and dense knowledge bases from the web. In: First Symposium on Semantics in Systems for Text Processing, pp. 71–84, doi:10.3115/1626481.1626488.
  7. Silviu Cucerzan (2007): Large-scale named entity disambiguation based on Wikipedia data. In: In Proc. 2007 Joint Conference on EMNLP and CNLL, pp. 708–716.
  8. Christiane Fellbaum (1998): WordNet An Electronic Lexical Database. The MIT Press, Cambridge, MA ; London, doi:10.2307/417141.
  9. Ben Hachey, Will Radford & James R. Curran (2011): Graph-based Named Entity Linking with Wikipedia. In: Proceedings of the 12th International Conference on Web Information System Engineering, WISE'11. Springer-Verlag, Berlin, Heidelberg, pp. 213–226, doi:10.1007/978-3-642-24434-6_16.
  10. Xianpei Han, Le Sun & Jun Zhao (2011): Collective Entity Linking in Web Text: A Graph-based Method. In: Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '11. ACM, pp. 765–774, doi:10.1145/2009916.2010019.
  11. Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan & Soumen Chakrabarti (2009): Collective annotation of Wikipedia entities in web text. In: Knowledge Discovery and Data Mining, pp. 457–466, doi:10.1145/1557019.1557073.
  12. Rada Mihalcea (2005): Unsupervised Large-vocabulary Word Sense Disambiguation with Graph-based Algorithms for Sequence Data Labeling. In: Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing, HLT '05. Association for Computational Linguistics, Stroudsburg, PA, USA, pp. 411–418, doi:10.3115/1220575.1220627.
  13. Rada Mihalcea & Andras Csomai (2007): Wikify!: Linking Documents to Encyclopedic Knowledge. In: Proceedings of the Sixteenth ACM Conference on Conference on Information and Knowledge Management, CIKM '07. ACM, New York, NY, USA, pp. 233–242, doi:10.1145/1321440.1321475.
  14. David Milne & Ian H. Witten (2008): Learning to Link with Wikipedia. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM '08. ACM, New York, NY, USA, pp. 509–518, doi:10.1145/1458082.1458150.
  15. Roberto Navigli (2009): Word sense disambiguation: a survey. ACM COMPUTING SURVEYS 41(2), pp. 1–69, doi:10.1145/1459352.1459355.
  16. Roberto Navigli & Mirella Lapata (2007): Graph Connectivity Measures for Unsupervised Word Sense Disambiguation. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, IJCAI'07. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp. 1683–1688.
  17. Roberto Navigli & Mirella Lapata (2010): An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation. IEEE Trans. Pattern Anal. Mach. Intell. 32(4), pp. 678–692, doi:10.1109/TPAMI.2009.36.
  18. Roberto Navigli & Paola Velardi (2005): Structural Semantic Interconnections: A Knowledge-Based Approach to Word Sense Disambiguation. IEEE Trans. Pattern Anal. Mach. Intell. 27(7), pp. 1075–1086, doi:10.1109/TPAMI.2005.149.
  19. Maria Serna, Luca Trevisan & Fatos Xhafa (2005): The approximability of non-Boolean satisfiability problems and restricted integer programming. Theoretical Computer Science 332(1–3), pp. 123 – 139, doi:10.1016/j.tcs.2004.10.014.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org