| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yerd (0) - 7 freq yer (1) - 8074 freq yird (1) - 206 freq erd (1) - 11 freq serd (1) - 1 freq ferd (1) - 2 freq yerk (1) - 3 freq werd (1) - 1 freq yerl (1) - 1 freq kerd (1) - 1 freq derd (1) - 1 freq yerw (1) - 1 freq yers (1) - 20 freq yeld (1) - 2 freq nerd (1) - 2 freq yeed (1) - 1 freq yerds (1) - 4 freq ye'd (1) - 445 freq herd (1) - 158 freq yerb (1) - 1 freq yed (1) - 7 freq yard (1) - 43 freq yere (1) - 7 freq yrd (1) - 1 freq cerd (1) - 7 freq |
yerd (0) - 7 freq yrd (1) - 1 freq yard (1) - 43 freq erd (1) - 11 freq yird (1) - 206 freq reed (2) - 184 freq eard (2) - 1 freq reid (2) - 406 freq yere (2) - 7 freq ird (2) - 1 freq cerd (2) - 7 freq red (2) - 297 freq yaird (2) - 88 freq aird (2) - 3 freq ayered (2) - 1 freq yirdy (2) - 6 freq yed (2) - 7 freq ard (2) - 4 freq read (2) - 958 freq rd (2) - 64 freq yerl (2) - 1 freq kerd (2) - 1 freq derd (2) - 1 freq yers (2) - 20 freq yerb (2) - 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 |
YERD |
| Time to execute Levenshtein function - 0.193590 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.365292 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.027695 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.037680 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.000913 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. |