| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aurora (0) - 9 freq auroch (2) - 2 freq aura (2) - 11 freq turra (2) - 22 freq brora (2) - 15 freq arra (2) - 31 freq uprora (2) - 1 freq juror (2) - 6 freq jurors (2) - 24 freq aroma (2) - 7 freq duror (2) - 1 freq anurra (2) - 3 freq burra (2) - 62 freq rora (2) - 2 freq furra (2) - 42 freq europa (2) - 7 freq aujord (2) - 1 freq austria (3) - 8 freq atore (3) - 2 freq gurrs (3) - 1 freq hurr (3) - 1 freq aurrie (3) - 1 freq amoral (3) - 1 freq gurkha (3) - 1 freq curers (3) - 1 freq |
aurora (0) - 9 freq rora (2) - 2 freq arra (2) - 31 freq arry (3) - 1 freq europa (3) - 7 freq urr (3) - 43 freq erra (3) - 3 freq aurrie (3) - 1 freq rory (3) - 15 freq orra (3) - 172 freq array (3) - 16 freq airer (3) - 1 freq furra (3) - 42 freq uprora (3) - 1 freq burra (3) - 62 freq brora (3) - 15 freq turra (3) - 22 freq aura (3) - 11 freq arrae (3) - 1 freq juror (3) - 6 freq duror (3) - 1 freq anurra (3) - 3 freq aroma (3) - 7 freq nairra (4) - 9 freq rorie (4) - 3 freq |
SoundEx code - A660 aurora - 9 freq airer - 1 freq airier - 1 freq |
MetaPhone code - ARR aurora - 9 freq airer - 1 freq airier - 1 freq |
AURORA |
| Time to execute Levenshtein function - 0.189869 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.398336 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.027470 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.067547 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.000822 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. |