| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| suspenders (0) - 3 freq suspende (2) - 1 freq suspended (2) - 14 freq suspendet (2) - 3 freq senders (3) - 1 freq suspend (3) - 3 freq suspendit (3) - 7 freq spencers (3) - 3 freq speeders (3) - 7 freq surrender (3) - 16 freq suspense (3) - 3 freq eastenders (3) - 9 freq stupendous (4) - 1 freq sjksanders (4) - 1 freq suspires (4) - 1 freq suspentit (4) - 1 freq speeders' (4) - 1 freq funders (4) - 1 freq bystanders (4) - 1 freq slanders (4) - 1 freq speers (4) - 7 freq suspected (4) - 7 freq seceders (4) - 1 freq defenders (4) - 8 freq dispenser (4) - 1 freq |
suspenders (0) - 3 freq suspended (4) - 14 freq suspendet (4) - 3 freq suspende (4) - 1 freq speeders (5) - 7 freq suspense (5) - 3 freq spencers (5) - 3 freq eastenders (5) - 9 freq senders (5) - 1 freq suspend (5) - 3 freq suspendit (5) - 7 freq saunders (6) - 2 freq spends (6) - 12 freq sinders (6) - 4 freq swanders (6) - 2 freq islanders (6) - 2 freq spiders (6) - 6 freq spunder (6) - 1 freq sounders (6) - 2 freq spankers (6) - 2 freq spanners (6) - 5 freq suspensions (6) - 2 freq schinders (6) - 1 freq punders (6) - 2 freq ponders (6) - 3 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 - SSPNTRS suspenders - 3 freq |
SUSPENDERS |
| Time to execute Levenshtein function - 0.230551 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.409906 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.029134 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.036970 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.000913 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. |