Awesome Open Source

Programming Languages

Search results for trie levenshtein distance

levenshtein-distance x

9 search results found

A Trie implementation in Golang meant for auto-completion use cases. Supports Levenshtein distance search.

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

Fast Fuzzy Matching ⭐ 18

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

Stringoperations ⭐ 14

Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein

An efficient data structure for fast string similarity searches

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

Ffsearch ⭐ 10

Fast fuzzy string search

Ocaml Trie ⭐ 8

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

Dict Trie ⭐ 6

Trie implementation for approximate string matching.

Related Searches

Java Trie (239)

Data Structure Trie (209)

C Plus Plus Trie (208)

Python Trie (193)

Golang Trie (179)

Algorithms Trie (152)

Search Trie (133)

Python Levenshtein Distance (90)

1-9 of 9 search results

Privacy | About | Terms | Follow Us On Twitter

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