| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| superiority (0) - 4 freq inferiority (3) - 5 freq seniority (3) - 1 freq superiors (3) - 2 freq priority (3) - 25 freq superior (3) - 23 freq speirits (4) - 10 freq sperrit (4) - 2 freq superwhite (4) - 2 freq curiosity (4) - 34 freq speciality (4) - 1 freq spirity (4) - 1 freq sterility (4) - 1 freq superoid (4) - 1 freq speirit (4) - 20 freq keeriosity (4) - 1 freq severity (5) - 4 freq surroonit (5) - 1 freq supports (5) - 21 freq speir't (5) - 1 freq sprootit (5) - 3 freq superpowers (5) - 1 freq duplicity (5) - 2 freq supermarket (5) - 20 freq supportit (5) - 39 freq |
superiority (0) - 4 freq superior (4) - 23 freq priority (4) - 25 freq sperrit (4) - 2 freq superiors (4) - 2 freq spirity (5) - 1 freq inferiority (5) - 5 freq speirit (5) - 20 freq seniority (5) - 1 freq speiritie (6) - 2 freq speirt (6) - 346 freq sepirit (6) - 1 freq sporty (6) - 3 freq speiritit (6) - 1 freq supervet (6) - 1 freq superhet (6) - 1 freq speeritit (6) - 1 freq seperait (6) - 1 freq spirit (6) - 95 freq support (6) - 341 freq spiritit (6) - 1 freq speerit (6) - 103 freq sprootit (6) - 3 freq speciality (6) - 1 freq speir't (6) - 1 freq |
SoundEx code - S166 superiority - 4 freq superiors - 2 freq superior - 23 freq superheroes - 2 freq seafairer's - 2 freq speirars - 8 freq sprayer's - 1 freq sprerit-lamp - 1 freq seafarers' - 1 freq sea-farers - 1 freq speirar - 1 freq speirer - 2 freq sufferers - 1 freq super-heroes - 2 freq 'superheroes' - 1 freq superhero - 3 freq sufferer - 1 freq saveourairports - 2 freq superheros - 1 freq |
MetaPhone code - SPRRT superiority - 4 freq |
SUPERIORITY |
| Time to execute Levenshtein function - 0.245251 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.379261 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.029362 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.038675 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.000955 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. |