Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
owerdid (0) - 1 freq overdid (1) - 1 freq owerdae (2) - 1 freq owerdue (2) - 3 freq owerheid (2) - 15 freq owerend (2) - 1 freq owergied (2) - 1 freq owertim (2) - 1 freq verdi (3) - 1 freq ower- (3) - 1 freq stertid (3) - 1 freq owerlay (3) - 1 freq swerved (3) - 2 freq wurrid (3) - 1 freq wergild (3) - 2 freq owid (3) - 7 freq weirdie (3) - 1 freq werain (3) - 1 freq warid (3) - 5 freq fleudid (3) - 1 freq owerheed (3) - 1 freq wardin (3) - 1 freq awardit (3) - 4 freq cowerin (3) - 5 freq wirdit (3) - 1 freq |
owerdid (0) - 1 freq overdid (2) - 1 freq worded (3) - 1 freq awarded (3) - 6 freq owerend (3) - 1 freq owergied (3) - 1 freq owerdue (3) - 3 freq owerdae (3) - 1 freq owerheid (3) - 15 freq owerdose (4) - 1 freq welded (4) - 1 freq wended (4) - 1 freq wurid (4) - 1 freq weirdin (4) - 1 freq awreddie (4) - 2 freq guerded (4) - 1 freq wuidid (4) - 1 freq owreheid (4) - 2 freq werd (4) - 1 freq wurdie (4) - 9 freq wedded (4) - 4 freq weirdit (4) - 5 freq awereddy (4) - 1 freq wurdin (4) - 1 freq worsid (4) - 2 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 - OWRTT owerdid - 1 freq |
OWERDID |
Time to execute Levenshtein function - 0.244181 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.596674 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.063667 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.039867 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.001244 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. |