| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| already (0) - 152 freq ahready (1) - 4 freq aaready (1) - 55 freq aready (1) - 24 freq awready (1) - 248 freq alreidy (1) - 1 freq alreedy (1) - 1 freq alreddy (1) - 4 freq a'ready (1) - 11 freq aalready (1) - 3 freq awreddy (2) - 4 freq aareidy (2) - 7 freq aweready (2) - 3 freq alreadee (2) - 1 freq aareddy (2) - 4 freq ready (2) - 447 freq gaready (2) - 1 freq alriddy (2) - 3 freq aÂ’ready (2) - 1 freq aalreydy (2) - 1 freq €˜ready (2) - 1 freq €™ready (2) - 3 freq 'ready (2) - 3 freq areddy (2) - 5 freq €œready (2) - 2 freq |
already (0) - 152 freq alreidy (1) - 1 freq alreedy (1) - 1 freq aalready (1) - 3 freq a'ready (2) - 11 freq aalreydy (2) - 1 freq alreadee (2) - 1 freq alreddy (2) - 4 freq ahready (2) - 4 freq aready (2) - 24 freq aaready (2) - 55 freq awready (2) - 248 freq gaready (3) - 1 freq alriddy (3) - 3 freq ready (3) - 447 freq 'ready (3) - 3 freq aareidy (3) - 7 freq aweready (3) - 3 freq arridy (4) - 1 freq allreadee (4) - 1 freq alexdi (4) - 2 freq abreed (4) - 5 freq abroad (4) - 35 freq lead (4) - 193 freq 'read (4) - 4 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 |
ALREADY |
| Time to execute Levenshtein function - 0.189449 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.366956 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.027301 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.037058 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.000903 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. |