| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ower-writes (0) - 1 freq ower-ripe (3) - 1 freq ower-priced (3) - 1 freq ower-aiger (4) - 1 freq owerdrive (4) - 3 freq over-rated (4) - 1 freq weewrite (4) - 3 freq ower-sized (4) - 1 freq ower-uise (4) - 1 freq ower-setters (4) - 1 freq ower-uiss (4) - 2 freq ower-cute (4) - 1 freq ower-time (4) - 1 freq jozebwrites (4) - 2 freq owerstep (5) - 1 freq owergied (5) - 1 freq owerthrew (5) - 2 freq owertime (5) - 1 freq kerries (5) - 8 freq worries (5) - 63 freq fower-letter (5) - 1 freq websites (5) - 8 freq owthorities (5) - 2 freq overrated (5) - 2 freq owersetter (5) - 6 freq |
ower-writes (0) - 1 freq ower-priced (6) - 1 freq ower-ripe (6) - 1 freq ower-uiss (7) - 2 freq ower-cute (7) - 1 freq ower-lords (7) - 1 freq ower-setters (7) - 1 freq ower-time (7) - 1 freq jozebwrites (7) - 2 freq ower-uise (7) - 1 freq over-rated (7) - 1 freq weewrite (7) - 3 freq ower-aiger (7) - 1 freq owretrees (8) - 1 freq werewolves (8) - 2 freq owersetts (8) - 1 freq ower-excitit (8) - 1 freq ower-steer (8) - 1 freq over-rateed (8) - 1 freq wirries (8) - 10 freq wh-wirds (8) - 1 freq leader-writers (8) - 1 freq rewrite (8) - 2 freq fowerties (8) - 1 freq grey-white (8) - 1 freq |
SoundEx code - O663 owrewird - 1 freq owerheard - 4 freq ower-writes - 1 freq owerword - 1 freq |
MetaPhone code - OWRRTS ower-writes - 1 freq |
OWER-WRITES |
| Time to execute Levenshtein function - 0.222056 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.406094 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.028363 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.038996 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.000905 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. |