| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| everywhere (0) - 42 freq iverywhere (1) - 1 freq erywhere (2) - 1 freq 'everywhere' (2) - 1 freq ivrywhere (2) - 2 freq evriwhere (2) - 1 freq everywhar (2) - 1 freq everywhair (3) - 1 freq iverywhar (3) - 2 freq iverywhur (3) - 1 freq everywhaut (3) - 1 freq everywhan (3) - 1 freq everywhaur (3) - 6 freq everywye (3) - 2 freq ever-more (4) - 1 freq everywan (4) - 13 freq iverywhaur (4) - 1 freq elsewhere (4) - 27 freq everywoman (4) - 2 freq naewhere (4) - 46 freq everywan's (4) - 4 freq everyeen (4) - 4 freq everything (4) - 96 freq everyones (4) - 2 freq iverywye (4) - 1 freq |
everywhere (0) - 42 freq iverywhere (1) - 1 freq ivrywhere (2) - 2 freq everywhar (2) - 1 freq evriwhere (2) - 1 freq iverywhur (3) - 1 freq everywhaur (3) - 6 freq iverywhar (3) - 2 freq everywhair (3) - 1 freq erywhere (3) - 1 freq iverywhaur (4) - 1 freq evrywhaur (4) - 1 freq everywhan (4) - 1 freq everywhaut (4) - 1 freq 'everywhere' (4) - 1 freq everywye (5) - 2 freq iveriewhar (5) - 1 freq ivvrywhar (5) - 1 freq onywhere (6) - 27 freq naywhere (6) - 1 freq everythin (6) - 113 freq evermore (6) - 2 freq everyhin (6) - 30 freq everywans (6) - 1 freq everywoman (6) - 2 freq |
SoundEx code - E166 everywhere - 42 freq everywhaur - 6 freq evriwhere - 1 freq 'everywhere' - 1 freq evrywhaur - 1 freq everywhair - 1 freq everywhar - 1 freq |
MetaPhone code - EFRHR everywhere - 42 freq everywhaur - 6 freq evriwhere - 1 freq 'everywhere' - 1 freq evrywhaur - 1 freq everywhair - 1 freq everywhar - 1 freq |
EVERYWHERE |
| Time to execute Levenshtein function - 0.228335 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.479174 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.029720 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.036857 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.000820 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. |