Allign: Aligning All-Pair Near-Duplicate Passages in Long Texts
Weiqi Feng, Dong Deng
摘要
In this paper, we study the problem of aligning all-pair near-duplicate passages in two long texts. A passage is a sequence of consecutive words in a text. It can begin and end with any word in the text, whether around a period or not. Due to the high computation cost of this problem, existing work all compromise to heuristic alignment methods, which can harm the recall of downstream applications, such as deduplication and plagiarism detection. To address this problem, in this paper, we propose a min-hash based method Allign to find all near-duplicate passage pairs in two long texts. Allign generates a few min-hash values for each passage in the texts and reports all the passage pairs sharing enough common min-hash values. However, for a pair of texts with n and m words, there are in total O(n2m2) passage pairs (each text contains O(n2) and O(m2) passages respectively). Thus it is prohibitively expensive to enumerate all passage pairs in two texts and count their common min-hash values. To address this issue, Allign packs a large number of nearby and overlapping passages with the same min-hash to a "compact window". In total, Allign generates O(n) compact windows to represent all the O(n2) passages in a text with n words. Next, a pair of compact windows in two texts are matched if they have the same min-hash. The rest of unmatched compact windows are removed. Finally, Allign reports all the passage pairs contained by enough number of matched compact window pairs, which must share the same enough number of min-hash values. In this way, Allign avoids enumerating the enormous number of passage pairs. Last but not least, to make the reported near-duplicate passages more relevant and Allign more efficient, we show how to support a few practical constraints efficiently, including reporting only longest near-duplicates and sentence-level near-duplicates. Experimental results on real-world datasets show that Allign significantly outperforms the state-of-the-art text alignment methods.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper5
- R2D2: Reducing Redundancy and Duplication in Data LakesRaunak Shah, Koyel Mukherjee, Atharv Tyagi, Sai Keerthana Karnam 等SIGMOD 2024 · 被引用 8 次
- Naive Bayes Classifiers over Missing Data: Decision and PoisoningSong Bian, Xiating Ouyang, Zhiwei Fan, Paraschos KoutrisICML 2024 · 被引用 5 次
- AbstractExplorer: Leveraging Structure-Mapping Theory to Enhance Comparative Close Reading at ScaleZiwei Gu, Joyce Zhou, Ning-Er (Nina) Lei, Jonathan K. Kummerfeld 等UIST 2025 · 被引用 3 次
- Near-Duplicate Text Alignment under Weighted Jaccard SimilarityYuheng Zhang, Miao Qiao, Zhencan Peng, Dong DengVLDB 2026 · 被引用 1 次
- SeDA: Bridging the Gap between Efficient Syntactic and Precise Semantic Search of Similar Passages in Large Text CorporaPranay Mundra, Daniel Kocher, Martin Schaeler, Nikolaus AugstenVLDB 2026
相关 Paper
- TxtAlign: Efficient Near-Duplicate Text Alignment Search via Bottom-k Sketches for Plagiarism DetectionZhizhi Wang, Chaoji Zuo, Dong DengSIGMOD 2022 · 被引用 14 次
- LSHAlign: All-Pair Near-Duplicate Text Alignment via Locality-Sensitive HashingYuheng Zhang, Zhencan Peng, Miao Qiao, Wei Zhang 等SIGMOD 2026
- Near-Duplicate Text Alignment with One Permutation HashingZhencan Peng, Yuheng Zhang, Dong DengSIGMOD 2025 · 被引用 5 次
- DotHash: Estimating Set Similarity Metrics for Link Prediction and Document DeduplicationIgor Nunes, Mike Heddes, Pere Vergés, Danny Abraham 等KDD 2023 · 被引用 6 次
- SEDD: Scalable and Efficient Dataset Deduplication with GPUsYoungjun Son, Chaewon Kim, Jaejin LeeKDD 2026 · 被引用 3 次
