| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oot-hoose (0) - 1 freq oothoose (1) - 10 freq oot-hooses (1) - 1 freq nort-hoose (2) - 1 freq coort-hoose (2) - 1 freq het-hoose (2) - 1 freq oothooses (2) - 3 freq hethoose (3) - 1 freq monkhoose (3) - 1 freq fut-loose (3) - 1 freq haa-hoose (3) - 1 freq in-hoose (3) - 2 freq hen-hoose (3) - 13 freq pooerhoose (3) - 1 freq pig-hoose (3) - 1 freq cathoose (3) - 1 freq o'those (3) - 1 freq oot-come (3) - 1 freq hothooses (3) - 1 freq coalhoose (3) - 3 freq townhoose (3) - 1 freq tea-hoose (3) - 1 freq oot-owre (3) - 1 freq cot-hous (3) - 2 freq scotshoose (3) - 1 freq |
oot-hoose (0) - 1 freq oot-hooses (2) - 1 freq oothoose (2) - 10 freq tea-hoose (3) - 1 freq het-hoose (3) - 1 freq in-hoose (4) - 2 freq cot-hous (4) - 2 freq haa-hoose (4) - 1 freq oothooses (4) - 3 freq nort-hoose (4) - 1 freq coort-hoose (4) - 1 freq aitin-hoose (5) - 1 freq keb-hoose (5) - 1 freq oot-hauds (5) - 1 freq in-house (5) - 1 freq treehoose (5) - 3 freq townhoose (5) - 1 freq those (5) - 296 freq torhouse (5) - 1 freq oot-owre (5) - 1 freq pooerhoose (5) - 1 freq pig-hoose (5) - 1 freq coalhoose (5) - 3 freq hen-hoose (5) - 13 freq fut-loose (5) - 1 freq |
SoundEx code - O320 ots - 2 freq odds - 91 freq odyssey - 6 freq oots - 23 freq oidhche - 1 freq odes - 5 freq oats - 37 freq oats' - 1 freq outch - 1 freq oothoose - 10 freq ootz - 1 freq ootac - 1 freq o't's - 2 freq oaths - 3 freq otago - 2 freq ootgie - 5 freq o'ts - 2 freq odoak' - 1 freq odious - 4 freq oot-tak - 1 freq oot-hoose - 1 freq oottake - 1 freq odxx - 1 freq otz - 1 freq outs - 1 freq odjs - 1 freq o'those - 1 freq o'thise - 1 freq ohdogoaway - 2 freq odige - 1 freq ottzs - 1 freq otq - 2 freq oates - 1 freq otj - 1 freq |
MetaPhone code - OTHS oot-hoose - 1 freq |
OOT-HOOSE |
| Time to execute Levenshtein function - 0.216139 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.386978 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.028420 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.037889 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.000912 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. |