| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ower-fain (0) - 1 freq ower-suin (2) - 1 freq ower-run (3) - 2 freq werain (3) - 1 freq ower-ying (3) - 1 freq owertaen (3) - 2 freq ower-aw (3) - 1 freq owergrawn (3) - 1 freq owerfar (3) - 1 freq ower-abuin (3) - 1 freq owergaein (3) - 1 freq fower-fit (3) - 1 freq owercomin (3) - 2 freq owergyan (3) - 1 freq owergyaan (3) - 1 freq owergaen (3) - 1 freq owerseein (3) - 5 freq ower-rax (3) - 1 freq owerdrawn (3) - 1 freq owersman (3) - 1 freq ower-lang (3) - 1 freq ower-heid (3) - 2 freq ower-flowin (3) - 1 freq owergaun (3) - 1 freq ower-cute (4) - 1 freq |
ower-fain (0) - 1 freq ower-suin (3) - 1 freq ower-abuin (4) - 1 freq ower-run (4) - 2 freq ower-rax (5) - 1 freq owergaen (5) - 1 freq owersman (5) - 1 freq owerseein (5) - 5 freq ower-lang (5) - 1 freq owre-faur (5) - 1 freq owergaun (5) - 1 freq ower-heid (5) - 2 freq owergyaan (5) - 1 freq ower-flowin (5) - 1 freq ower-aw (5) - 1 freq owertaen (5) - 2 freq owergyan (5) - 1 freq owerfar (5) - 1 freq ower-ying (5) - 1 freq werain (5) - 1 freq owercomin (5) - 2 freq fower-fit (5) - 1 freq owergaein (5) - 1 freq ower- (6) - 1 freq werrin (6) - 3 freq |
SoundEx code - O615 orphanage - 7 freq orphaned - 5 freq orphan - 14 freq owre-abuin - 1 freq orphans - 35 freq orphans' - 2 freq ower-fain - 1 freq owerfundin - 1 freq ower-abuin - 1 freq €˜orphan - 1 freq orvnsdc - 1 freq |
MetaPhone code - OWRFN ower-fain - 1 freq |
OWER-FAIN |
| Time to execute Levenshtein function - 0.331341 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.599212 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.035907 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.048062 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.001276 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. |