| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ootsize (0) - 1 freq ootside (1) - 617 freq ootsized (1) - 1 freq ootsite (1) - 1 freq oossie (2) - 1 freq oosie (2) - 3 freq outside (2) - 87 freq ootsyde (2) - 4 freq ootsiyd (2) - 1 freq ootsider (2) - 8 freq ootdside (2) - 1 freq ootgie (2) - 5 freq ootline (2) - 14 freq cotside (2) - 1 freq doonsize (2) - 1 freq ootshine (2) - 3 freq poesie (3) - 13 freq oots (3) - 22 freq offside (3) - 3 freq ootwale (3) - 3 freq tousie (3) - 11 freq donside (3) - 4 freq ootcome (3) - 47 freq fowsie (3) - 2 freq hoosie (3) - 71 freq |
ootsize (0) - 1 freq ootsite (2) - 1 freq ootsized (2) - 1 freq ootside (2) - 617 freq ootsyde (3) - 4 freq outside (3) - 87 freq ootsiyd (3) - 1 freq tize (4) - 4 freq bitesize (4) - 1 freq ootz (4) - 1 freq toosie (4) - 2 freq size (4) - 293 freq assize (4) - 1 freq tousie (4) - 11 freq tosie (4) - 4 freq outsyde (4) - 2 freq ootisde (4) - 1 freq ootset (4) - 15 freq ootdside (4) - 1 freq ootsider (4) - 8 freq ootgie (4) - 5 freq doonsize (4) - 1 freq ootline (4) - 14 freq cotside (4) - 1 freq oosie (4) - 3 freq |
SoundEx code - O322 ootguessed - 1 freq ootweighs - 1 freq ootgies - 1 freq ootcasts - 1 freq oot-hooses - 1 freq odoake's - 1 freq ootsized - 1 freq outcast - 2 freq ootsize - 1 freq ootcast - 2 freq oatcakes - 22 freq odysseus - 5 freq oothooses - 3 freq oatcake - 1 freq outhouses - 1 freq ottojizzmark - 1 freq oeidsus - 1 freq |
MetaPhone code - OTSS ootsize - 1 freq odysseus - 5 freq ottzs - 1 freq oeidsus - 1 freq |
OOTSIZE |
| Time to execute Levenshtein function - 0.202172 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.387172 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.031095 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.037566 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.000823 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. |