| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aalreydy (0) - 1 freq aalready (1) - 3 freq alreidy (2) - 1 freq aaready (2) - 55 freq aareddy (2) - 4 freq aareidy (2) - 7 freq already (2) - 152 freq alreddy (2) - 4 freq alreedy (2) - 1 freq aalweys (3) - 2 freq awreddy (3) - 4 freq aready (3) - 24 freq areddy (3) - 5 freq aweready (3) - 3 freq gaready (3) - 1 freq ahready (3) - 4 freq aready (3) - 1 freq aariddy (3) - 4 freq awready (3) - 248 freq alriddy (3) - 3 freq a'ready (3) - 11 freq awereddy (3) - 1 freq caleery (4) - 2 freq balled (4) - 6 freq caley (4) - 4 freq |
aalreydy (0) - 1 freq aalready (1) - 3 freq alreedy (2) - 1 freq already (2) - 152 freq alreidy (2) - 1 freq alreddy (3) - 4 freq aaready (3) - 55 freq aareidy (3) - 7 freq alriddy (4) - 3 freq awready (4) - 248 freq a'ready (4) - 11 freq laired (4) - 8 freq ulreydee (4) - 1 freq gaready (4) - 1 freq ahready (4) - 4 freq alreadee (4) - 1 freq aready (4) - 24 freq aweready (4) - 3 freq aareddy (4) - 4 freq paired (5) - 1 freq faured (5) - 3 freq abreed (5) - 5 freq lured (5) - 2 freq haired (5) - 7 freq mairead (5) - 6 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 |
AALREYDY |
| Time to execute Levenshtein function - 0.207456 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.345415 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.027253 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.037228 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.000937 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. |