Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
oot-hauds (0) - 1 freq oot-haudin (2) - 2 freq ootwards (3) - 12 freq hoosehauds (3) - 5 freq hook-haunds (3) - 3 freq fithauds (3) - 1 freq cot-hous (3) - 2 freq doonhauds (3) - 6 freq withhaud (4) - 1 freq soothends (4) - 1 freq oot-gansh (4) - 1 freq ootlaas (4) - 1 freq ootgaans (4) - 1 freq cothous (4) - 9 freq dotards (4) - 1 freq ootshines (4) - 1 freq oot-walin (4) - 1 freq mort-saufs (4) - 1 freq inhauds (4) - 3 freq ootlaws (4) - 1 freq owthar's (4) - 5 freq ootlats (4) - 2 freq thauts (4) - 2 freq ootgans (4) - 1 freq thuds (4) - 3 freq |
oot-hauds (0) - 1 freq oot-haudin (3) - 2 freq thuds (5) - 3 freq tae-haud (5) - 1 freq oot-hooses (5) - 1 freq oot-hoose (5) - 1 freq doonhauds (5) - 6 freq ootwards (5) - 12 freq fithauds (5) - 1 freq cot-hous (5) - 2 freq hoosehauds (5) - 5 freq fit-hadd (6) - 1 freq oil-yards (6) - 1 freq thauts (6) - 2 freq waa-heids (6) - 1 freq behauds (6) - 1 freq hauds (6) - 123 freq ootsheens (6) - 1 freq het-houss (6) - 1 freq pot-holes (6) - 1 freq inhauds (6) - 3 freq ootshines (6) - 1 freq tea-houss (6) - 1 freq wa-heids (6) - 1 freq oot-comes (6) - 1 freq |
SoundEx code - O332 oot-o-da-usual - 1 freq ootadaeks - 3 freq odets - 1 freq oot-hauds - 1 freq |
MetaPhone code - OTHTS oot-hauds - 1 freq |
OOT-HAUDS |
Time to execute Levenshtein function - 0.380982 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.696683 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.060576 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.041089 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.000930 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. |