TxtAlign: Efficient Near-Duplicate Text Alignment Search via Bottom-k Sketches for Plagiarism Detection
Summary: TxtAlign uses bottom-k sketches to estimate passage similarity, grouping O(n^2) passages into O(nk) sketch-based groups. Enables corpus-scale source retrieval: near-duplicate passage pairs found via cross-group sketches; grouping in O(n log n + nk). (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhizhi Wang (Rutgers University)
- 2. Chaoji Zuo (Rutgers University)
- 3. Dong Deng (Rutgers University)
BibTeX Citation
@inproceedings{wang_sigmod22,
title = {{TxtAlign: Efficient Near-Duplicate Text Alignment Search via Bottom-k Sketches for Plagiarism Detection}},
author = {Wang, Zhizhi and Zuo, Chaoji and Deng, Dong},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3526178},
url = {https://dl.acm.org/doi/10.1145/3514221.3526178},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,745 | Near-Duplicate Text Alignment with One Permutation Hashing | 2024 | SIGMOD | 5.5534781e-05 |
| 10,024 | Near-Duplicate Sequence Search at Scale for Large Language Model Memorization Evaluation | 2023 | SIGMOD | 5.1757914e-05 |
| 10,265 | LSHAlign: All-Pair Near-Duplicate Text Alignment via LSH | 2026 | SIGMOD | 5.093636e-05 |
| 10,533 | SeDA: Bridging the Gap between Efficient Syntactic and Precise Semantic Search of Similar Passages in Large Text Corpora | 2026 | VLDB | 5.093636e-05 |
| 10,554 | Near-Duplicate Text Alignment under Weighted Jaccard Similarity | 2026 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,279 | Mining Document Collections to Facilitate Accurate Approximate Entity Matching | 2009 | VLDB |
| 2 | 10,086 | Efficient and Effective KNN Sequence Search with Approximate n-grams | 2014 | VLDB |
| 3 | 10,024 | Near-Duplicate Sequence Search at Scale for Large Language Model Memorization Evaluation | 2023 | SIGMOD |
| 4 | 7,692 | Efficient Top-k Algorithms for Approximate Substring Matching | 2013 | SIGMOD |
| 5 | 10,554 | Near-Duplicate Text Alignment under Weighted Jaccard Similarity | 2026 | VLDB |
| 6 | 14,501 | Unstructured Data Bases or Very Efficient Text Searching | 1983 | PODS |
| 7 | 4,052 | Local Similarity Search for Unstructured Text | 2016 | SIGMOD |
| 8 | 7,745 | Near-Duplicate Text Alignment with One Permutation Hashing | 2024 | SIGMOD |
| 9 | 10,265 | LSHAlign: All-Pair Near-Duplicate Text Alignment via LSH | 2026 | SIGMOD |
| 10 | 7,676 | Allign: Aligning All-Pair Near-Duplicate Passages in Long Texts | 2021 | SIGMOD |