| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yerkin (0) - 4 freq yarkin (1) - 4 freq yerkit (1) - 3 freq herkin (1) - 3 freq yeukin (1) - 1 freq werkin (1) - 2 freq merkin (1) - 6 freq gerkin (1) - 1 freq yirkin (1) - 1 freq berkin (1) - 1 freq jerkin (1) - 2 freq herin (2) - 2 freq clerkin (2) - 2 freq hermin (2) - 2 freq yorkie (2) - 5 freq beekin (2) - 10 freq derken (2) - 1 freq herein (2) - 7 freq aekin (2) - 1 freq deekin (2) - 2 freq wirkin (2) - 160 freq yirdin (2) - 8 freq kervin (2) - 4 freq harkin (2) - 5 freq merkins (2) - 1 freq |
yerkin (0) - 4 freq yirkin (1) - 1 freq yarkin (1) - 4 freq jerkin (2) - 2 freq berkin (2) - 1 freq reukin (2) - 1 freq reekin (2) - 45 freq yarken (2) - 2 freq reikin (2) - 2 freq herkin (2) - 3 freq yerkit (2) - 3 freq gerkin (2) - 1 freq yeukin (2) - 1 freq werkin (2) - 2 freq merkin (2) - 6 freq yarkit (3) - 2 freq parkin (3) - 16 freq leakin (3) - 12 freq yalkin (3) - 2 freq leukin (3) - 260 freq yakkin (3) - 2 freq reekan (3) - 1 freq keekin (3) - 126 freq warkin (3) - 157 freq yerk (3) - 3 freq |
SoundEx code - Y625 yerkin - 4 freq yarken - 2 freq yirkin - 1 freq yarkin - 4 freq ye-raikin - 1 freq |
MetaPhone code - YRKN yerkin - 4 freq yarken - 2 freq yirkin - 1 freq yarkin - 4 freq ye-raikin - 1 freq |
YERKIN |
| Time to execute Levenshtein function - 0.618227 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.927759 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.079527 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.084326 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.000847 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. |