| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| speirer (0) - 2 freq speiker (1) - 15 freq speired (1) - 288 freq speirar (1) - 1 freq speires (1) - 1 freq speider (1) - 1 freq speir't (2) - 1 freq spencer (2) - 16 freq speer (2) - 21 freq speller (2) - 2 freq steiver (2) - 1 freq shearer (2) - 4 freq speirin (2) - 166 freq spenser (2) - 1 freq speirs (2) - 68 freq spiker (2) - 1 freq speirit (2) - 20 freq speirars (2) - 8 freq seerer (2) - 1 freq speikers (2) - 46 freq spider (2) - 30 freq speered (2) - 46 freq spire (2) - 5 freq speir (2) - 214 freq speaker (2) - 65 freq |
speirer (0) - 2 freq speirar (1) - 1 freq speiker (2) - 15 freq speires (2) - 1 freq speider (2) - 1 freq speired (2) - 288 freq shuirer (3) - 1 freq skairer (3) - 1 freq speared (3) - 5 freq speir' (3) - 1 freq speaker (3) - 65 freq steerer (3) - 2 freq puirer (3) - 6 freq speeder (3) - 16 freq spier (3) - 42 freq speikar (3) - 1 freq steurer (3) - 1 freq shairer (3) - 1 freq speir (3) - 214 freq speirt (3) - 346 freq speiran (3) - 7 freq spires (3) - 2 freq sairer (3) - 6 freq spiker (3) - 1 freq speirin (3) - 166 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 - SPRR superior - 23 freq speirar - 1 freq speirer - 2 freq |
SPEIRER |
| Time to execute Levenshtein function - 0.598039 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.176074 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.094928 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.109014 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.001172 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. |