| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lurkin (0) - 13 freq larkin (1) - 3 freq lirkin (1) - 1 freq lukin (1) - 52 freq lukkin (1) - 61 freq luckin (1) - 16 freq lurkan (1) - 2 freq luikin (1) - 201 freq wurkin (1) - 21 freq lukin' (2) - 4 freq hurtin (2) - 17 freq lykin (2) - 2 freq cursin (2) - 23 freq lurchin (2) - 1 freq nutkin (2) - 1 freq luttin (2) - 8 freq warkin (2) - 156 freq clerkin (2) - 2 freq leukin (2) - 256 freq sarkin (2) - 2 freq hurkil (2) - 1 freq lickin (2) - 31 freq lumpin (2) - 1 freq bulkin (2) - 1 freq furin (2) - 1 freq |
lurkin (0) - 13 freq larkin (1) - 3 freq lirkin (1) - 1 freq lurkan (1) - 2 freq wurkin (2) - 21 freq luikin (2) - 201 freq luckin (2) - 16 freq lukkin (2) - 61 freq lukin (2) - 52 freq clarkin (3) - 1 freq larnin (3) - 27 freq lurk (3) - 2 freq herkin (3) - 3 freq lirkit (3) - 7 freq wurken (3) - 8 freq lakin (3) - 1 freq wurkan (3) - 2 freq likkin (3) - 1 freq lurkt (3) - 1 freq mirkin (3) - 1 freq workin (3) - 178 freq lukkan (3) - 49 freq markin (3) - 17 freq berkin (3) - 1 freq gerkin (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 |
LURKIN |
| Time to execute Levenshtein function - 0.371761 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.776927 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.028752 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.073346 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.000868 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. |