| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jenners (0) - 6 freq menners (1) - 2 freq jenners' (1) - 1 freq denners (1) - 11 freq tenners (1) - 4 freq henners (1) - 1 freq jesters (2) - 2 freq tenner (2) - 25 freq jennies (2) - 2 freq fenders (2) - 1 freq dinners (2) - 14 freq wanners (2) - 3 freq winners (2) - 30 freq deniers (2) - 4 freq kennels (2) - 5 freq wonners (2) - 1 freq denner's (2) - 1 freq vennels (2) - 12 freq kjenner (2) - 1 freq jenny's (2) - 5 freq lenders (2) - 1 freq senders (2) - 1 freq henner (2) - 3 freq renders (2) - 2 freq bennels (2) - 1 freq |
jenners (0) - 6 freq tenners (2) - 4 freq denners (2) - 11 freq henners (2) - 1 freq menners (2) - 2 freq jenners' (2) - 1 freq jiners (3) - 6 freq jinkers (3) - 1 freq fanners (3) - 1 freq runners (3) - 9 freq cinners (3) - 4 freq tanners (3) - 4 freq manners (3) - 17 freq jenna's (3) - 2 freq jennie's (3) - 1 freq jyners (3) - 26 freq jenny's (3) - 5 freq mennirs (3) - 1 freq sanners (3) - 2 freq gunners (3) - 1 freq hunners (3) - 211 freq dinners (3) - 14 freq jennies (3) - 2 freq joiners (3) - 7 freq sinners (3) - 8 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 |
JENNERS |
| Time to execute Levenshtein function - 0.256321 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.381740 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.028988 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.040218 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.001229 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. |