| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alert (0) - 17 freq clert (1) - 1 freq aert (1) - 45 freq avert (1) - 1 freq glert (1) - 1 freq albert (1) - 25 freq apert (1) - 12 freq smert (2) - 44 freq allest (2) - 1 freq fyert (2) - 2 freq alek (2) - 3 freq lart (2) - 1 freq aest (2) - 21 freq klerty (2) - 2 freq clerk (2) - 24 freq alex (2) - 62 freq fleit (2) - 1 freq aferr (2) - 1 freq leart (2) - 4 freq aperrt (2) - 1 freq 'let (2) - 15 freq alot (2) - 18 freq avera (2) - 1 freq aalest (2) - 4 freq vert (2) - 1 freq |
alert (0) - 17 freq clert (2) - 1 freq lart (2) - 1 freq loert (2) - 2 freq leart (2) - 4 freq alreet (2) - 3 freq layert (2) - 2 freq avert (2) - 1 freq aert (2) - 45 freq apert (2) - 12 freq glert (2) - 1 freq albert (2) - 25 freq alarmt (3) - 3 freq weert (3) - 1 freq aloat (3) - 8 freq blirt (3) - 8 freq bert (3) - 106 freq lere (3) - 2 freq alist (3) - 2 freq aaler (3) - 17 freq left (3) - 1591 freq alaft (3) - 2 freq alberto (3) - 2 freq ayerit (3) - 1 freq lern (3) - 3 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.189479 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.351987 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.036089 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.039060 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.000891 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. |