| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vendin (0) - 2 freq sendin (1) - 63 freq tendin (1) - 9 freq mendin (1) - 10 freq lendin (1) - 3 freq bendin (1) - 15 freq pendin (1) - 3 freq vengin (1) - 1 freq fendin (1) - 5 freq endin (1) - 43 freq deddin (2) - 1 freq fentin (2) - 2 freq handin (2) - 15 freq sending (2) - 13 freq menein (2) - 2 freq feidin (2) - 1 freq redin (2) - 2 freq blendin (2) - 3 freq evenin (2) - 133 freq fundin (2) - 62 freq readin (2) - 373 freq unendin (2) - 2 freq myndin (2) - 19 freq hentin (2) - 4 freq vendor (2) - 1 freq |
vendin (0) - 2 freq pendin (2) - 3 freq vengin (2) - 1 freq fendin (2) - 5 freq bendin (2) - 15 freq endin (2) - 43 freq lendin (2) - 3 freq sendin (2) - 63 freq tendin (2) - 9 freq mendin (2) - 10 freq bondin (3) - 1 freq bendan (3) - 1 freq evendoon (3) - 5 freq hondin (3) - 1 freq fandin (3) - 1 freq sendan (3) - 3 freq nedin (3) - 1 freq jandin (3) - 1 freq upendin (3) - 1 freq findin (3) - 71 freq endan (3) - 2 freq needin (3) - 213 freq veedon (3) - 1 freq onendin (3) - 1 freq landin (3) - 45 freq |
SoundEx code - V535 vomitin - 1 freq vendin - 2 freq venetian - 2 freq vomiting - 1 freq vanedenburgh - 1 freq |
MetaPhone code - FNTN fundin - 62 freq findin - 71 freq faintin - 4 freq finndin - 11 freq fendin - 5 freq finndna - 1 freq foontain - 4 freq fanton - 3 freq findin' - 3 freq fountain - 17 freq fenton - 8 freq fintin - 1 freq funtain - 6 freq vendin - 2 freq fentin - 2 freq fantin - 20 freq fountain' - 1 freq foondin - 13 freq findan - 6 freq fendan - 1 freq fundin' - 37 freq faintan - 1 freq fine-tuin - 1 freq fontaine - 1 freq fandin - 1 freq phanton - 1 freq fundeen - 3 freq 'fundin - 1 freq €œfindan - 1 freq foundin - 1 freq fandan - 7 freq |
VENDIN |
| Time to execute Levenshtein function - 0.209041 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 - 0.382672 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.029491 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.041154 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.000903 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. |