Find the closest matches (using Damerau-Levenshtein distance) of a given term within any word list.
abitlike --search-target/-s <my term> --file/-f ~/my_word_list.txt [--num-hits/-n <number of hits to return>]-
Notifications
You must be signed in to change notification settings - Fork 0
Find the n-closests matches of a term within any whitespace-separated wordlist
License
hgrsd/abitlike
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Find the n-closests matches of a term within any whitespace-separated wordlist
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published