| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rowers (0) - 3 freq owers (1) - 2 freq mowers (1) - 1 freq rogers (1) - 6 freq rovers (1) - 23 freq lowers (1) - 6 freq growers (1) - 1 freq rowes (1) - 10 freq rower (1) - 2 freq towers (1) - 19 freq dowers (1) - 1 freq bowers (1) - 1 freq rowlers (1) - 3 freq powers (1) - 15 freq fowers (1) - 7 freq robbers (2) - 7 freq flowers (2) - 15 freq sewers (2) - 5 freq powkers (2) - 1 freq prowess (2) - 5 freq goers (2) - 3 freq mower (2) - 15 freq loners (2) - 1 freq sower (2) - 1 freq drovers (2) - 2 freq |
rowers (0) - 3 freq dowers (2) - 1 freq towers (2) - 19 freq bowers (2) - 1 freq rowlers (2) - 3 freq powers (2) - 15 freq rower (2) - 2 freq fowers (2) - 7 freq mowers (2) - 1 freq owers (2) - 2 freq rowes (2) - 10 freq rogers (2) - 6 freq growers (2) - 1 freq rovers (2) - 23 freq lowers (2) - 6 freq rowans (3) - 12 freq refers (3) - 27 freq ryders (3) - 1 freq drawers (3) - 48 freq rimers (3) - 1 freq rowls (3) - 5 freq rypers (3) - 1 freq rowies (3) - 16 freq rawer (3) - 1 freq riders (3) - 8 freq |
SoundEx code - R620 roars - 22 freq rairs - 3 freq rears - 2 freq rehearse - 3 freq roar's - 19 freq rowers - 3 freq rerek - 1 freq rewirk - 1 freq rorys - 1 freq rohres - 1 freq rur's - 2 freq rer's - 1 freq rurick - 1 freq re-org - 1 freq roorooyes - 1 freq |
MetaPhone code - RWRS rowers - 3 freq |
ROWERS |
| Time to execute Levenshtein function - 0.177179 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.343695 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.028239 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.037879 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.000843 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. |