| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aalready (0) - 3 freq aalreydy (1) - 1 freq aaready (1) - 55 freq already (1) - 152 freq aareidy (2) - 7 freq awready (2) - 248 freq alreidy (2) - 1 freq alreedy (2) - 1 freq aareddy (2) - 4 freq a'ready (2) - 11 freq ahready (2) - 4 freq alreddy (2) - 4 freq aready (2) - 24 freq aÂ’ready (2) - 1 freq aweready (2) - 3 freq gaready (2) - 1 freq ready (3) - 447 freq mairead (3) - 6 freq a-leary (3) - 1 freq mccready (3) - 6 freq €˜ready (3) - 1 freq awereddy (3) - 1 freq aareadie (3) - 16 freq €œready (3) - 2 freq macreary (3) - 1 freq |
aalready (0) - 3 freq already (1) - 152 freq aalreydy (1) - 1 freq alreedy (2) - 1 freq aaready (2) - 55 freq alreidy (2) - 1 freq aready (3) - 24 freq gaready (3) - 1 freq alreadee (3) - 1 freq alreddy (3) - 4 freq aweready (3) - 3 freq aareidy (3) - 7 freq awready (3) - 248 freq ahready (3) - 4 freq a'ready (3) - 11 freq alriddy (4) - 3 freq aareadie (4) - 16 freq dalriada (4) - 8 freq 'ready (4) - 3 freq allreadee (4) - 1 freq mairead (4) - 6 freq aÂ’ready (4) - 1 freq laired (4) - 8 freq aareddy (4) - 4 freq ready (4) - 447 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 |
AALREADY |
| Time to execute Levenshtein function - 0.181739 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.335232 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.027001 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.037304 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.000929 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. |