Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
soaftly (0) - 1 freq softly (1) - 12 freq saftly (1) - 64 freq shoartly (2) - 2 freq safely (2) - 41 freq soaft (2) - 2 freq siafty (2) - 1 freq sactly (2) - 1 freq aaftly (2) - 1 freq swiftly (2) - 12 freq saftey (2) - 1 freq smartly (2) - 5 freq soarely (2) - 1 freq quaitly (3) - 6 freq slatey (3) - 1 freq swaally (3) - 1 freq mostly (3) - 17 freq snaffle (3) - 3 freq slanty (3) - 1 freq saufly (3) - 1 freq scatty (3) - 1 freq shapely (3) - 2 freq softer (3) - 4 freq hoasty (3) - 2 freq hotly (3) - 1 freq |
soaftly (0) - 1 freq saftly (1) - 64 freq softly (1) - 12 freq aaftly (3) - 1 freq swiftly (3) - 12 freq sactly (3) - 1 freq saftey (3) - 1 freq siafty (3) - 1 freq safely (3) - 41 freq saftlie (3) - 2 freq soaft (3) - 2 freq soft (4) - 52 freq saiftay (4) - 1 freq saften (4) - 7 freq saufty (4) - 3 freq skeetly (4) - 1 freq seattle (4) - 3 freq deftly (4) - 1 freq shiftily (4) - 1 freq saefty (4) - 1 freq saifly (4) - 1 freq faitly (4) - 2 freq softie (4) - 3 freq sweetly (4) - 5 freq loftily (4) - 4 freq |
SoundEx code - S134 saftly - 64 freq subtle - 27 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 swiftly - 12 freq subtlety - 4 freq spitals - 1 freq saftlike - 6 freq softly-softly - 1 freq spot-licht - 1 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 |
SOAFTLY |
Time to execute Levenshtein function - 0.226558 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.407673 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.028027 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.038744 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.000886 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. |