| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jamthrawn (0) - 1 freq athraw (3) - 1 freq thrawn (3) - 1 freq thrawn (3) - 109 freq 'thrawn (3) - 2 freq backthrawn (3) - 1 freq jamphin (4) - 1 freq 'thrawn' (4) - 1 freq withdrawn (4) - 2 freq cathrin (4) - 1 freq asthray (4) - 3 freq samhradh (4) - 2 freq patteran (4) - 3 freq thrown (4) - 43 freq thraan (4) - 12 freq alteran (4) - 1 freq gatheran (4) - 2 freq cateran (4) - 3 freq cataran (4) - 1 freq win-thrawn (4) - 1 freq gaitheran (4) - 2 freq jamaican (4) - 13 freq anthrax (4) - 2 freq bahrain (4) - 1 freq gaetheran (4) - 3 freq |
jamthrawn (0) - 1 freq 'thrawn (5) - 2 freq thrawn (5) - 109 freq thrawn (5) - 1 freq ice-thrawn (6) - 1 freq thrown (6) - 43 freq owerthrawn (6) - 1 freq backthrawn (6) - 1 freq thrawin (6) - 17 freq athraw (6) - 1 freq kathryn (7) - 1 freq strawn (7) - 1 freq jamtarts (7) - 4 freq thraws (7) - 14 freq thraw (7) - 45 freq throwen (7) - 1 freq throwan (7) - 4 freq juntherin (7) - 3 freq throwin (7) - 34 freq owerthrewn (7) - 1 freq thran (7) - 22 freq gaetheran (7) - 3 freq gaithrin (7) - 2 freq thrain (7) - 1 freq gatheran (7) - 2 freq |
SoundEx code - J536 janitors - 2 freq janitor - 6 freq jondrew - 2 freq juntherin - 3 freq jantry - 1 freq jimtheregular - 2 freq jskinnider - 2 freq jamtarts - 4 freq johndeere - 3 freq joyhendry - 3 freq jimwaterson - 11 freq jamthrawn - 1 freq |
MetaPhone code - JM0RN jamthrawn - 1 freq |
JAMTHRAWN |
| Time to execute Levenshtein function - 0.352677 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.608074 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.049159 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.076222 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.001151 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. |