| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alert (0) - 17 freq clert (1) - 1 freq apert (1) - 12 freq albert (1) - 25 freq glert (1) - 1 freq aert (1) - 45 freq clerk (2) - 24 freq lent (2) - 38 freq cleft (2) - 5 freq valet (2) - 1 freq angert (2) - 16 freq overt (2) - 4 freq ajer (2) - 2 freq leat (2) - 1 freq ahent (2) - 100 freq gert (2) - 4 freq fyert (2) - 2 freq baler (2) - 4 freq alder (2) - 1 freq apart (2) - 113 freq alertit (2) - 2 freq glett (2) - 2 freq alex (2) - 62 freq ales (2) - 1 freq aperrt (2) - 1 freq |
alert (0) - 17 freq lart (2) - 1 freq leart (2) - 4 freq loert (2) - 2 freq alreet (2) - 3 freq clert (2) - 1 freq layert (2) - 2 freq albert (2) - 25 freq aert (2) - 45 freq apert (2) - 12 freq glert (2) - 1 freq let (3) - 1354 freq art (3) - 88 freq alaft (3) - 2 freq alberta (3) - 1 freq auler (3) - 17 freq aloat (3) - 8 freq aaler (3) - 17 freq weert (3) - 1 freq alt (3) - 5 freq pert (3) - 60 freq lawert (3) - 1 freq feert (3) - 36 freq sert (3) - 2 freq cleart (3) - 9 freq |
SoundEx code - A463 already - 150 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 - 150 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.580466 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.910230 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.087863 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.037001 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.000884 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. |