Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Unsupervised, Knowledge-Free, and Interpretable Word Sense Disambiguation (1707.06878v1)

Published 21 Jul 2017 in cs.CL

Abstract: Interpretability of a predictive model is a powerful feature that gains the trust of users in the correctness of the predictions. In word sense disambiguation (WSD), knowledge-based systems tend to be much more interpretable than knowledge-free counterparts as they rely on the wealth of manually-encoded elements representing word senses, such as hypernyms, usage examples, and images. We present a WSD system that bridges the gap between these two so far disconnected groups of methods. Namely, our system, providing access to several state-of-the-art WSD models, aims to be interpretable as a knowledge-based system while it remains completely unsupervised and knowledge-free. The presented tool features a Web interface for all-word disambiguation of texts that makes the sense predictions human readable by providing interpretable word sense inventories, sense representations, and disambiguation results. We provide a public API, enabling seamless integration.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Alexander Panchenko (92 papers)
  2. Fide Marten (1 paper)
  3. Eugen Ruppert (3 papers)
  4. Stefano Faralli (8 papers)
  5. Dmitry Ustalov (22 papers)
  6. Simone Paolo Ponzetto (52 papers)
  7. Chris Biemann (78 papers)
Citations (16)

Summary

We haven't generated a summary for this paper yet.