| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| superiors (0) - 2 freq superior (1) - 23 freq superstars (3) - 1 freq specious (3) - 2 freq emperors (3) - 2 freq superpooers (3) - 1 freq saerious (3) - 1 freq seniors (3) - 2 freq superpowers (3) - 1 freq supernova (3) - 1 freq superoid (3) - 1 freq querious (3) - 2 freq sperins (3) - 1 freq periods (3) - 17 freq supervises (3) - 1 freq serious (3) - 154 freq supernovas (3) - 1 freq superiority (3) - 4 freq suppliers (3) - 6 freq superstore (3) - 3 freq speris (3) - 1 freq superfoam (3) - 1 freq 'periods (3) - 1 freq speirs (3) - 68 freq superstores (3) - 2 freq |
superiors (0) - 2 freq superior (2) - 23 freq speirs (4) - 68 freq suprises (4) - 1 freq superiority (4) - 4 freq speirars (4) - 8 freq sperins (4) - 1 freq spurious (4) - 2 freq speris (4) - 1 freq superpooers (4) - 1 freq emperors (4) - 2 freq sprigs (5) - 1 freq spears (5) - 28 freq speikers (5) - 46 freq superheroes (5) - 2 freq spheirs (5) - 1 freq sprots (5) - 2 freq speerits (5) - 19 freq supervise (5) - 3 freq spaekirs (5) - 1 freq sprites (5) - 2 freq spheris (5) - 1 freq sprieds (5) - 1 freq suppers (5) - 22 freq caperers (5) - 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 - SPRRS superiors - 2 freq speirars - 8 freq |
SUPERIORS |
| Time to execute Levenshtein function - 0.275143 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.470066 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.035709 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.043595 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.001313 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. |