Using Fuzzy Search in Typesense Search Algorithm
TLDR Gilbert asked about fuzzy search in typesense. It was clarified by Kishore Nallan that a trie data structure and levenshtein distance are used in the process. Harrison also contributed to the conversation.
Oct 01, 2022 (15 months ago)
Oct 02, 2022 (15 months ago)
Kishore Nallan03:38 AM
Oct 04, 2022 (15 months ago)
Kishore Nallan02:37 AM
Indexed 3005 threads (79% resolved)
Does Typesense Use Levenshtein Distance for Search?
Dingu inquired about Typesense's use of Levenshtein distance. Kishore Nallan clarified Typesense's algorithm, explaining that it uses a trie data structure and calculates Levenshtein distance on-the-fly.
Benchmarking Typesense Search Results
Narayan asked about the search algorithm in Typesense and how it compares to TF-IDF/BM25. Kishore Nallan explained that Typesense focuses on smaller documents and provided links to their test suites.
Enabling Fuzzy Search and Infix Search in Typesense
arpit asks about enabling fuzzy search and infix search in Typesense. Jason explains the difference between the two and how to enable them by modifying the search parameter and schema.