Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
vendor (0) - 1 freq senior (2) - 40 freq veedon (2) - 1 freq veneer (2) - 1 freq mentor (2) - 2 freq tender (2) - 23 freq rendir (2) - 1 freq hender (2) - 1 freq tenor (2) - 4 freq sentor (2) - 1 freq vndir (2) - 1 freq verdur (2) - 1 freq endow (2) - 2 freq ventur (2) - 6 freq kendo (2) - 2 freq ventir (2) - 1 freq lender (2) - 2 freq sender (2) - 2 freq bender (2) - 5 freq render (2) - 8 freq censor (2) - 3 freq venom (2) - 13 freq ken-or (2) - 1 freq vendin (2) - 2 freq tenior (2) - 1 freq |
vendor (0) - 1 freq vndir (2) - 1 freq lender (3) - 2 freq ventir (3) - 1 freq ventur (3) - 6 freq bender (3) - 5 freq render (3) - 8 freq gender (3) - 19 freq fender (3) - 10 freq vendin (3) - 2 freq verdur (3) - 1 freq sender (3) - 2 freq veneer (3) - 1 freq tender (3) - 23 freq hender (3) - 1 freq rendir (3) - 1 freq wunder (4) - 26 freq tinder (4) - 8 freq hundyr (4) - 1 freq undr (4) - 1 freq bunder (4) - 1 freq sinder (4) - 13 freq verdure (4) - 1 freq hunder (4) - 96 freq meander (4) - 2 freq |
SoundEx code - V536 venture - 21 freq venturt - 8 freq ventured - 9 freq ventures - 2 freq ventur - 6 freq ventered - 1 freq vomit-worthy - 1 freq ventriloquist - 2 freq veentured - 1 freq veenture - 1 freq venture's - 1 freq ventricles - 1 freq ventired - 4 freq ventir - 1 freq ventriloquist's - 1 freq ventreeloquists - 1 freq vndir - 1 freq venturin - 2 freq vendor - 1 freq venturit - 1 freq venturet - 1 freq ventriloquises - 1 freq venturin' - 1 freq venturing - 2 freq |
MetaPhone code - FNTR venture - 21 freq fender - 10 freq ventur - 6 freq veenture - 1 freq finder - 5 freq ventir - 1 freq fainter - 2 freq funder - 1 freq founder - 3 freq vndir - 1 freq fyndar - 1 freq vendor - 1 freq 'fender' - 1 freq foundry - 4 freq |
VENDOR |
Time to execute Levenshtein function - 1.196847 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 1.499266 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.095313 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.115808 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001198 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |