| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jimp-like (0) - 1 freq wirm-like (3) - 1 freq soup-like (3) - 1 freq ivy-like (3) - 1 freq kin-like (3) - 1 freq firm-like (3) - 1 freq joco-like (3) - 1 freq jynt-like (3) - 1 freq sic-like (3) - 11 freq tramp-like (3) - 1 freq impolite (3) - 1 freq nippy-like (3) - 3 freq bird-like (3) - 1 freq some-like (3) - 1 freq wise-like (3) - 3 freq sik-like (3) - 2 freq simplie (3) - 1 freq wice-like (3) - 3 freq dowf-like (4) - 2 freq slaw-like (4) - 1 freq impulsive (4) - 1 freq wyce-like (4) - 15 freq hulk-like (4) - 1 freq saft-like (4) - 1 freq bird-lik (4) - 1 freq |
jimp-like (0) - 1 freq tramp-like (5) - 1 freq nippy-like (5) - 3 freq some-like (5) - 1 freq joco-like (5) - 1 freq jynt-like (5) - 1 freq soup-like (5) - 1 freq maze-like (6) - 1 freq abrup-like (6) - 1 freq wice-like (6) - 3 freq joco-lik (6) - 3 freq caum-like (6) - 1 freq simplie (6) - 1 freq meek-like (6) - 1 freq lamp-lit (6) - 1 freq same-lyke (6) - 1 freq sik-like (6) - 2 freq firm-like (6) - 1 freq kin-like (6) - 1 freq ivy-like (6) - 1 freq wirm-like (6) - 1 freq impolite (6) - 1 freq sic-like (6) - 11 freq bird-like (6) - 1 freq wise-like (6) - 3 freq |
SoundEx code - J514 jean-paul - 5 freq jumblt - 1 freq jumbles - 1 freq john-paul - 1 freq jumbelt - 1 freq jumbled - 2 freq jimp-like - 1 freq jumble-sale - 1 freq jimmypaul - 1 freq johnpaulwhearty - 1 freq jenblacker - 1 freq 'jamphlars' - 1 freq jimmfelton - 2 freq jonpulley - 1 freq johnpaulburton - 1 freq jeanfeeld - 2 freq jamiefluff - 8 freq jeanfeel - 1 freq johnpaulmarney - 1 freq |
MetaPhone code - JMPLK jimp-like - 1 freq |
JIMP-LIKE |
| Time to execute Levenshtein function - 0.326673 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.623987 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.063674 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.037456 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.000887 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. |