FASTSUBS: An Efficient and Exact Procedure for Finding the Most Likely Lexical Substitutes Based on an N-Gram Language Model

By Deniz Yuret. 2012

28 citations recorded by the source corpus.

Lexical substitutes have found use in areas such as paraphrasing, text simplification, machine translation, word sense disambiguation, and part of speech induction. However the computational complexity of accurately identifying the most likely substitutes for a word has made large scale experiments difficult. In this letter we introduce a new search algorithm, FASTSUBS, that is guaranteed to find the K most likely lexical substitutes for a given word in a sentence based on an n-gram language model. The computation is sublinear in both K and the vocabulary size V. An implementation of the algorithm and a dataset with the top 100 substitutes of each token in the WSJ section of the Penn Treebank are available at http://goo.gl/jzKH0.

Subfields: Artificial Intelligence, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Ido Dagan
  2. Jacob Goldberger
  3. Oren Melamud
  4. Chris Biemann
  5. Alexander Panchenko
  6. José Camacho-Collados
  7. Stefano Faralli
  8. Simone Paolo Ponzetto

In Natural Language Processing

  1. Jacob Goldberger
  2. Ido Dagan
  3. Chris Biemann
  4. Oren Melamud
  5. José Camacho-Collados
  6. Mohammad Taher Pilehvar
  7. Alexander Panchenko
  8. Stefano Faralli

Citations in the corpus