| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeekyll (0) - 2 freq jekyll (1) - 14 freq jeelt (3) - 16 freq jean'll (3) - 1 freq jed'll (3) - 1 freq jeelly (3) - 1 freq jerkily (3) - 1 freq jeels (3) - 3 freq weekly (3) - 25 freq jeel (3) - 7 freq reekily (3) - 1 freq yees'll (3) - 2 freq jell (3) - 3 freq reeky (3) - 4 freq meekly (3) - 5 freq weell (3) - 1 freq ee'll (3) - 12 freq feet'll (3) - 2 freq seekly (3) - 1 freq deeky (3) - 1 freq eet'll (3) - 9 freq fee'll (3) - 1 freq bee'll (3) - 2 freq geeky (3) - 2 freq jeely (3) - 46 freq |
jeekyll (0) - 2 freq jekyll (1) - 14 freq jeelyeel (4) - 1 freq jeelly (4) - 1 freq jell (4) - 3 freq jhill (5) - 19 freq kill (5) - 216 freq tkull (5) - 1 freq skull (5) - 45 freq weenell (5) - 8 freq 'ee'll (5) - 1 freq eesell (5) - 1 freq een'll (5) - 3 freq theyll (5) - 5 freq j'll (5) - 3 freq jll (5) - 1 freq jill (5) - 14 freq javell (5) - 1 freq jookle (5) - 2 freq skill (5) - 55 freq kull (5) - 3 freq skeill (5) - 11 freq jelly (5) - 14 freq jklr (5) - 1 freq kell (5) - 1 freq |
SoundEx code - J240 jekyll - 14 freq jougle - 1 freq joogle - 6 freq juickly - 1 freq jeekyll - 2 freq jookle - 2 freq jacquel - 3 freq joogal - 1 freq jackal - 1 freq jajahl - 1 freq juggle - 1 freq joshhall - 1 freq |
MetaPhone code - JKL giggle - 21 freq jekyll - 14 freq jougle - 1 freq joogle - 6 freq geggle - 1 freq geegly - 1 freq juickly - 1 freq jeekyll - 2 freq jookle - 2 freq jql - 1 freq joogal - 1 freq jackal - 1 freq juggle - 1 freq |
JEEKYLL |
| Time to execute Levenshtein function - 0.190170 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.469361 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.029320 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.038137 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.000979 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. |