| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lurkin (0) - 13 freq lurkan (1) - 2 freq lukkin (1) - 61 freq luikin (1) - 201 freq larkin (1) - 3 freq wurkin (1) - 22 freq luckin (1) - 16 freq lukin (1) - 52 freq lirkin (1) - 1 freq rudkin (2) - 2 freq pursin (2) - 1 freq murrin (2) - 1 freq lykin (2) - 2 freq surgin (2) - 2 freq mirkin (2) - 1 freq burpin (2) - 1 freq lirkit (2) - 7 freq surfin (2) - 1 freq gurnin (2) - 6 freq gurlin (2) - 4 freq ludgin (2) - 7 freq lukkan (2) - 49 freq wurken (2) - 8 freq fukin (2) - 1 freq lukkit (2) - 6 freq |
lurkin (0) - 13 freq lirkin (1) - 1 freq lurkan (1) - 2 freq larkin (1) - 3 freq lukin (2) - 52 freq luckin (2) - 16 freq luikin (2) - 201 freq lukkin (2) - 61 freq wurkin (2) - 22 freq leukkin (3) - 12 freq leukin (3) - 260 freq yarkin (3) - 4 freq lakin (3) - 1 freq lurkt (3) - 1 freq lurks (3) - 6 freq clerkin (3) - 2 freq werkin (3) - 2 freq lurked (3) - 4 freq lankin (3) - 1 freq lourin (3) - 8 freq sarkin (3) - 2 freq lukan (3) - 5 freq lokin (3) - 1 freq harkin (3) - 5 freq herkin (3) - 3 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.242730 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.472809 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.031092 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.038776 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.001041 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. |