| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| super-heroes (0) - 2 freq superheroes (1) - 2 freq snperheroes (2) - 1 freq superhero (3) - 3 freq 'superheroes' (3) - 1 freq superheros (3) - 1 freq superstores (4) - 2 freq snperhero (4) - 2 freq supermairkets (5) - 2 freq supermercats (5) - 1 freq supernoodles (5) - 1 freq spheres (5) - 17 freq smert-erses (5) - 1 freq luve-herts (5) - 1 freq superfluous (5) - 1 freq supermarkets (5) - 12 freq sumwheres (5) - 1 freq murtherous (5) - 1 freq supervises (5) - 1 freq superseded (5) - 2 freq superstore (5) - 3 freq supermarket (5) - 20 freq superhet (5) - 1 freq supper-room (5) - 1 freq superpowers (5) - 1 freq |
super-heroes (0) - 2 freq superheroes (2) - 2 freq snperheroes (4) - 1 freq superhero (5) - 3 freq superstores (6) - 2 freq superheros (6) - 1 freq 'superheroes' (6) - 1 freq superpowers (7) - 1 freq superpooers (7) - 1 freq superstars (7) - 1 freq spheres (7) - 17 freq superiors (7) - 2 freq snperhero (7) - 2 freq super-duper (8) - 1 freq superwhite (8) - 2 freq spheris (8) - 1 freq superlatives (8) - 1 freq puir-hous (8) - 1 freq sair-erse (8) - 1 freq sparraes (8) - 1 freq sparklers (8) - 2 freq sapphires (8) - 2 freq somewheres (8) - 1 freq surgeries (8) - 1 freq supervises (8) - 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 - SPRHRS superheroes - 2 freq super-heroes - 2 freq 'superheroes' - 1 freq superheros - 1 freq |
SUPER-HEROES |
| Time to execute Levenshtein function - 0.235862 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.362031 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.027778 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.037018 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.000922 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. |