Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yirdy (0) - 6 freq yird (1) - 204 freq yirdly (1) - 1 freq wirdy (1) - 1 freq wirry (2) - 26 freq widy (2) - 6 freq kirky (2) - 12 freq yaldy (2) - 3 freq yirded (2) - 4 freq firby (2) - 1 freq lindy (2) - 1 freq yard (2) - 43 freq yirdin (2) - 8 freq birly (2) - 10 freq bird (2) - 190 freq gird (2) - 48 freq yinday (2) - 1 freq jordy (2) - 4 freq wirds (2) - 868 freq yards (2) - 24 freq bidy (2) - 1 freq indy (2) - 57 freq girsy (2) - 1 freq biddy (2) - 12 freq wordy (2) - 11 freq |
yirdy (0) - 6 freq yird (1) - 204 freq yaird (2) - 88 freq ird (2) - 1 freq yerd (2) - 7 freq eirde (2) - 2 freq yrd (2) - 1 freq aird (2) - 3 freq yard (2) - 43 freq wirdy (2) - 1 freq yirdie (2) - 2 freq ridy (2) - 3 freq yirdly (2) - 1 freq weirdy (3) - 1 freq ried (3) - 2 freq yir (3) - 1337 freq airmy (3) - 92 freq fairdy (3) - 1 freq yi'd (3) - 16 freq reidy (3) - 1 freq yirn (3) - 3 freq tidy (3) - 50 freq yeirly (3) - 2 freq airds (3) - 15 freq yirs (3) - 4 freq |
SoundEx code - Y630 yaird - 88 freq yird - 204 freq yirth - 41 freq yirdie - 2 freq yirdy - 6 freq yard - 43 freq yerd - 7 freq year'd - 1 freq €˜yirth - 6 freq yrd - 1 freq |
MetaPhone code - YRT yaird - 88 freq yird - 204 freq yirdie - 2 freq yirdy - 6 freq yard - 43 freq wyert - 1 freq yerd - 7 freq year'd - 1 freq |
YIRDY |
Time to execute Levenshtein function - 0.292513 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.669026 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.027972 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.094823 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.000829 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. |