Yildiz, BurakEmekci, Fatih2025-10-242025-10-2420161300-06321303-6203https://doi.org/10.3906/elk-1402-92https://search.trdizin.gov.tr/tr/yayin/detay/245982https://hdl.handle.net/20.500.12899/3846The problem of finding similar strings is very important in most real life applications including spell-checking, data cleaning, next generation sequencing, and alignment. In order to query and manage string data online, scalable algorithms and frameworks are essential. Scalable frameworks and algorithms have been introduced in the past few years. However, these frameworks mainly deal with caching and querying structured data. They do not deal with fuzzy queries, where we need to search for an approximate string. In this paper, we propose an edit distance aware filtering algorithm for all kinds of approximate string search problems. We also propose a novel name spell-check engine mainly for social networks. Our experiments show that our edit distance aware filtering mechanism alone improves the query processing time and throughput by almost 30%. Additionally, our name spell-check engine improved the name spell-check response time and throughput almost 10 times by using our filtering scheme and some domain specific observations.eninfo:eu-repo/semantics/openAccessstring search; spell check; social networksArticle10.3906/elk-1402-92244219422042-s2.0-84974695704Q2245982WOS:000374325800014Q4