| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| joiners (0) - 7 freq joinery (1) - 5 freq joiner (1) - 14 freq jiners (1) - 6 freq pointers (2) - 2 freq dooners (2) - 2 freq loners (2) - 1 freq jines (2) - 2 freq jones (2) - 39 freq owners (2) - 18 freq joined (2) - 47 freq joints (2) - 21 freq jinery (2) - 1 freq jinkers (2) - 1 freq goners (2) - 1 freq joggers (2) - 1 freq jone's (2) - 1 freq liners (2) - 2 freq jotters (2) - 23 freq joinerin (2) - 1 freq wonners (2) - 1 freq jokers (2) - 2 freq jenners (2) - 6 freq corners (2) - 36 freq miners (2) - 41 freq |
joiners (0) - 7 freq jiners (1) - 6 freq jyners (2) - 26 freq joiner (2) - 14 freq joinery (2) - 5 freq miners (3) - 41 freq joins (3) - 9 freq jokers (3) - 2 freq joinerin (3) - 1 freq jine's (3) - 1 freq jenners (3) - 6 freq diners (3) - 1 freq tooners (3) - 1 freq joyner (3) - 1 freq mainers (3) - 2 freq liners (3) - 2 freq jiner (3) - 7 freq jailers (3) - 1 freq owners (3) - 18 freq joints (3) - 21 freq jones (3) - 39 freq jines (3) - 2 freq dooners (3) - 2 freq jinery (3) - 1 freq loners (3) - 1 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 |
JOINERS |
| Time to execute Levenshtein function - 0.239933 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.466833 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.027272 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.037170 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.000803 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. |