{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T22:31:55Z","timestamp":1779229915160,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T00:00:00Z","timestamp":1595635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,25]]},"DOI":"10.1145\/3397271.3401045","type":"proceedings-article","created":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T07:50:08Z","timestamp":1595663408000},"page":"599-608","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Convolutional Embedding for Edit Distance"],"prefix":"10.1145","author":[{"given":"Xinyan","family":"DAI","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Yan","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaiwen","family":"Zhou","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxuan","family":"Wang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Yang","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Cheng","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,25]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Alexandr Andoni Piotr Indyk Thijs Laarhoven Ilya P. Razenshteyn and Ludwig Schmidt. 2015. Practical and Optimal LSH for Angular Distance. In NeurlPS. 1225--1233. http:\/\/papers.nips.cc\/paper\/5893-practical-and-optimal-lsh-for-angular-distance  Alexandr Andoni Piotr Indyk Thijs Laarhoven Ilya P. Razenshteyn and Ludwig Schmidt. 2015. Practical and Optimal LSH for Angular Distance. In NeurlPS. 1225--1233. http:\/\/papers.nips.cc\/paper\/5893-practical-and-optimal-lsh-for-angular-distance"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Arturs Backurs and Piotr Indyk. 2015. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). In STOC. 51--58. https:\/\/doi.org\/10.1145\/2746539.2746612  Arturs Backurs and Piotr Indyk. 2015. Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). In STOC. 51--58. https:\/\/doi.org\/10.1145\/2746539.2746612","DOI":"10.1145\/2746539.2746612"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Roberto J. Bayardo Yiming Ma and Ramakrishnan Srikant. 2007. Scaling up all pairs similarity search. In WWW. 131--140. https:\/\/doi.org\/10.1145\/1242572.1242591  Roberto J. Bayardo Yiming Ma and Ramakrishnan Srikant. 2007. Scaling up all pairs similarity search. In WWW. 131--140. https:\/\/doi.org\/10.1145\/1242572.1242591","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Diptarka Chakraborty Elazar Goldenberg and Michal Kouck\u00fd. 2016. Streaming algorithms for embedding and computing edit distance in the low distance regime. In STOC. 712--725. https:\/\/doi.org\/10.1145\/2897518.2897577  Diptarka Chakraborty Elazar Goldenberg and Michal Kouck\u00fd. 2016. Streaming algorithms for embedding and computing edit distance in the low distance regime. In STOC. 712--725. https:\/\/doi.org\/10.1145\/2897518.2897577","DOI":"10.1145\/2897518.2897577"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Surajit Chaudhuri Venkatesh Ganti and Raghav Kaushik. 2006. A Primitive Operator for Similarity Joins in Data Cleaning. In ICDE. 5. https:\/\/doi.org\/10.1109\/ICDE.2006.9  Surajit Chaudhuri Venkatesh Ganti and Raghav Kaushik. 2006. A Primitive Operator for Similarity Joins in Data Cleaning. In ICDE. 5. https:\/\/doi.org\/10.1109\/ICDE.2006.9","DOI":"10.1109\/ICDE.2006.9"},{"key":"e_1_3_2_2_6_1","volume-title":"R\u00e9 mi Flamary, and M\u00e9 lanie Ducoffe","author":"Courty Nicolas","year":"2018","unstructured":"Nicolas Courty , R\u00e9 mi Flamary, and M\u00e9 lanie Ducoffe . 2018 . Learning Wasserstein Embeddings. In ICLR. https:\/\/openreview.net\/forum?id=SJyEH91A- Nicolas Courty, R\u00e9 mi Flamary, and M\u00e9 lanie Ducoffe. 2018. Learning Wasserstein Embeddings. In ICLR. https:\/\/openreview.net\/forum?id=SJyEH91A-"},{"key":"e_1_3_2_2_7_1","volume-title":"ACM Symposium on Computational Geometry. 253--262","author":"Datar Mayur","unstructured":"Mayur Datar , Nicole Immorlica , Piotr Indyk , and Vahab S. Mirrokni . 2004. Locality-sensitive hashing scheme based on p-stable distributions . In ACM Symposium on Computational Geometry. 253--262 . https:\/\/doi.org\/10.1145\/997817.997857 Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In ACM Symposium on Computational Geometry. 253--262. https:\/\/doi.org\/10.1145\/997817.997857"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Dong Deng Guoliang Li and Jianhua Feng. 2014a. A pivotal prefix based filtering algorithm for string similarity search. In SIGMOD. 673--684. https:\/\/doi.org\/10.1145\/2588555.2593675  Dong Deng Guoliang Li and Jianhua Feng. 2014a. A pivotal prefix based filtering algorithm for string similarity search. In SIGMOD. 673--684. https:\/\/doi.org\/10.1145\/2588555.2593675","DOI":"10.1145\/2588555.2593675"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Dong Deng Guoliang Li Shuang Hao Jiannan Wang and Jianhua Feng. 2014b. MassJoin: A mapreduce-based method for scalable string similarity joins. In ICDE. 340--351. https:\/\/doi.org\/10.1109\/ICDE.2014.6816663  Dong Deng Guoliang Li Shuang Hao Jiannan Wang and Jianhua Feng. 2014b. MassJoin: A mapreduce-based method for scalable string similarity joins. In ICDE. 340--351. https:\/\/doi.org\/10.1109\/ICDE.2014.6816663","DOI":"10.1109\/ICDE.2014.6816663"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Tiezheng Ge Kaiming He Qifa Ke and Jian Sun. 2013. Optimized Product Quantization for Approximate Nearest Neighbor Search. In CVPR. 2946--2953. https:\/\/doi.org\/10.1109\/CVPR.2013.379  Tiezheng Ge Kaiming He Qifa Ke and Jian Sun. 2013. Optimized Product Quantization for Approximate Nearest Neighbor Search. In CVPR. 2946--2953. https:\/\/doi.org\/10.1109\/CVPR.2013.379","DOI":"10.1109\/CVPR.2013.379"},{"key":"e_1_3_2_2_12_1","unstructured":"Alexander Hermans Lucas Beyer and Bastian Leibe. 2017. In Defense of the Triplet Loss for Person Re-Identification. CoRR Vol. abs\/1703.07737 (2017). arxiv: 1703.07737 http:\/\/arxiv.org\/abs\/1703.07737  Alexander Hermans Lucas Beyer and Bastian Leibe. 2017. In Defense of the Triplet Loss for Person Re-Identification. CoRR Vol. abs\/1703.07737 (2017). arxiv: 1703.07737 http:\/\/arxiv.org\/abs\/1703.07737"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732299"},{"key":"e_1_3_2_2_15_1","volume-title":"VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams. In PVLDP. 303--314","author":"Li Chen","year":"2007","unstructured":"Chen Li , Bin Wang , and Xiaochun Yang . 2007 . VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams. In PVLDP. 303--314 . http:\/\/www.vldb.org\/conf\/2007\/papers\/research\/p303-li.pdf Chen Li, Bin Wang, and Xiaochun Yang. 2007. VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams. In PVLDP. 303--314. http:\/\/www.vldb.org\/conf\/2007\/papers\/research\/p303-li.pdf"},{"key":"e_1_3_2_2_16_1","first-page":"253","article-title":"PASS-JOIN","volume":"5","author":"Li Guoliang","year":"2011","unstructured":"Guoliang Li , Dong Deng , Jiannan Wang , and Jianhua Feng . 2011 . PASS-JOIN : A Partition-based Method for Similarity Joins. PVLDB , Vol. 5 , 3 (2011), 253 -- 264 . https:\/\/doi.org\/10.14778\/2078331.2078340 Guoliang Li, Dong Deng, Jiannan Wang, and Jianhua Feng. 2011. PASS-JOIN: A Partition-based Method for Similarity Joins. PVLDB, Vol. 5, 3 (2011), 253--264. https:\/\/doi.org\/10.14778\/2078331.2078340","journal-title":"A Partition-based Method for Similarity Joins. PVLDB"},{"key":"e_1_3_2_2_17_1","unstructured":"Yury A. Malkov and D. A. Yashunin. 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. CoRR Vol. abs\/1603.09320 (2016). arxiv: 1603.09320 http:\/\/arxiv.org\/abs\/1603.09320  Yury A. Malkov and D. A. Yashunin. 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. CoRR Vol. abs\/1603.09320 (2016). arxiv: 1603.09320 http:\/\/arxiv.org\/abs\/1603.09320"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284322"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Jianbin Qin Wei Wang Yifei Lu Chuan Xiao and Xuemin Lin. 2011a. Efficient exact edit similarity query processing with the asymmetric signature scheme. In SIGMOD. 1033--1044. https:\/\/doi.org\/10.1145\/1989323.1989431  Jianbin Qin Wei Wang Yifei Lu Chuan Xiao and Xuemin Lin. 2011a. Efficient exact edit similarity query processing with the asymmetric signature scheme. In SIGMOD. 1033--1044. https:\/\/doi.org\/10.1145\/1989323.1989431","DOI":"10.1145\/1989323.1989431"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Jianbin Qin Wei Wang Yifei Lu Chuan Xiao and Xuemin Lin. 2011b. Efficient exact edit similarity query processing with the asymmetric signature scheme. In SIGMOD. 1033--1044. https:\/\/doi.org\/10.1145\/1989323.1989431  Jianbin Qin Wei Wang Yifei Lu Chuan Xiao and Xuemin Lin. 2011b. Efficient exact edit similarity query processing with the asymmetric signature scheme. In SIGMOD. 1033--1044. https:\/\/doi.org\/10.1145\/1989323.1989431","DOI":"10.1145\/1989323.1989431"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3329772.3329774"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Jin Wang Guoliang Li Dong Deng Yong Zhang and Jianhua Feng. 2015. Two birds with one stone: An efficient hierarchical framework for top-k and threshold-based string similarity search. In ICDE. 519--530. https:\/\/doi.org\/10.1109\/ICDE.2015.7113311  Jin Wang Guoliang Li Dong Deng Yong Zhang and Jianhua Feng. 2015. Two birds with one stone: An efficient hierarchical framework for top-k and threshold-based string similarity search. In ICDE. 519--530. https:\/\/doi.org\/10.1109\/ICDE.2015.7113311","DOI":"10.1109\/ICDE.2015.7113311"},{"key":"e_1_3_2_2_24_1","first-page":"1219","article-title":"Trie-Join","volume":"3","author":"Wang Jiannan","year":"2010","unstructured":"Jiannan Wang , Guoliang Li , and Jianhua Feng . 2010 . Trie-Join : Efficient Trie-based String Similarity Joins with Edit-Distance Constraints. PVLDB , Vol. 3 , 1 (2010), 1219 -- 1230 . https:\/\/doi.org\/10.14778\/1920841.1920992 Jiannan Wang, Guoliang Li, and Jianhua Feng. 2010. Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints. PVLDB, Vol. 3, 1 (2010), 1219--1230. https:\/\/doi.org\/10.14778\/1920841.1920992","journal-title":"Efficient Trie-based String Similarity Joins with Edit-Distance Constraints. PVLDB"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Jiannan Wang Guoliang Li and Jianhua Feng. 2012. Can we beat the prefix filtering?: an adaptive framework for similarity join and search. In SIGMOD. 85--96. https:\/\/doi.org\/10.1145\/2213836.2213847  Jiannan Wang Guoliang Li and Jianhua Feng. 2012. Can we beat the prefix filtering?: an adaptive framework for similarity join and search. In SIGMOD. 85--96. https:\/\/doi.org\/10.1145\/2213836.2213847","DOI":"10.1145\/2213836.2213847"},{"key":"e_1_3_2_2_26_1","volume-title":"Jingkuan Song, and Jianqiu Ji.","author":"Wang Jingdong","year":"2014","unstructured":"Jingdong Wang , Heng Tao Shen , Jingkuan Song, and Jianqiu Ji. 2014 . Hashing for Similarity Search: A Survey. CoRR , Vol. abs\/ 1408 .2927 (2014). arxiv: 1408.2927 http:\/\/arxiv.org\/abs\/1408.2927 Jingdong Wang, Heng Tao Shen, Jingkuan Song, and Jianqiu Ji. 2014. Hashing for Similarity Search: A Survey. CoRR, Vol. abs\/1408.2927 (2014). arxiv: 1408.2927 http:\/\/arxiv.org\/abs\/1408.2927"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Chuan Xiao Wei Wang Xuemin Lin and Jeffrey Xu Yu. 2008b. Efficient similarity joins for near duplicate detection. In WWW. 131--140. https:\/\/doi.org\/10.1145\/1367497.1367516  Chuan Xiao Wei Wang Xuemin Lin and Jeffrey Xu Yu. 2008b. Efficient similarity joins for near duplicate detection. In WWW. 131--140. https:\/\/doi.org\/10.1145\/1367497.1367516","DOI":"10.1145\/1367497.1367516"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-015-5900-5"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Haoyu Zhang and Qin Zhang. 2017. EmbedJoin: Efficient Edit Similarity Joins via Embeddings. In SIGKDD. 585--594. https:\/\/doi.org\/10.1145\/3097983.3098003  Haoyu Zhang and Qin Zhang. 2017. EmbedJoin: Efficient Edit Similarity Joins via Embeddings. In SIGKDD. 585--594. https:\/\/doi.org\/10.1145\/3097983.3098003","DOI":"10.1145\/3097983.3098003"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330853"},{"key":"e_1_3_2_2_32_1","unstructured":"Xiyuan Zhang Yang Yuan and Piotr Indyk. 2020. Neural Embeddings for Nearest Neighbor Search Under Edit Distance. (2020). https:\/\/openreview.net\/forum?id=HJlWIANtPH  Xiyuan Zhang Yang Yuan and Piotr Indyk. 2020. Neural Embeddings for Nearest Neighbor Search Under Edit Distance. (2020). https:\/\/openreview.net\/forum?id=HJlWIANtPH"},{"key":"e_1_3_2_2_33_1","volume-title":"Beng Chin Ooi, and Divesh Srivastava","author":"Zhang Zhenjie","year":"2010","unstructured":"Zhenjie Zhang , Marios Hadjieleftheriou , Beng Chin Ooi, and Divesh Srivastava . 2010 . Bed-tree: an all-purpose index structure for string similarity search based on edit distance. In SIGMOD. 915--926. https:\/\/doi.org\/10.1145\/1807167.1807266 Zhenjie Zhang, Marios Hadjieleftheriou, Beng Chin Ooi, and Divesh Srivastava. 2010. Bed-tree: an all-purpose index structure for string similarity search based on edit distance. In SIGMOD. 915--926. https:\/\/doi.org\/10.1145\/1807167.1807266"}],"event":{"name":"SIGIR '20: The 43rd International ACM SIGIR conference on research and development in Information Retrieval","location":"Virtual Event China","acronym":"SIGIR '20","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397271.3401045","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397271.3401045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:38Z","timestamp":1750195898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397271.3401045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,25]]},"references-count":33,"alternative-id":["10.1145\/3397271.3401045","10.1145\/3397271"],"URL":"https:\/\/doi.org\/10.1145\/3397271.3401045","relation":{},"subject":[],"published":{"date-parts":[[2020,7,25]]},"assertion":[{"value":"2020-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}