Awesome Open Source

Programming Languages

Search results for trie levenshtein

14 search results found

Fast Fuzzy ⭐ 276

Fast fuzzy search utility

A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.

Roman Klyujkov's Practical Algorithm Template library

Fast Fuzzy Matching ⭐ 18

BK-tree with Damerau-Levenshtein distance and Trie with Levenshtein distance

Levenshtein ⭐ 16

sparse levenshtein automaton in go

Sparsedameraulevenshteinautomaton ⭐ 11

Python implementaion of optimal string alignment algorithm of SparseDamerauLevenshteinAutomaton for string fuzzy match.

Go Autocomplete Trie ⭐ 10

go-autocomplete-trie is a data structure for text auto completion that allows for fuzzy matching and configurable levenshtein distance limits

Levenshteintrie ⭐ 10

A Trie data structure that allows for fuzzy string matching

Fuzzy Search ⭐ 9

Data structures for fuzzy string search

Ocaml Trie ⭐ 8

Trie code forked from https://www.lri.fr/~filliatr/software.en.html

Multi-language, Multi word, utf-8 spelling correction server using a levenshtein automaton and a Trie.

Levenshteinautomaton ⭐ 6

C# implmented Levenshtein Automaton

🚀 DidUMean, is a spelling checker application checks your spelling and recommend words for you in case of wrong spelling ...

Spellwise ⭐ 5

🚀 Extremely fast spelling checker and suggester in Python!

Related Searches

Java Trie (239)

Python Levenshtein (187)

Javascript Trie (175)

Search Trie (133)

Javascript Levenshtein (122)

Algorithms Levenshtein (116)

Similarity Levenshtein (97)

1-14 of 14 search results

Privacy | About | Terms | Follow Us On Twitter

Copyright 2018-2024 Awesome Open Source. All rights reserved.