| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owstqem (0) - 1 freq steem (3) - 13 freq owse (3) - 5 freq rowsted (3) - 6 freq owte (3) - 2 freq oyster (3) - 23 freq owsen (3) - 3 freq stcem (3) - 1 freq stem (3) - 18 freq othem (3) - 2 freq bowster (3) - 12 freq oxster (3) - 4 freq staem (3) - 1 freq sistem (3) - 1 freq gowstie (3) - 7 freq owrte (3) - 1 freq o'them (3) - 1 freq owther (3) - 5 freq esteem (3) - 15 freq gowster (3) - 2 freq system (3) - 188 freq owsed (3) - 9 freq ostaig (4) - 2 freq rowted (4) - 1 freq oxsters (4) - 8 freq |
owstqem (0) - 1 freq stem (5) - 18 freq staem (5) - 1 freq system (5) - 188 freq stcem (5) - 1 freq sistem (5) - 1 freq esteem (5) - 15 freq westham (5) - 3 freq steem (5) - 13 freq starm (6) - 1 freq waste (6) - 119 freq steam (6) - 77 freq wyste (6) - 2 freq awsom (6) - 1 freq westie (6) - 2 freq stream (6) - 73 freq wastel (6) - 1 freq winqm (6) - 1 freq strum (6) - 5 freq wmtim (6) - 1 freq streem (6) - 2 freq wastes (6) - 4 freq awsome (6) - 2 freq esteim (6) - 1 freq storm (6) - 125 freq |
SoundEx code - O232 okiedokie - 1 freq octogenarian - 1 freq 'okaydoky - 1 freq okay-dokay - 1 freq oxides - 1 freq ostaig - 2 freq octogenarians - 1 freq ochts - 3 freq oxdzo - 1 freq ouexutjyau - 1 freq owstqem - 1 freq oxytocin - 1 freq okdaqszwvz - 1 freq ojtijtxvg - 1 freq ocht's - 1 freq |
MetaPhone code - OSTKM owstqem - 1 freq |
OWSTQEM |
| Time to execute Levenshtein function - 0.221666 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.418619 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.033382 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.048726 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.000891 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. |