| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alreadee (0) - 1 freq allreadee (1) - 1 freq already (2) - 152 freq aareadie (2) - 16 freq alreddie (2) - 1 freq alreadies (2) - 1 freq ulreydee (2) - 1 freq ahready (3) - 4 freq a'ready (3) - 11 freq alreedy (3) - 1 freq aureate (3) - 2 freq awreddie (3) - 2 freq pleaded (3) - 17 freq spreader (3) - 3 freq alreet (3) - 3 freq reydee (3) - 1 freq readeen (3) - 1 freq aareadies (3) - 39 freq dreaded (3) - 5 freq alreddy (3) - 4 freq aaready (3) - 55 freq arcade (3) - 8 freq aalready (3) - 3 freq ariadne (3) - 4 freq areddie (3) - 1 freq |
alreadee (0) - 1 freq ulreydee (2) - 1 freq already (2) - 152 freq allreadee (2) - 1 freq aalready (3) - 3 freq alreidy (3) - 1 freq alreedy (3) - 1 freq aareadie (3) - 16 freq alreadies (3) - 1 freq alreddie (3) - 1 freq aherdee (4) - 1 freq alreddy (4) - 4 freq aaready (4) - 55 freq abrade (4) - 1 freq readie (4) - 36 freq awready (4) - 248 freq leared (4) - 1 freq aalreydy (4) - 1 freq aready (4) - 24 freq alreet (4) - 3 freq ahready (4) - 4 freq a'ready (4) - 11 freq reydee (4) - 1 freq iheardee (5) - 3 freq laired (5) - 8 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 |
ALREADEE |
| Time to execute Levenshtein function - 0.218718 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.400821 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.028606 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.039605 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.000858 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. |