| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| suspense (0) - 3 freq suspende (1) - 1 freq suspend (2) - 3 freq suspended (2) - 14 freq suspendet (2) - 3 freq suppers (3) - 22 freq tuppence (3) - 14 freq surpreese (3) - 11 freq spence (3) - 35 freq suspenders (3) - 3 freq saxpence (3) - 10 freq susanne (3) - 1 freq suppone (3) - 12 freq suspension (3) - 9 freq surpreise (3) - 6 freq sense (3) - 527 freq sperse (3) - 1 freq suspect (3) - 22 freq spens (3) - 7 freq suspects (3) - 4 freq fuspers (3) - 1 freq disperse (3) - 3 freq suppose (3) - 267 freq busens (3) - 1 freq surprise (3) - 210 freq |
suspense (0) - 3 freq suspende (2) - 1 freq suspend (3) - 3 freq suspinsien (4) - 1 freq serpens (4) - 2 freq suspension (4) - 9 freq spens (4) - 7 freq suspendet (4) - 3 freq suspended (4) - 14 freq response (4) - 47 freq dispenses (5) - 1 freq dispenser (5) - 1 freq appense (5) - 1 freq sypins (5) - 2 freq suspeck (5) - 4 freq suspendit (5) - 7 freq suspentit (5) - 1 freq distense (5) - 1 freq pense (5) - 3 freq dispensed (5) - 1 freq suspek (5) - 2 freq speuns (5) - 1 freq sapiens (5) - 2 freq siskins (5) - 2 freq spins (5) - 10 freq |
SoundEx code - S215 saucepans - 2 freq saucepan - 4 freq sixpence - 7 freq suspended - 14 freq suspension - 9 freq saxophone - 2 freq saxpence - 10 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 - SSPNS saucepans - 2 freq saucepins - 1 freq suspense - 3 freq |
SUSPENSE |
| Time to execute Levenshtein function - 0.390538 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.763627 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.032366 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.091199 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.000944 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. |