| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alert (0) - 17 freq avert (1) - 1 freq glert (1) - 1 freq aert (1) - 45 freq clert (1) - 1 freq apert (1) - 12 freq albert (1) - 25 freq blirt (2) - 8 freq assert (2) - 7 freq clerk (2) - 25 freq alunt (2) - 1 freq aalest (2) - 4 freq auer (2) - 1 freq cert (2) - 1 freq bleet (2) - 2 freq fasert (2) - 1 freq lent (2) - 38 freq alertit (2) - 2 freq stert (2) - 438 freq ales (2) - 1 freq hert (2) - 770 freq avery (2) - 2 freq klerty (2) - 2 freq ayerit (2) - 1 freq overt (2) - 4 freq |
alert (0) - 17 freq layert (2) - 2 freq loert (2) - 2 freq lart (2) - 1 freq alreet (2) - 3 freq albert (2) - 25 freq leart (2) - 4 freq glert (2) - 1 freq aert (2) - 45 freq avert (2) - 1 freq clert (2) - 1 freq apert (2) - 12 freq left (3) - 1591 freq apeart (3) - 1 freq faert (3) - 4 freq kert (3) - 8 freq lere (3) - 2 freq gert (3) - 4 freq bleert (3) - 1 freq albeit (3) - 6 freq weert (3) - 1 freq fyert (3) - 2 freq lairt (3) - 5 freq pert (3) - 60 freq alerted (3) - 2 freq |
SoundEx code - A463 already - 152 freq alerted - 2 freq alert - 17 freq alreddy - 4 freq alreadee - 1 freq alreddie - 1 freq allreadee - 1 freq alreidy - 1 freq aalready - 3 freq alertit - 2 freq alreadies - 1 freq aalreydy - 1 freq alriddy - 3 freq al'riddy - 1 freq alreedy - 1 freq alreet - 3 freq |
MetaPhone code - ALRT already - 152 freq alert - 17 freq alreddy - 4 freq alreadee - 1 freq alreddie - 1 freq allreadee - 1 freq alreidy - 1 freq aalready - 3 freq aalreydy - 1 freq alriddy - 3 freq al'riddy - 1 freq alreedy - 1 freq alreet - 3 freq |
ALERT |
| Time to execute Levenshtein function - 0.191367 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.371969 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.027580 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.039948 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.001189 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. |