| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| suspended (0) - 14 freq suspende (1) - 1 freq suspendet (1) - 3 freq suspense (2) - 3 freq suspenders (2) - 3 freq upended (2) - 1 freq suspected (2) - 7 freq suspend (2) - 3 freq suspendit (2) - 7 freq unsuspended (2) - 1 freq ascended (3) - 1 freq fuspered (3) - 22 freq responded (3) - 4 freq dispensed (3) - 1 freq supponed (3) - 1 freq succeeded (3) - 8 freq surrender (3) - 16 freq suspentit (3) - 1 freq depended (3) - 5 freq expended (3) - 1 freq descended (3) - 6 freq suroonded (3) - 1 freq speeded (3) - 2 freq slender (4) - 9 freq intended (4) - 14 freq |
suspended (0) - 14 freq suspendet (2) - 3 freq suspende (2) - 1 freq unsuspended (3) - 1 freq suspendit (3) - 7 freq suspend (3) - 3 freq suspected (4) - 7 freq responded (4) - 4 freq suspenders (4) - 3 freq suspense (4) - 3 freq upended (4) - 1 freq depended (5) - 5 freq expended (5) - 1 freq suspentit (5) - 1 freq speeded (5) - 2 freq suroonded (5) - 1 freq descended (5) - 6 freq dispensed (5) - 1 freq supponed (5) - 1 freq ascended (5) - 1 freq suspinsien (6) - 1 freq spends (6) - 12 freq rescinded (6) - 1 freq expanded (6) - 3 freq spandex (6) - 1 freq |
SoundEx code - S215 saucepans - 2 freq saucepan - 4 freq sixpence - 7 freq suspended - 14 freq suspension - 9 freq saxophone - 2 freq saxpence - 9 freq sezven - 1 freq saxophin - 1 freq suspinsien - 1 freq suspend - 3 freq saucepins - 1 freq saucepin - 1 freq suspendet - 3 freq suspende - 1 freq saxpenny - 3 freq suspense - 3 freq suspendit - 7 freq suspenders - 3 freq sage-femme - 1 freq €œsaxpence - 1 freq sousafonn - 1 freq sousafon - 1 freq suspentit - 1 freq sycophantic - 1 freq sisyphean - 1 freq sycophancy - 1 freq sexpince - 1 freq suspensions - 2 freq sykvnsgtsw - 1 freq |
MetaPhone code - SSPNTT suspended - 14 freq suspendet - 3 freq suspendit - 7 freq suspentit - 1 freq |
SUSPENDED |
| Time to execute Levenshtein function - 0.210559 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.381237 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.026961 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.036940 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.000799 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. |