| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| already (0) - 150 freq aalready (1) - 3 freq alreidy (1) - 1 freq a'ready (1) - 11 freq aaready (1) - 54 freq ahready (1) - 3 freq alreedy (1) - 1 freq alreddy (1) - 4 freq awready (1) - 242 freq aready (1) - 24 freq alriddy (2) - 3 freq aareidy (2) - 7 freq €œready (2) - 2 freq aareddy (2) - 4 freq aweready (2) - 3 freq ready (2) - 443 freq €˜ready (2) - 1 freq awreddy (2) - 4 freq alreadee (2) - 1 freq areddy (2) - 5 freq €™ready (2) - 2 freq 'ready (2) - 2 freq aÂ’ready (2) - 1 freq gaready (2) - 1 freq aalreydy (2) - 1 freq |
already (0) - 150 freq alreidy (1) - 1 freq alreedy (1) - 1 freq aalready (1) - 3 freq aready (2) - 24 freq aalreydy (2) - 1 freq alreadee (2) - 1 freq a'ready (2) - 11 freq awready (2) - 242 freq aaready (2) - 54 freq alreddy (2) - 4 freq ahready (2) - 3 freq ready (3) - 443 freq gaready (3) - 1 freq 'ready (3) - 2 freq aareidy (3) - 7 freq aweready (3) - 3 freq alriddy (3) - 3 freq abrade (4) - 1 freq almeida (4) - 1 freq reread (4) - 2 freq dread (4) - 30 freq greedy (4) - 38 freq alfred (4) - 12 freq reedy (4) - 1 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 |
ALREADY |
| Time to execute Levenshtein function - 0.202387 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.360147 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.027361 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.039039 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.000837 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. |