| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jendalton (0) - 1 freq renditon (3) - 1 freq dalton (3) - 1 freq fingalton (3) - 3 freq eaton (4) - 1 freq bendan (4) - 1 freq calton (4) - 10 freq endan (4) - 2 freq rendeetion (4) - 1 freq heaton (4) - 1 freq senator (4) - 2 freq fendan (4) - 1 freq beaton (4) - 35 freq rendall (4) - 2 freq dandelion (4) - 4 freq vindaloo (4) - 1 freq renton (4) - 4 freq seaton (4) - 3 freq ten-ton (4) - 1 freq enactin (4) - 1 freq keaton (4) - 1 freq emendation (4) - 2 freq henderson (4) - 48 freq sendan (4) - 3 freq tantallon (4) - 2 freq |
jendalton (0) - 1 freq dalton (5) - 1 freq fingalton (5) - 3 freq renditon (5) - 1 freq rendition (6) - 6 freq dandelion (6) - 4 freq kendlin (6) - 1 freq dolton (6) - 1 freq rendeition (6) - 1 freq undulatin (6) - 1 freq emendation (6) - 2 freq rendeetion (6) - 1 freq sandstone (7) - 6 freq insultin (7) - 3 freq jundyin (7) - 3 freq jowltin (7) - 1 freq foundation (7) - 12 freq middleton (7) - 7 freq condeition (7) - 3 freq consultin (7) - 4 freq kindlin (7) - 5 freq pendant (7) - 1 freq jandlord (7) - 1 freq ventilation (7) - 2 freq inhalation (7) - 2 freq |
SoundEx code - J534 jyntlie - 2 freq jandlord - 1 freq jyntly - 3 freq jentle - 2 freq jenteel - 1 freq jynt-like - 1 freq jeantelfer - 21 freq jendalton - 1 freq |
MetaPhone code - JNTLTN jendalton - 1 freq |
JENDALTON |
| Time to execute Levenshtein function - 0.659484 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 - 1.209484 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.038625 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.164534 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.000989 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. |