| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| owner (0) - 28 freq ow'er (1) - 1 freq onner (1) - 3 freq ooner (1) - 2 freq ower (1) - 6224 freq owler (1) - 5 freq ownur (1) - 1 freq owder (1) - 1 freq downer (1) - 1 freq awner (1) - 4 freq owned (1) - 22 freq owver (1) - 1 freq owners (1) - 18 freq bowser (2) - 4 freq unner (2) - 454 freq rowler (2) - 2 freq owther (2) - 5 freq owe (2) - 24 freq fownes (2) - 2 freq ower' (2) - 1 freq wier (2) - 2 freq sower (2) - 1 freq powney (2) - 5 freq bowder (2) - 1 freq fooner (2) - 4 freq |
owner (0) - 28 freq awner (1) - 4 freq ownur (1) - 1 freq owned (2) - 22 freq owners (2) - 18 freq wnar (2) - 1 freq downer (2) - 1 freq owver (2) - 1 freq owder (2) - 1 freq ow'er (2) - 1 freq onner (2) - 3 freq ooner (2) - 2 freq ower (2) - 6224 freq owler (2) - 5 freq ebner (3) - 5 freq owider (3) - 1 freq finer (3) - 14 freq iwer (3) - 4 freq goner (3) - 4 freq lner (3) - 1 freq yonner (3) - 67 freq gener (3) - 1 freq own (3) - 164 freq dooner (3) - 2 freq dener (3) - 2 freq |
SoundEx code - O560 onywhere - 27 freq oniewhaur - 16 freq owner - 28 freq onywhaur - 58 freq oneywury - 1 freq onner - 3 freq onywhar - 4 freq oniewhur - 1 freq oniewhar - 2 freq ooner - 2 freq 'onywhere - 1 freq one-year - 1 freq oniewhere - 1 freq onywhaar - 1 freq onnir - 1 freq ownur - 1 freq onie-whaur - 1 freq onniewhare - 1 freq onnher - 1 freq ohumour - 1 freq onrr - 1 freq oniwhere - 1 freq |
MetaPhone code - ONR owner - 28 freq onner - 3 freq ooner - 2 freq onnir - 1 freq ownur - 1 freq onrr - 1 freq |
OWNER own - 164 freq ain - 2864 freq ains - 14 freq owns - 13 freq owner - 28 freq owned - 22 freq |
| Time to execute Levenshtein function - 0.285982 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.683011 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.072454 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.037430 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.001056 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. |