In mathematics, the Wasserstein or Kantorovich–Rubinstein metric or distance is a distance function defined between probability distributions on a given metric space M {\displaystyle M} M.
Intuitively, if each distribution is viewed as a unit amount of "dirt" piled on M {\displaystyle M} M, the metric is the minimum "cost" of turning one pile into the other, which is assumed to be the amount of dirt that needs to be moved times the mean distance it has to be moved. Because of this analogy, the metric is known in computer science as the earth mover's distance.
TLDR — Extractive question answering is an important task for providing a good user experience in many applications. The popular Retriever-Reader framework for QA using BERT can be difficult to scale…
M. Windl, V. Winterhalter, A. Schmidt, and S. Mayer. Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems, New York, NY, USA, Association for Computing Machinery, (2023)
C. Tahri, X. Tannier, and P. Haouat. Proceedings of the first Workshop on Information Extraction from Scientific Publications, page 67--77. Online, Association for Computational Linguistics, (November 2022)