English
Related papers

Related papers: An Efficient Shared-memory Parallel Sinkhorn-Knopp…

200 papers

The Word Movers Distance (WMD) measures the semantic dissimilarity between two text documents by computing the cost of optimally moving all words of a source/query document to the most similar words of a target document. Computing WMD…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-04-27 Jesmin Jahan Tithi , Fabrizio Petrini

Word Mover's Distance (WMD) computes the distance between words and models text similarity with the moving cost between words in two text sequences. Yet, it does not offer good performance in sentence similarity evaluation since it does not…

Computation and Language · Computer Science 2022-06-22 Chengwei Wei , Bin Wang , C. -C. Jay Kuo

The Word Mover's Distance (WMD) proposed by Kusner et al. is a distance between documents that takes advantage of semantic relations among words that are captured by their embeddings. This distance proved to be quite effective, obtaining…

Computation and Language · Computer Science 2020-05-12 Matheus Werner , Eduardo Laber

While the celebrated Word2Vec technique yields semantically rich representations for individual words, there has been relatively less success in extending to generate unsupervised sentences or documents embeddings. Recent work has…

Computation and Language · Computer Science 2018-11-06 Lingfei Wu , Ian E. H. Yen , Kun Xu , Fangli Xu , Avinash Balakrishnan , Pin-Yu Chen , Pradeep Ravikumar , Michael J. Witbrock

Measuring the semantic similarity between two sentences is still an important task. The word mover's distance (WMD) computes the similarity via the optimal alignment between the sets of word embeddings. However, WMD does not utilize word…

Computation and Language · Computer Science 2023-11-03 Hiroaki Yamagiwa , Sho Yokoi , Hidetoshi Shimodaira

The Earth Mover's Distance (EMD) is a state-of-the art metric for comparing discrete probability distributions, but its high distinguishability comes at a high cost in computational complexity. Even though linear-complexity approximation…

Machine Learning · Computer Science 2019-05-29 Kubilay Atasu , Thomas Mittelholzer

As a fundamental problem of natural language processing, it is important to measure the distance between different documents. Among the existing methods, the Word Mover's Distance (WMD) has shown remarkable success in document semantic…

Machine Learning · Computer Science 2019-07-12 Zihao Wang , Datong Zhou , Yong Zhang , Hao Wu , Chenglong Bao

The amount of unstructured text-based data is growing every day. Querying, clustering, and classifying this big data requires similarity computations across large sets of documents. Whereas low-complexity similarity metrics are available,…

The word mover's distance (WMD) is a popular semantic similarity metric for two texts. This position paper studies several possible extensions of WMD. We experiment with the frequency of words in the corpus as a weighting factor and the…

Computation and Language · Computer Science 2022-02-09 Ilya Smirnov , Ivan P. Yamshchikov

The word mover's distance (WMD) is a fundamental technique for measuring the similarity of two documents. As the crux of WMD, it can take advantage of the underlying geometry of the word space by employing an optimal transport formulation.…

Machine Learning · Computer Science 2022-06-16 Ryoma Sato , Makoto Yamada , Hisashi Kashima

Search behaviour is characterised using synonymy and polysemy as users often want to search information based on meaning. Semantic representation strategies represent a move towards richer associative connections that can adequately capture…

Information Retrieval · Computer Science 2026-02-06 Niall McCarroll , Kevin Curran , Eugene McNamee , Angela Clist , Andrew Brammer

Assessing the proper difficulty levels of reading materials or texts in general is the first step towards effective comprehension and learning. In this study, we improve the conventional methodology of automatic readability assessment by…

Computation and Language · Computer Science 2021-09-21 Joseph Marvin Imperial , Ethel Ong

Despite the increasing popularity of NLP in the humanities and social sciences, advances in model performance and complexity have been accompanied by concerns about interpretability and explanatory power for sociocultural analysis. One…

Computation and Language · Computer Science 2021-10-15 Mikael Brunila , Jack LaViolette

Since the seminal work of Mikolov et al., word embeddings have become the preferred word representations for many natural language processing tasks. Document similarity measures extracted from word embeddings, such as the soft cosine…

Information Retrieval · Computer Science 2020-04-02 Vít Novotný , Eniafe Festus Ayetiran , Michal Štefánik , Petr Sojka

For two multisets $S$ and $T$ of points in $[\Delta]^2$, such that $|S| = |T|= n$, the earth-mover distance (EMD) between $S$ and $T$ is the minimum cost of a perfect bipartite matching with edges between points in $S$ and $T$, i.e.,…

Data Structures and Algorithms · Computer Science 2014-04-28 Arman Yousefi , Rafail Ostrovsky

Earth Mover's Distance (EMD) is an important similarity measure between two distributions, used in computer vision and many other application domains. However, its exact calculation is computationally and memory intensive, which hinders its…

Computer Vision and Pattern Recognition · Computer Science 2025-05-15 Guangyu Meng , Ruyu Zhou , Liu Liu , Peixian Liang , Fang Liu , Danny Chen , Michael Niemier , X. Sharon Hu

Text similarity calculation is a fundamental problem in natural language processing and related fields. In recent years, deep neural networks have been developed to perform the task and high performances have been achieved. The neural…

Computation and Language · Computer Science 2018-10-26 Yilin Niu , Chao Qiao , Hang Li , Minlie Huang

A key principle in assessing textual similarity is measuring the degree of semantic overlap between two texts by considering the word alignment. Such alignment-based approaches are intuitive and interpretable; however, they are empirically…

Computation and Language · Computer Science 2020-11-17 Sho Yokoi , Ryo Takahashi , Reina Akama , Jun Suzuki , Kentaro Inui

The main approach of traditional information retrieval (IR) is to examine how many words from a query appear in a document. A drawback of this approach, however, is that it may fail to detect relevant documents where no or only few words…

Computation and Language · Computer Science 2017-10-19 Sun Kim , Nicolas Fiorini , W. John Wilbur , Zhiyong Lu

We give a reduction from $(1+\varepsilon)$-approximate Earth Mover's Distance (EMD) to $(1+\varepsilon)$-approximate Closest Pair (CP). As a consequence, we improve the fastest known approximation algorithm for high-dimensional EMD. Here,…

Data Structures and Algorithms · Computer Science 2025-08-27 Lorenzo Beretta , Vincent Cohen-Addad , Rajesh Jayaram , Erik Waingarten
‹ Prev 1 2 3 10 Next ›