# An Efficient Shared-memory Parallel Sinkhorn-Knopp Algorithm to Compute the Word Mover's Distance

14 May 2020Jesmin Jahan TithiFabrizio Petrini

The Word Mover's Distance (WMD) is a metric that measures the semantic dissimilarity between two text documents by computing the cost of moving all words of a source/query document to the most similar words of a target document optimally. Computing WMD between two documents is costly because it requires solving an optimization problem that costs $O(V^3log(V))$ where $V$ is the number of unique words in the document... (read more)

PDF Abstract

No code implementations yet. Submit your code now