| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lirkin (0) - 1 freq larkin (1) - 3 freq lickin (1) - 31 freq lirkit (1) - 7 freq mirkin (1) - 1 freq likin (1) - 38 freq lurkin (1) - 13 freq likkin (1) - 1 freq wirkin (1) - 160 freq linkin (1) - 15 freq yirkin (1) - 1 freq girkin (1) - 1 freq aitkin (2) - 1 freq linin (2) - 10 freq werkin (2) - 2 freq lykin (2) - 2 freq flirtin (2) - 5 freq lik'n (2) - 1 freq linnin (2) - 2 freq gliskin (2) - 5 freq tirin (2) - 4 freq mikin (2) - 1 freq sikin (2) - 2 freq berkin (2) - 1 freq yirkit (2) - 1 freq |
lirkin (0) - 1 freq lurkin (1) - 13 freq larkin (1) - 3 freq linkin (2) - 15 freq girkin (2) - 1 freq wirkin (2) - 160 freq yirkin (2) - 1 freq lurkan (2) - 2 freq likkin (2) - 1 freq lickin (2) - 31 freq lirkit (2) - 7 freq mirkin (2) - 1 freq likin (2) - 38 freq markin (3) - 17 freq licken (3) - 3 freq sarkin (3) - 2 freq lickan (3) - 3 freq warkin (3) - 157 freq lokin (3) - 1 freq mairkin (3) - 6 freq herkin (3) - 3 freq larnin (3) - 27 freq wirkan (3) - 12 freq leakin (3) - 12 freq clarkin (3) - 1 freq |
SoundEx code - L625 lurkin - 13 freq lurgan - 2 freq lurchin - 1 freq larkin - 3 freq lurkan - 2 freq lirkin - 1 freq larsson - 7 freq lurganrebel - 1 freq larkinquotes - 1 freq larceny - 1 freq lrxmvxbjkq - 1 freq |
MetaPhone code - LRKN lurkin - 13 freq lurgan - 2 freq larkin - 3 freq lurkan - 2 freq lirkin - 1 freq |
LIRKIN |
| Time to execute Levenshtein function - 0.300143 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.379519 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.029953 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.040744 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.000885 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. |