| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alriddy (0) - 3 freq awriddy (1) - 3 freq alreddy (1) - 4 freq ariddy (1) - 32 freq arriddy (1) - 1 freq aariddy (1) - 4 freq al'riddy (1) - 1 freq bluiddy (2) - 1 freq aabiddy (2) - 1 freq arridy (2) - 1 freq bliddy (2) - 105 freq areddy (2) - 5 freq a'biddy (2) - 2 freq aareddy (2) - 4 freq alreedy (2) - 1 freq alreidy (2) - 1 freq abiddy (2) - 28 freq already (2) - 150 freq riddy (2) - 38 freq awreddy (2) - 4 freq laidy (3) - 1 freq lidd (3) - 2 freq alright (3) - 20 freq naebiddy (3) - 32 freq blidd (3) - 4 freq |
alriddy (0) - 3 freq alreddy (1) - 4 freq aariddy (2) - 4 freq arriddy (2) - 1 freq al'riddy (2) - 1 freq ariddy (2) - 32 freq awriddy (2) - 3 freq alreidy (3) - 1 freq alreedy (3) - 1 freq riddy (3) - 38 freq aareddy (3) - 4 freq awreddy (3) - 4 freq already (3) - 150 freq alreddie (3) - 1 freq areddy (3) - 5 freq roddy (4) - 11 freq riddi (4) - 1 freq aariddie (4) - 1 freq leddy (4) - 24 freq proddy (4) - 2 freq ruddy (4) - 8 freq awereddy (4) - 1 freq ridd (4) - 9 freq aalready (4) - 3 freq laddy (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 |
ALRIDDY |
| Time to execute Levenshtein function - 0.173074 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.350147 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.027183 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.037516 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.000815 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. |