| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jerk (0) - 8 freq jerkt (1) - 1 freq uerk (1) - 1 freq verk (1) - 2 freq merk (1) - 63 freq berk (1) - 3 freq jirk (1) - 1 freq jeuk (1) - 1 freq jeck (1) - 16 freq serk (1) - 3 freq herk (1) - 3 freq jerks (1) - 2 freq perk (1) - 28 freq jer (1) - 1 freq werk (1) - 8 freq jek (1) - 1 freq derk (1) - 106 freq yerk (1) - 3 freq erk (1) - 5 freq terk (1) - 1 freq derf (2) - 2 freq cark (2) - 6 freq jura (2) - 3 freq oer (2) - 238 freq jets (2) - 5 freq |
jerk (0) - 8 freq jirk (1) - 1 freq werk (2) - 8 freq perk (2) - 28 freq jer (2) - 1 freq derk (2) - 106 freq terk (2) - 1 freq yerk (2) - 3 freq jerks (2) - 2 freq jek (2) - 1 freq erk (2) - 5 freq verk (2) - 2 freq jerkt (2) - 1 freq herk (2) - 3 freq merk (2) - 63 freq uerk (2) - 1 freq serk (2) - 3 freq jeck (2) - 16 freq jeuk (2) - 1 freq berk (2) - 3 freq park (3) - 426 freq sark (3) - 124 freq jerket (3) - 1 freq lark (3) - 24 freq wark (3) - 903 freq |
SoundEx code - J620 jaurs - 15 freq jersey - 22 freq jerries - 11 freq jeers - 1 freq jerk - 8 freq jars - 21 freq jerks - 2 freq jrish - 1 freq jairus's - 2 freq jairus - 3 freq jericho - 9 freq jirg - 2 freq jauries - 2 freq jarr's - 1 freq jurie's - 1 freq jaírus's - 1 freq jaírus - 2 freq jours - 1 freq jawrs - 1 freq jorg - 1 freq jörg - 1 freq jirk - 1 freq jrc - 1 freq joris - 1 freq jury's - 1 freq jcrg - 1 freq juries - 1 freq joryg - 1 freq jerriais - 1 freq |
MetaPhone code - JRK jerk - 8 freq jirg - 2 freq giric - 1 freq jorg - 1 freq jörg - 1 freq jirk - 1 freq jrc - 1 freq 'georg - 1 freq joryg - 1 freq |
JERK |
| Time to execute Levenshtein function - 0.216944 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.318971 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.029081 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.036882 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.000907 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. |