Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
yirdy (0) - 6 freq yird (1) - 206 freq yirdly (1) - 1 freq wirdy (1) - 1 freq yerds (2) - 4 freq mird (2) - 6 freq yitey (2) - 3 freq mirds (2) - 1 freq eirde (2) - 2 freq bird (2) - 192 freq airly (2) - 20 freq yaird (2) - 88 freq riddy (2) - 38 freq indy (2) - 57 freq fierdy (2) - 1 freq yirded (2) - 4 freq girds (2) - 5 freq widdy (2) - 3 freq girmy (2) - 1 freq aird (2) - 3 freq yids (2) - 2 freq kiddy (2) - 1 freq virry (2) - 2 freq yir (2) - 1409 freq yeirly (2) - 2 freq |
yirdy (0) - 6 freq yird (1) - 206 freq yirdie (2) - 2 freq yaird (2) - 88 freq aird (2) - 3 freq yrd (2) - 1 freq ird (2) - 1 freq yard (2) - 43 freq ridy (2) - 3 freq yerd (2) - 7 freq yirdly (2) - 1 freq wirdy (2) - 1 freq eirde (2) - 2 freq hardy (3) - 24 freq cardy (3) - 1 freq weirdy (3) - 1 freq yinday (3) - 1 freq airty (3) - 1 freq yirs (3) - 4 freq dird (3) - 2 freq yaldy (3) - 3 freq yirdit (3) - 29 freq wird (3) - 583 freq bidy (3) - 1 freq eard (3) - 1 freq |
SoundEx code - Y630 yaird - 88 freq yird - 206 freq yirth - 43 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 - 206 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.194306 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.353871 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.027561 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.036988 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.000887 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. |