Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ootsized (0) - 1 freq ootsize (1) - 1 freq ootsiyd (2) - 1 freq ootsider (2) - 8 freq ootsite (2) - 1 freq ootlined (2) - 7 freq ootside (2) - 635 freq obtained (3) - 1 freq tootsies (3) - 2 freq ootspreid (3) - 1 freq oosie (3) - 3 freq cotside (3) - 1 freq ootraged (3) - 2 freq gossiped (3) - 1 freq oosed (3) - 1 freq outside (3) - 87 freq ootgie (3) - 5 freq ootlines (3) - 6 freq bosied (3) - 7 freq ootdside (3) - 1 freq lopsided (3) - 1 freq noticed (3) - 227 freq ooted (3) - 1 freq doonsize (3) - 1 freq ootsiders (3) - 4 freq |
ootsized (0) - 1 freq ootsize (2) - 1 freq ootsiyd (3) - 1 freq ootside (3) - 635 freq ootsyde (4) - 4 freq sized (4) - 13 freq outside (4) - 87 freq tized (4) - 5 freq toosied (4) - 1 freq ootlined (4) - 7 freq ootsite (4) - 1 freq ootsider (4) - 8 freq capsized (5) - 3 freq oversized (5) - 4 freq ootspreid (5) - 1 freq ootshine (5) - 3 freq oozed (5) - 1 freq outsides (5) - 2 freq ootwaled (5) - 1 freq tossed (5) - 20 freq tousled (5) - 1 freq toasted (5) - 3 freq ootisde (5) - 1 freq seized (5) - 6 freq outlined (5) - 1 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 - OTSST ootsized - 1 freq |
OOTSIZED |
Time to execute Levenshtein function - 0.232113 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.352811 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.027522 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.037064 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.000898 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. |