Fuzzy Substring Matching: On-device Fuzzy Friend Search at Snapchat

Fuzzy Substring Matching: On-device Fuzzy Friend Search at Snapchat

About 50% of all queries on Snapchat app are targeted at finding the right friend to interact with. Since everyone has a unique list of friends and that list is not very large (maximum a few thousand), it makes sense to perform this search locally, on users' devices. In addition, the friend lis...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Pihur, Vasyl, Thompson, Scott
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Information Retrieval
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Pihur, Vasyl
Thompson, Scott
description About 50% of all queries on Snapchat app are targeted at finding the right friend to interact with. Since everyone has a unique list of friends and that list is not very large (maximum a few thousand), it makes sense to perform this search locally, on users' devices. In addition, the friend list is already available for other purposes, such as showing the chat feed, and the latency savings can be significant by avoiding a server round-trip call. Historically, we resorted to substring matching, ranking prefix matches at the top of the result list. Introducing the ability to perform fuzzy search on a resource-constrained device and in the environment where typo's are prevalent is both prudent and challenging. In this paper, we describe our efficient and accurate two-step approach to fuzzy search, characterized by a skip-bigram retrieval layer and a novel local Levenshtein distance computation used for final ranking.
doi_str_mv 10.48550/arxiv.2211.02767
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2211_02767</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2211_02767</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-5b235376190b22b9672ecefe7f38c6cd55b9089f85d533d0bcbdf684666a07c93</originalsourceid><addsrcrecordid>eNotz7FOwzAUBVAvDKjwAUz4BxIcu3622VBEAKmoQ7pHz882sQRR5aYV7dcDLdO9w9WVDmN3jaiXVmvxgOU7H2opm6YW0oC5Zm23P52OvN_73Vzy9MHfcabxtzzy9VSFeMgU-WXTlRynwPuIhUaOM-8n3NKI8w27Svi5i7f_uWCb7nnTvlar9ctb-7SqEIyptJdKKwONE15K78DISDFFk5QloKC1d8K6ZHXQSgXhyYcEdgkAKAw5tWD3l9uzYtiW_IXlOPxphrNG_QCkkEQ4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Fuzzy Substring Matching: On-device Fuzzy Friend Search at Snapchat</title><source>arXiv.org</source><creator>Pihur, Vasyl ; Thompson, Scott</creator><creatorcontrib>Pihur, Vasyl ; Thompson, Scott</creatorcontrib><description>About 50% of all queries on Snapchat app are targeted at finding the right friend to interact with. Since everyone has a unique list of friends and that list is not very large (maximum a few thousand), it makes sense to perform this search locally, on users' devices. In addition, the friend list is already available for other purposes, such as showing the chat feed, and the latency savings can be significant by avoiding a server round-trip call. Historically, we resorted to substring matching, ranking prefix matches at the top of the result list. Introducing the ability to perform fuzzy search on a resource-constrained device and in the environment where typo's are prevalent is both prudent and challenging. In this paper, we describe our efficient and accurate two-step approach to fuzzy search, characterized by a skip-bigram retrieval layer and a novel local Levenshtein distance computation used for final ranking.</description><identifier>DOI: 10.48550/arxiv.2211.02767</identifier><language>eng</language><subject>Computer Science - Information Retrieval</subject><creationdate>2022-11</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2211.02767$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2211.02767$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Pihur, Vasyl</creatorcontrib><creatorcontrib>Thompson, Scott</creatorcontrib><title>Fuzzy Substring Matching: On-device Fuzzy Friend Search at Snapchat</title><description>About 50% of all queries on Snapchat app are targeted at finding the right friend to interact with. Since everyone has a unique list of friends and that list is not very large (maximum a few thousand), it makes sense to perform this search locally, on users' devices. In addition, the friend list is already available for other purposes, such as showing the chat feed, and the latency savings can be significant by avoiding a server round-trip call. Historically, we resorted to substring matching, ranking prefix matches at the top of the result list. Introducing the ability to perform fuzzy search on a resource-constrained device and in the environment where typo's are prevalent is both prudent and challenging. In this paper, we describe our efficient and accurate two-step approach to fuzzy search, characterized by a skip-bigram retrieval layer and a novel local Levenshtein distance computation used for final ranking.</description><subject>Computer Science - Information Retrieval</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7FOwzAUBVAvDKjwAUz4BxIcu3622VBEAKmoQ7pHz882sQRR5aYV7dcDLdO9w9WVDmN3jaiXVmvxgOU7H2opm6YW0oC5Zm23P52OvN_73Vzy9MHfcabxtzzy9VSFeMgU-WXTlRynwPuIhUaOM-8n3NKI8w27Svi5i7f_uWCb7nnTvlar9ctb-7SqEIyptJdKKwONE15K78DISDFFk5QloKC1d8K6ZHXQSgXhyYcEdgkAKAw5tWD3l9uzYtiW_IXlOPxphrNG_QCkkEQ4</recordid><startdate>20221104</startdate><enddate>20221104</enddate><creator>Pihur, Vasyl</creator><creator>Thompson, Scott</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20221104</creationdate><title>Fuzzy Substring Matching: On-device Fuzzy Friend Search at Snapchat</title><author>Pihur, Vasyl ; Thompson, Scott</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-5b235376190b22b9672ecefe7f38c6cd55b9089f85d533d0bcbdf684666a07c93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Information Retrieval</topic><toplevel>online_resources</toplevel><creatorcontrib>Pihur, Vasyl</creatorcontrib><creatorcontrib>Thompson, Scott</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Pihur, Vasyl</au><au>Thompson, Scott</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fuzzy Substring Matching: On-device Fuzzy Friend Search at Snapchat</atitle><date>2022-11-04</date><risdate>2022</risdate><abstract>About 50% of all queries on Snapchat app are targeted at finding the right friend to interact with. Since everyone has a unique list of friends and that list is not very large (maximum a few thousand), it makes sense to perform this search locally, on users' devices. In addition, the friend list is already available for other purposes, such as showing the chat feed, and the latency savings can be significant by avoiding a server round-trip call. Historically, we resorted to substring matching, ranking prefix matches at the top of the result list. Introducing the ability to perform fuzzy search on a resource-constrained device and in the environment where typo's are prevalent is both prudent and challenging. In this paper, we describe our efficient and accurate two-step approach to fuzzy search, characterized by a skip-bigram retrieval layer and a novel local Levenshtein distance computation used for final ranking.</abstract><doi>10.48550/arxiv.2211.02767</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2211.02767
ispartof
issn
language eng
recordid cdi_arxiv_primary_2211_02767
source arXiv.org
subjects Computer Science - Information Retrieval
title Fuzzy Substring Matching: On-device Fuzzy Friend Search at Snapchat
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T12%3A39%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fuzzy%20Substring%20Matching:%20On-device%20Fuzzy%20Friend%20Search%20at%20Snapchat&rft.au=Pihur,%20Vasyl&rft.date=2022-11-04&rft_id=info:doi/10.48550/arxiv.2211.02767&rft_dat=%3Carxiv_GOX%3E2211_02767%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true