| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rewardin (0) - 2 freq rewairdin (1) - 1 freq rewarding (1) - 1 freq regardin (1) - 2 freq refarin (2) - 1 freq breardin (2) - 3 freq rearin (2) - 8 freq recordin (2) - 20 freq reward'r (2) - 1 freq wardin (2) - 1 freq reward (2) - 46 freq rewards (2) - 6 freq rewirin (2) - 1 freq reparein (2) - 2 freq rewairdit (2) - 2 freq rewarded (2) - 2 freq remarkin (2) - 4 freq regarding (2) - 5 freq regairdin (2) - 7 freq readin (2) - 366 freq regardit (2) - 1 freq cardin (3) - 2 freq repairin (3) - 3 freq rewatchin (3) - 2 freq roarin (3) - 60 freq |
rewardin (0) - 2 freq rewairdin (1) - 1 freq regardin (2) - 2 freq rewarding (2) - 1 freq rewirin (3) - 1 freq rewairdit (3) - 2 freq reward (3) - 46 freq regairdin (3) - 7 freq rewarded (3) - 2 freq rewards (3) - 6 freq wardin (3) - 1 freq recordin (3) - 20 freq wordin (4) - 3 freq edwardian (4) - 2 freq wirdin (4) - 2 freq rewaird (4) - 8 freq reweirdit (4) - 1 freq wairdin (4) - 1 freq rewaard (4) - 1 freq wurdin (4) - 1 freq weirdin (4) - 1 freq warden (4) - 6 freq recordan (4) - 1 freq forwardin (4) - 1 freq rewairds (4) - 1 freq |
SoundEx code - R635 rewritten - 2 freq rewairdin - 1 freq re-readin - 2 freq rewardin - 2 freq rewarding - 1 freq |
MetaPhone code - RWRTN rewairdin - 1 freq rewardin - 2 freq |
REWARDIN |
| Time to execute Levenshtein function - 0.200614 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.364540 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.027094 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.036889 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.000883 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. |