| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elsewhaur (0) - 13 freq elsewhautr (1) - 1 freq elsewhaar (1) - 2 freq oniewhaur (3) - 16 freq evrywhaur (3) - 1 freq naewhaur (3) - 57 freq elsewhere (3) - 28 freq ilkawhaur (3) - 1 freq somewhaur (3) - 72 freq ontewhaur (3) - 1 freq eethur (4) - 1 freq laethur (4) - 1 freq nae-whaur (4) - 1 freq naewhur (4) - 4 freq nowhaur (4) - 1 freq innywhaur (4) - 1 freq somewhaurs (4) - 2 freq 'somewhaur (4) - 1 freq somewhur (4) - 4 freq a'whaur (4) - 1 freq somewhatur (4) - 1 freq everywhaur (4) - 6 freq naewhair (4) - 1 freq anywhaur (4) - 2 freq €œwhaur (4) - 15 freq |
elsewhaur (0) - 13 freq elsewhaar (1) - 2 freq elsewhautr (2) - 1 freq elsewhere (3) - 28 freq lswhr (4) - 1 freq ilkawhaur (4) - 1 freq ontewhaur (5) - 1 freq somewhaur (5) - 72 freq oniewhaur (5) - 16 freq evrywhaur (5) - 1 freq naewhaur (5) - 57 freq oniewhar (6) - 2 freq onie-whaur (6) - 1 freq awhaur (6) - 2 freq naewhaar (6) - 3 freq naewhar (6) - 3 freq 'whaur (6) - 24 freq sumwhaur (6) - 6 freq enshair (6) - 1 freq somewhar (6) - 7 freq aawhaur (6) - 5 freq €˜whaur (6) - 2 freq somewhaar (6) - 5 freq oniewhur (6) - 1 freq whaur (6) - 1972 freq |
SoundEx code - E426 elsewhaur - 13 freq elsewhere - 28 freq eleazar - 4 freq eliezer - 3 freq elosser - 1 freq elsewhaar - 2 freq eilsewharniss - 1 freq eleckoralwalliedraggs - 1 freq elywkearney - 1 freq ellsworth - 1 freq elcourier - 34 freq elixor - 1 freq elsker - 1 freq |
MetaPhone code - ELSHR elsewhaur - 13 freq elsewhere - 28 freq elsewhaar - 2 freq |
ELSEWHAUR |
| Time to execute Levenshtein function - 0.214539 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.430846 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.027745 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.046416 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.000900 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. |