| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| safter (0) - 9 freq softer (1) - 4 freq saftey (1) - 1 freq lafter (1) - 1 freq dafter (1) - 6 freq safer (1) - 18 freq after (1) - 352 freq rafter (1) - 1 freq saften (1) - 7 freq ifter (2) - 1 freq saftly (2) - 64 freq sasser (2) - 11 freq shifter (2) - 1 freq ajfter (2) - 1 freq afer (2) - 1 freq saftie (2) - 2 freq master (2) - 19 freq safties (2) - 6 freq waiter (2) - 34 freq setter (2) - 4 freq sotter (2) - 34 freq aefter (2) - 4 freq soften (2) - 2 freq saufier (2) - 1 freq swatter (2) - 1 freq |
safter (0) - 9 freq softer (1) - 4 freq after (2) - 352 freq rafter (2) - 1 freq safer (2) - 18 freq saften (2) - 7 freq saftey (2) - 1 freq lafter (2) - 1 freq dafter (2) - 6 freq siffer (3) - 3 freq sauftey (3) - 2 freq seater (3) - 1 freq aifter (3) - 339 freq saifer (3) - 3 freq scoter (3) - 1 freq fayter (3) - 1 freq sitter (3) - 1 freq suffer (3) - 57 freq styter (3) - 3 freq easter (3) - 41 freq slater (3) - 18 freq seatter (3) - 1 freq 'efter (3) - 5 freq snifter (3) - 9 freq satyr (3) - 1 freq |
SoundEx code - S136 safter - 9 freq spider's - 1 freq spider - 30 freq speeder - 16 freq softer - 4 freq spitters - 2 freq spitter - 1 freq speeders - 7 freq shifter - 1 freq spatrils - 1 freq sceptre - 2 freq spiders' - 1 freq subterranean - 3 freq skifters - 2 freq skifter - 4 freq saft-haerted - 1 freq spider-leg - 1 freq spiders - 6 freq speederlike - 1 freq speedery - 2 freq sputtered - 1 freq speeder's - 1 freq speider - 1 freq saft-hertit - 1 freq speeders' - 1 freq speedir - 2 freq subtract - 1 freq saftware - 6 freq spidery - 1 freq spatters - 4 freq spattered - 3 freq saboteurs - 2 freq saftweir - 1 freq spaterson - 6 freq 'spider' - 2 freq 'spiders' - 1 freq 'speddart' - 2 freq spiderlegs - 1 freq subtraction - 1 freq shafttours - 1 freq |
MetaPhone code - SFTR safter - 9 freq softer - 4 freq |
SAFTER |
| Time to execute Levenshtein function - 0.181894 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.319495 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.027103 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.036999 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.000868 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. |