| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jinery (0) - 1 freq joinery (1) - 5 freq jiner (1) - 7 freq jiners (1) - 6 freq finery (1) - 5 freq jynery (1) - 1 freq siner (2) - 1 freq jinky (2) - 5 freq joiners (2) - 7 freq joiner (2) - 14 freq jinny (2) - 28 freq ninety (2) - 33 freq intry (2) - 3 freq jine's (2) - 1 freq jyners (2) - 26 freq liners (2) - 2 freq inert (2) - 3 freq kinely (2) - 4 freq liner (2) - 4 freq gintry (2) - 1 freq wintery (2) - 5 freq livery (2) - 13 freq ainer (2) - 2 freq jined (2) - 38 freq ainerly (2) - 2 freq |
jinery (0) - 1 freq jynery (1) - 1 freq jiner (1) - 7 freq joinery (1) - 5 freq joiner (2) - 14 freq jyner (2) - 30 freq jiners (2) - 6 freq finery (2) - 5 freq jinty (3) - 6 freq binary (3) - 4 freq miner (3) - 6 freq diner (3) - 1 freq finer (3) - 14 freq jantry (3) - 1 freq jine (3) - 37 freq jnr (3) - 1 freq hinry (3) - 1 freq henery (3) - 1 freq einer (3) - 1 freq jined (3) - 38 freq jines (3) - 2 freq january (3) - 66 freq janey (3) - 10 freq jinker (3) - 2 freq siner (3) - 1 freq |
SoundEx code - J560 jyner - 30 freq jiner - 7 freq joiner - 14 freq januar - 34 freq january - 66 freq jnr - 1 freq junior - 30 freq joinery - 5 freq janwerry - 1 freq janwar - 2 freq jynery - 1 freq jinery - 1 freq €˜januar - 1 freq jimmer - 5 freq jimmoray - 1 freq joyner - 1 freq joemurray - 1 freq |
MetaPhone code - JNR jyner - 30 freq jiner - 7 freq joiner - 14 freq januar - 34 freq january - 66 freq jnr - 1 freq genre - 9 freq junior - 30 freq gener - 1 freq joinery - 5 freq geynear - 2 freq jynery - 1 freq jinery - 1 freq gey-near - 1 freq €˜januar - 1 freq joyner - 1 freq |
JINERY |
| Time to execute Levenshtein function - 0.194983 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.344880 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.027718 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.037104 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.000800 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. |