| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iverywhar (0) - 2 freq ivvrywhar (1) - 1 freq iverywhaur (1) - 1 freq iverywhur (1) - 1 freq everywhar (1) - 1 freq everywhair (2) - 1 freq iveriewhar (2) - 1 freq iverywan (2) - 1 freq ivverywhaur (2) - 2 freq iverywhere (2) - 1 freq everywhaur (2) - 6 freq everywhan (2) - 1 freq ivrywhere (3) - 2 freq iverywye (3) - 1 freq everywhaut (3) - 1 freq iverythin (3) - 14 freq iveryday (3) - 4 freq ivrywan (3) - 7 freq evrywhaur (3) - 1 freq everywan (3) - 13 freq everywhere (3) - 42 freq ivermair (4) - 3 freq ivvrythin (4) - 1 freq iveryboady (4) - 1 freq everyday (4) - 32 freq |
iverywhar (0) - 2 freq everywhar (1) - 1 freq iverywhur (1) - 1 freq iverywhaur (1) - 1 freq ivvrywhar (2) - 1 freq everywhaur (2) - 6 freq iverywhere (2) - 1 freq everywhair (2) - 1 freq iveriewhar (2) - 1 freq evrywhaur (3) - 1 freq everywhere (3) - 42 freq ivrywhere (3) - 2 freq everywhan (3) - 1 freq ivverywhaur (3) - 2 freq iverywan (4) - 1 freq everywhaut (4) - 1 freq everywan (5) - 13 freq evriwhere (5) - 1 freq erywhere (5) - 1 freq iverywye (5) - 1 freq ivrywan (5) - 7 freq iverythin (5) - 14 freq everywoman (6) - 2 freq ivrythin (6) - 3 freq naewhar (6) - 3 freq |
SoundEx code - I166 iveriewhar - 1 freq iverywhar - 2 freq iverywhur - 1 freq ivrywhere - 2 freq ivvrywhar - 1 freq iverywhere - 1 freq iverywhaur - 1 freq ivverywhaur - 2 freq ipirurth - 1 freq |
MetaPhone code - IFRHR iveriewhar - 1 freq iverywhar - 2 freq iverywhur - 1 freq ivrywhere - 2 freq ivvrywhar - 1 freq iverywhere - 1 freq iverywhaur - 1 freq ivverywhaur - 2 freq |
IVERYWHAR |
| Time to execute Levenshtein function - 0.670541 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.306189 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.098712 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.112034 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.001020 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. |