Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
spottet (0) - 4 freq spotted (1) - 41 freq spottit (1) - 24 freq spottin (2) - 4 freq sortet (2) - 4 freq stotter (2) - 11 freq shoutet (2) - 54 freq stotted (2) - 8 freq spitten (2) - 1 freq spotty (2) - 3 freq spitter (2) - 1 freq shotten (2) - 4 freq stottert (2) - 8 freq snortet (2) - 1 freq pattet (2) - 2 freq spittit (2) - 2 freq slotted (2) - 2 freq spoatted (2) - 1 freq stottit (2) - 12 freq rottet (2) - 1 freq potter (2) - 29 freq stoatet (2) - 1 freq potted (2) - 4 freq spottie (2) - 1 freq scottyt (2) - 1 freq |
spottet (0) - 4 freq spottit (1) - 24 freq spotted (2) - 41 freq spittit (2) - 2 freq pattet (3) - 2 freq slottit (3) - 2 freq stoatet (3) - 1 freq spoatted (3) - 1 freq stottit (3) - 12 freq spottie (3) - 1 freq pottit (3) - 3 freq spotty (3) - 3 freq spottin (3) - 4 freq spitter (3) - 1 freq scottyt (3) - 1 freq spitten (3) - 1 freq shuttit (4) - 1 freq splatt (4) - 1 freq sprittit (4) - 1 freq sattit (4) - 1 freq scuttit (4) - 2 freq stoatit (4) - 3 freq spartit (4) - 2 freq sprott (4) - 1 freq spoattin (4) - 1 freq |
SoundEx code - S133 spottit - 24 freq shiftit - 33 freq subdued - 5 freq schiftit - 1 freq spotted - 41 freq shifted - 18 freq spooted - 1 freq sappie-heidit - 4 freq sifted - 1 freq spottet - 4 freq speeded - 2 freq saft-white - 1 freq spoated - 1 freq shafted - 7 freq spoatted - 1 freq 'spat-the-dummy - 1 freq spittit - 2 freq shiftied - 1 freq sub-title - 1 freq speedit - 6 freq scabby-heidit - 1 freq scabbie-heidit - 1 freq subteetle - 1 freq saft-heidit - 1 freq siftit - 1 freq subdit - 1 freq sub-titles - 1 freq subtitled - 3 freq subtitling - 1 freq subtitles - 4 freq 'shafted - 1 freq spouted - 1 freq shuftie-watchin - 1 freq |
MetaPhone code - SPTT spottit - 24 freq spotted - 41 freq spooted - 1 freq spottet - 4 freq speeded - 2 freq spoated - 1 freq spoatted - 1 freq spittit - 2 freq speedit - 6 freq spouted - 1 freq |
SPOTTET |
Time to execute Levenshtein function - 0.427568 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.514582 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.033919 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.043921 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.001173 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. |