| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rowler (0) - 2 freq roller (1) - 27 freq rowle (1) - 8 freq rowley (1) - 13 freq rower (1) - 2 freq rowlers (1) - 3 freq growler (1) - 2 freq fowler (1) - 2 freq owler (1) - 5 freq goller (2) - 7 freq sower (2) - 1 freq crowle (2) - 2 freq cower (2) - 11 freq raeler (2) - 1 freq bowser (2) - 4 freq rowwed (2) - 1 freq howder (2) - 1 freq rowes (2) - 10 freq downer (2) - 1 freq holler (2) - 2 freq bowle (2) - 2 freq ouler (2) - 8 freq grower (2) - 2 freq rowie (2) - 23 freq ruler (2) - 10 freq |
rowler (0) - 2 freq growler (2) - 2 freq owler (2) - 5 freq rowlers (2) - 3 freq fowler (2) - 2 freq rower (2) - 2 freq roller (2) - 27 freq rowle (2) - 8 freq rowley (2) - 13 freq trawler (3) - 3 freq rowlin (3) - 4 freq wler (3) - 1 freq crawler (3) - 1 freq rawer (3) - 1 freq rowls (3) - 5 freq ruler (3) - 10 freq raeler (3) - 1 freq powlar (3) - 1 freq rowl (3) - 9 freq rowlt (3) - 5 freq router (4) - 1 freq voller (4) - 2 freq rocker (4) - 3 freq ower (4) - 6224 freq crowner (4) - 19 freq |
SoundEx code - R460 ruler - 10 freq roller - 27 freq rowler - 2 freq raeler - 1 freq roll-ower - 1 freq rlr - 1 freq |
MetaPhone code - RLR ruler - 10 freq roller - 27 freq rowler - 2 freq raeler - 1 freq rlr - 1 freq |
ROWLER |
| Time to execute Levenshtein function - 0.190733 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.362616 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.030766 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.042885 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.000783 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. |