A plain text search engine enables users to compare the complexities of various algorithms, including Rabin-Karp, KMP, Boyer-Moore, and Linear Search. It features advanced indexing with an auto-complete function using a Trie data structure. Additionally, it offers fuzzy search capabilities based on the Levenshtein distance algorithm for improved accuracy.
-
Notifications
You must be signed in to change notification settings - Fork 0
This plain text search engine allows users to compare algorithm complexities (Rabin-Karp, KMP, Boyer-Moore, Linear Search), features advanced indexing with Trie-based auto-complete, and incorporates fuzzy search using the Levenshtein distance algorithm for enhanced accuracy.
Rupangkan/doc-find
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This plain text search engine allows users to compare algorithm complexities (Rabin-Karp, KMP, Boyer-Moore, Linear Search), features advanced indexing with Trie-based auto-complete, and incorporates fuzzy search using the Levenshtein distance algorithm for enhanced accuracy.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published