does typsense use levenshtein distance as the edit distance?

@Dingu Sagar There is no documentation at the moment that dives into the technical nitty gritties (but it's on my todo list). Typesense uses an in-memory Trie data structure to index the tokens in the text. For fuzzy search, this trie is traversed recursively, and the Levenshtein distance is computed on the fly as the traversal progresses. The performance is because of the use of carefully designed data structures (that exploit cache locality and SIMD instructions) and many hours of obsession 🙂 The use of C++ also helps, when you compare with interpreted languages like Python (which will explain the difference with fuzzywuzzy).

thanks a lot for the reply. got some high level idea regarding the search algo. a documentation explaining the technical details would be really helpful for beginners like me who wants to explore and contribute. glad to know that its on your todo list. thanks again.