| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yirded (0) - 4 freq dirded (1) - 1 freq hirded (1) - 1 freq girded (1) - 1 freq yirdin (2) - 8 freq yirdit (2) - 29 freq mirled (2) - 2 freq yird (2) - 204 freq irked (2) - 1 freq tirled (2) - 6 freq yirders (2) - 2 freq fired (2) - 59 freq irped (2) - 1 freq biried (2) - 3 freq wirmed (2) - 2 freq airted (2) - 31 freq birden (2) - 1 freq tirned (2) - 24 freq firmed (2) - 1 freq yirdy (2) - 6 freq flirded (2) - 1 freq herded (2) - 1 freq yarked (2) - 9 freq gairded (2) - 3 freq hired (2) - 27 freq |
yirded (0) - 4 freq dirded (2) - 1 freq girded (2) - 1 freq hirded (2) - 1 freq yielded (3) - 2 freq bairded (3) - 4 freq yarned (3) - 2 freq inded (3) - 1 freq worded (3) - 1 freq yarder (3) - 1 freq yirdie (3) - 2 freq airned (3) - 1 freq airmed (3) - 21 freq gairded (3) - 3 freq rdad (3) - 1 freq sided (3) - 4 freq eroded (3) - 2 freq ridd (3) - 9 freq eirde (3) - 2 freq yerked (3) - 2 freq yirdly (3) - 1 freq raided (3) - 4 freq aided (3) - 2 freq bided (3) - 30 freq irked (3) - 1 freq |
SoundEx code - Y633 yirded - 4 freq yirdit - 29 freq |
MetaPhone code - YRTT yirded - 4 freq yirdit - 29 freq |
YIRDED |
| Time to execute Levenshtein function - 0.300482 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.457240 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.033710 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.048236 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.004692 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. |