paper-with-me

홈 › Papers

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

2012-05-24 · Deniz Yuret

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 paper I 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 sub-linear 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.

📄 PDF Abstract BibTeX arXiv:1205.5407

Code (1)

denizyuret/fastsubs-googlecode

Tasks

Language ModelingLanguage ModellingMachine TranslationSentenceText SimplificationTranslationWord Sense Disambiguation

Similar Papers 제목 키워드 기반

A Family of Exact Goodness-of-Fit Tests for High-Dimensional Discrete Distributions

2019-02-26 · Feras A. Saad, Cameron E. Freer, Nathanael L. Ackerman, Vikash K. Mansinghka

The objective of goodness-of-fit testing is to assess whether a dataset of observations is likely to have been drawn from a candidate probability distribution. This paper presents a rank-based family of goodness-of-fit t…

Should We Learn Most Likely Functions or Parameters?

2023-11-27 · NeurIPS 2023 11 · Shikai Qiu, Tim G. J. Rudner, Sanyam Kapoor, Andrew Gordon Wilson

Standard regularized training procedures correspond to maximizing a posterior distribution over parameters, known as maximum a posteriori (MAP) estimation. However, model parameters are of interest only insomuch as they …

On MAP Inference by MWSS on Perfect Graphs

2013-09-26 · Adrian Weller, Tony S. Jebara

Finding the most likely (MAP) configuration of a Markov random field (MRF) is NP-hard in general. A promising, recent technique is to reduce the problem to finding a maximum weight stable set (MWSS) on a derived weighted…

First the worst: Finding better gender translations during beam search

2021-04-15 · Findings (ACL) 2022 5 · Danielle Saunders, Rosie Sallis, Bill Byrne

Neural machine translation inference procedures like beam search generate the most likely output under the model. This can exacerbate any demographic biases exhibited by the model. We focus on gender bias resulting from …

DiversityMachine TranslationNMTReranking+2

Testing the Presence of Implicit Hiring Quotas with Application to German Universities

2021-09-29 · Lena Janys

It is widely accepted that women are underrepresented in academia in general and economics in particular. This paper introduces a test to detect an under-researched form of hiring bias: implicit quotas. I derive a test u…