| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| saftware (0) - 6 freq sartre (3) - 1 freq satyre (3) - 1 freq safter (3) - 10 freq safari (3) - 2 freq saftweir (3) - 1 freq aware (3) - 61 freq tartare (3) - 1 freq saftlie (3) - 2 freq saltwater (3) - 1 freq hattare (3) - 10 freq afoare (3) - 1 freq saltire (3) - 43 freq safeway (3) - 3 freq saftlike (3) - 6 freq luftwafe (3) - 1 freq sarwar (3) - 3 freq satire (3) - 15 freq safeways (3) - 1 freq atward (3) - 1 freq liftwart (3) - 1 freq stare (3) - 71 freq malcware (3) - 1 freq saftie (3) - 2 freq atwart (3) - 6 freq |
saftware (0) - 6 freq saftweir (3) - 1 freq safter (4) - 10 freq stare (5) - 71 freq liftwart (5) - 1 freq sarwar (5) - 3 freq safeways (5) - 1 freq satire (5) - 15 freq liftward (5) - 1 freq softer (5) - 4 freq sware (5) - 1 freq saltyre (5) - 4 freq luftwafe (5) - 1 freq eastward (5) - 2 freq saftie (5) - 2 freq safari (5) - 2 freq satyre (5) - 1 freq saftlike (5) - 6 freq saltwater (5) - 1 freq saftlie (5) - 2 freq saltire (5) - 43 freq sartre (5) - 1 freq safeway (5) - 3 freq safer (6) - 18 freq scotarea (6) - 1 freq |
SoundEx code - S136 safter - 10 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 - SFTWR saftware - 6 freq saftweir - 1 freq |
SAFTWARE |
| Time to execute Levenshtein function - 0.207476 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.346030 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.027728 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.037762 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.000964 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. |