| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yirdit (0) - 29 freq yirdie (1) - 2 freq yirdin (1) - 8 freq mirdit (1) - 1 freq yirkit (1) - 1 freq dirdit (1) - 5 freq wirdit (1) - 1 freq girnit (2) - 1 freq gildit (2) - 1 freq girdin (2) - 2 freq airdie (2) - 2 freq mirdin (2) - 1 freq airmit (2) - 4 freq bidit (2) - 30 freq wirrit (2) - 3 freq yird (2) - 204 freq hiddit (2) - 2 freq herdit (2) - 8 freq airtit (2) - 41 freq tirlit (2) - 2 freq eildit (2) - 12 freq aidit (2) - 1 freq nyirgit (2) - 2 freq birdie (2) - 35 freq birrit (2) - 3 freq |
yirdit (0) - 29 freq wirdit (2) - 1 freq yirkit (2) - 1 freq dirdit (2) - 5 freq mirdit (2) - 1 freq yirdin (2) - 8 freq yirdie (2) - 2 freq weirdit (3) - 5 freq sidit (3) - 1 freq lardit (3) - 1 freq buirdit (3) - 1 freq fairdit (3) - 1 freq yairnit (3) - 3 freq yarkit (3) - 2 freq yirdly (3) - 1 freq yirded (3) - 4 freq redit (3) - 2 freq roadit (3) - 6 freq readit (3) - 3 freq raidit (3) - 2 freq yerkit (3) - 3 freq yirdy (3) - 6 freq bordit (3) - 1 freq hidit (3) - 1 freq beirdit (3) - 1 freq |
SoundEx code - Y633 yirded - 4 freq yirdit - 29 freq |
MetaPhone code - YRTT yirded - 4 freq yirdit - 29 freq |
YIRDIT |
| Time to execute Levenshtein function - 0.502222 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.795702 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.028642 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.096240 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.001047 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. |