Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Improving Sparse Word Representations with Distributional Inference for Semantic Composition (1608.06794v1)

Published 24 Aug 2016 in cs.CL

Abstract: Distributional models are derived from co-occurrences in a corpus, where only a small proportion of all possible plausible co-occurrences will be observed. This results in a very sparse vector space, requiring a mechanism for inferring missing knowledge. Most methods face this challenge in ways that render the resulting word representations uninterpretable, with the consequence that semantic composition becomes hard to model. In this paper we explore an alternative which involves explicitly inferring unobserved co-occurrences using the distributional neighbourhood. We show that distributional inference improves sparse word representations on several word similarity benchmarks and demonstrate that our model is competitive with the state-of-the-art for adjective-noun, noun-noun and verb-object compositions while being fully interpretable.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Thomas Kober (12 papers)
  2. Julie Weeds (11 papers)
  3. Jeremy Reffin (5 papers)
  4. David Weir (15 papers)
Citations (15)

Summary

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