| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| juniors (0) - 16 freq junior (1) - 30 freq bunions (2) - 2 freq janitors (2) - 2 freq jurors (2) - 24 freq unions (2) - 8 freq seniors (2) - 1 freq jurie's (3) - 1 freq jenners (3) - 6 freq sensors (3) - 1 freq censors (3) - 1 freq jumbos (3) - 3 freq unis (3) - 3 freq junipere (3) - 15 freq bunion (3) - 1 freq senior (3) - 40 freq jinkers (3) - 1 freq duncers (3) - 5 freq hunkers (3) - 11 freq hunders (3) - 25 freq uniforms (3) - 12 freq bunkers (3) - 12 freq minors (3) - 1 freq nibors (3) - 2 freq funders (3) - 1 freq |
juniors (0) - 16 freq junior (2) - 30 freq seniors (3) - 1 freq jyners (3) - 26 freq jurors (3) - 24 freq jiners (3) - 6 freq janitors (3) - 2 freq donors (4) - 1 freq junkies (4) - 9 freq jonsars (4) - 3 freq minors (4) - 1 freq ejurors (4) - 1 freq jinkers (4) - 1 freq joiners (4) - 7 freq deniers (4) - 4 freq wunorse (4) - 2 freq juries (4) - 1 freq unions (4) - 8 freq bunions (4) - 2 freq junes (4) - 1 freq jenners (4) - 6 freq tenors (4) - 1 freq june's (4) - 2 freq munros (4) - 1 freq snores (5) - 6 freq |
SoundEx code - J562 jyners' - 3 freq jyners - 26 freq joiners - 7 freq jyner's - 5 freq jiners - 6 freq juniors - 16 freq jenners - 6 freq jenners' - 1 freq jonar's - 1 freq johnmarshall - 2 freq |
MetaPhone code - JNRS jyners' - 3 freq jyners - 26 freq joiners - 7 freq jyner's - 5 freq generous - 21 freq jiners - 6 freq juniors - 16 freq jenners - 6 freq genres - 13 freq jenners' - 1 freq jonar's - 1 freq |
JUNIORS |
| Time to execute Levenshtein function - 0.243874 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.341918 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.029288 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.040476 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.001189 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. |