| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aurora (0) - 10 freq uprora (2) - 1 freq juror (2) - 6 freq rora (2) - 2 freq auroch (2) - 2 freq europa (2) - 7 freq turra (2) - 22 freq aujord (2) - 1 freq jurors (2) - 24 freq aura (2) - 11 freq brora (2) - 15 freq furra (2) - 42 freq anurra (2) - 3 freq aroma (2) - 7 freq burra (2) - 62 freq arra (2) - 32 freq duror (2) - 1 freq buroo (3) - 10 freq culort (3) - 1 freq arran (3) - 15 freq hurry (3) - 147 freq airmor (3) - 1 freq acrobat (3) - 3 freq aoa (3) - 1 freq tutor (3) - 8 freq |
aurora (0) - 10 freq rora (2) - 2 freq arra (2) - 32 freq arry (3) - 1 freq urr (3) - 40 freq array (3) - 16 freq duror (3) - 1 freq airer (3) - 1 freq rory (3) - 15 freq orra (3) - 172 freq erra (3) - 3 freq arrae (3) - 1 freq burra (3) - 62 freq aurrie (3) - 1 freq juror (3) - 6 freq europa (3) - 7 freq turra (3) - 22 freq aroma (3) - 7 freq brora (3) - 15 freq aura (3) - 11 freq furra (3) - 42 freq uprora (3) - 1 freq anurra (3) - 3 freq rre (4) - 1 freq furry (4) - 23 freq |
SoundEx code - A660 aurora - 10 freq airer - 1 freq airier - 1 freq |
MetaPhone code - ARR aurora - 10 freq airer - 1 freq airier - 1 freq |
AURORA |
| Time to execute Levenshtein function - 0.242268 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.346444 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.028497 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.037539 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.000934 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. |