| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reward (0) - 47 freq regard (1) - 16 freq rewaard (1) - 2 freq rewaird (1) - 8 freq retard (1) - 2 freq rewards (1) - 6 freq seward (1) - 2 freq taeward (2) - 20 freq rears (2) - 2 freq remord (2) - 2 freq upward (2) - 5 freq he'ard (2) - 1 freq redars (2) - 1 freq reared (2) - 24 freq regards (2) - 11 freq atward (2) - 1 freq inward (2) - 7 freq read (2) - 958 freq reward'r (2) - 1 freq byward (2) - 2 freq dewar (2) - 9 freq rear (2) - 29 freq award (2) - 59 freq redcard (2) - 1 freq remark (2) - 44 freq |
reward (0) - 47 freq rewaird (1) - 8 freq rewaard (1) - 2 freq regard (2) - 16 freq seward (2) - 2 freq rewards (2) - 6 freq retard (2) - 2 freq reynard (3) - 3 freq akward (3) - 3 freq recaird (3) - 1 freq rewairds (3) - 1 freq regaird (3) - 39 freq toward (3) - 24 freq weyward (3) - 1 freq onward (3) - 5 freq record (3) - 99 freq coward (3) - 12 freq rewardin (3) - 2 freq ward (3) - 89 freq rewind (3) - 3 freq rewarded (3) - 2 freq rewirk (3) - 1 freq rewire (3) - 2 freq edward (3) - 33 freq howard (3) - 4 freq |
SoundEx code - R630 roared - 93 freq raired - 39 freq reward - 47 freq roart - 74 freq rewaird - 8 freq raird - 1 freq reared - 24 freq roarit - 6 freq roar't - 1 freq rewaard - 2 freq rarity - 3 freq rearit - 1 freq reread - 2 freq rared - 2 freq roar'd - 1 freq ruaraidh - 10 freq rairt - 1 freq rewrite - 2 freq ruaridh - 1 freq rhuaridh - 1 freq ruariaidh - 2 freq rewrote - 1 freq |
MetaPhone code - RWRT reward - 47 freq rewaird - 8 freq rewaard - 2 freq |
REWARD |
| Time to execute Levenshtein function - 0.188382 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.356076 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.027597 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.037080 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.000938 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. |