Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
orthodoxies (0) - 2 freq orthodox (3) - 3 freq anthologies (4) - 5 freq orthotics (4) - 1 freq orthydox (4) - 1 freq oothooses (4) - 3 freq owthorities (4) - 2 freq rhodie (5) - 4 freq rtomdavies (5) - 1 freq dichotomies (5) - 1 freq unorthodox (5) - 1 freq outhouses (5) - 1 freq hoosies (5) - 9 freq photoies (5) - 1 freq thochties (5) - 1 freq hothooses (5) - 1 freq proddies (5) - 1 freq anthologie (5) - 4 freq proxies (5) - 1 freq worthies (5) - 4 freq 'chookies (5) - 1 freq o'bookies (5) - 1 freq chookies (5) - 19 freq toonies (5) - 1 freq bahookies (5) - 2 freq |
orthodoxies (0) - 2 freq orthodox (4) - 3 freq orthydox (5) - 1 freq orthotics (6) - 1 freq unorthodox (7) - 1 freq rtomdavies (7) - 1 freq owthorities (7) - 2 freq anthologies (7) - 5 freq oothooses (7) - 3 freq rhodes (7) - 7 freq ootsheddies (8) - 1 freq northies (8) - 9 freq hoodies (8) - 5 freq authorities (8) - 37 freq methods (8) - 8 freq upthedons (8) - 2 freq orchids (8) - 2 freq arthritis (8) - 4 freq theories (8) - 3 freq oothoose (8) - 10 freq methodologies (8) - 1 freq outhouses (8) - 1 freq thedons (8) - 1 freq hothooses (8) - 1 freq worthies (8) - 4 freq |
SoundEx code - O633 orthodox - 3 freq orthydox - 1 freq owerdid - 1 freq orthodoxies - 2 freq ower-the-tap - 1 freq orthotics - 1 freq |
MetaPhone code - OR0TKSS orthodoxies - 2 freq |
ORTHODOXIES |
Time to execute Levenshtein function - 0.223097 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.362602 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.027889 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.038323 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.000897 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. |