| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| saftly (0) - 64 freq sactly (1) - 1 freq aaftly (1) - 1 freq softly (1) - 12 freq saftey (1) - 1 freq soaftly (1) - 1 freq safely (1) - 41 freq dafty (2) - 29 freq siafty (2) - 1 freq laytly (2) - 1 freq santy (2) - 9 freq saaty (2) - 2 freq saat'y (2) - 1 freq laetly (2) - 2 freq sairly (2) - 28 freq sattlt (2) - 4 freq safety (2) - 61 freq sattl (2) - 1 freq saften (2) - 7 freq saufty (2) - 3 freq satty (2) - 2 freq sagely (2) - 2 freq safter (2) - 9 freq saft (2) - 284 freq saxty (2) - 23 freq |
saftly (0) - 64 freq soaftly (1) - 1 freq softly (1) - 12 freq saftlie (2) - 2 freq safely (2) - 41 freq saftey (2) - 1 freq sactly (2) - 1 freq aaftly (2) - 1 freq saiftay (3) - 1 freq deftly (3) - 1 freq saft (3) - 284 freq saifly (3) - 1 freq sattle (3) - 21 freq saefty (3) - 1 freq sauftey (3) - 2 freq safter (3) - 9 freq swiftly (3) - 11 freq saftie (3) - 2 freq saufly (3) - 1 freq faitly (3) - 2 freq safety (3) - 61 freq siafty (3) - 1 freq saften (3) - 7 freq sattl (3) - 1 freq saufty (3) - 3 freq |
SoundEx code - S134 saftly - 64 freq subtle - 25 freq soaftly - 1 freq spittle - 8 freq spotlight - 4 freq subdolous - 1 freq spotlicht - 2 freq spotlights - 1 freq speedily - 3 freq softly - 12 freq spatula - 2 freq saft-lik - 1 freq spotless - 7 freq saftlie - 2 freq spitals - 1 freq swiftly - 11 freq saftlike - 6 freq softly-softly - 1 freq spot-licht - 1 freq subtlety - 3 freq swift-like - 3 freq saftlins - 1 freq spital - 1 freq 'spotlessly - 1 freq spittled - 1 freq shiftless - 2 freq sawbathlie - 1 freq saft-like - 1 freq spatular - 1 freq spotlicht's - 1 freq subtleties - 1 freq septiles - 16 freq septile - 5 freq spotlieht - 1 freq shiftily - 1 freq spittal - 1 freq spatulate - 1 freq speitel - 1 freq sftliuzcxg - 1 freq |
MetaPhone code - SFTL saftly - 64 freq soaftly - 1 freq softly - 12 freq saftlie - 2 freq sightly - 1 freq |
SAFTLY |
| Time to execute Levenshtein function - 0.193302 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.338721 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.028869 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.048495 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.001095 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. |