| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rewaard (0) - 2 freq rewaird (1) - 8 freq reward (1) - 47 freq regaird (2) - 39 freq redcard (2) - 1 freq seward (2) - 2 freq bewaar (2) - 1 freq twaard (2) - 5 freq waard (2) - 2 freq awaard (2) - 1 freq regard (2) - 16 freq recaird (2) - 1 freq t'waard (2) - 3 freq rewards (2) - 6 freq reynard (2) - 3 freq retard (2) - 2 freq rewairds (2) - 1 freq reglar (3) - 39 freq steward (3) - 2 freq taeward (3) - 20 freq rear (3) - 29 freq waa'd (3) - 2 freq awaar (3) - 20 freq waar (3) - 70 freq regiar (3) - 1 freq |
rewaard (0) - 2 freq reward (1) - 47 freq rewaird (1) - 8 freq rewards (3) - 6 freq regard (3) - 16 freq reynard (3) - 3 freq rewairds (3) - 1 freq awaard (3) - 1 freq retard (3) - 2 freq recaird (3) - 1 freq seward (3) - 2 freq waard (3) - 2 freq regaird (3) - 39 freq twaard (3) - 5 freq record (4) - 99 freq forwaard (4) - 1 freq rudyard (4) - 2 freq repaired (4) - 8 freq award (4) - 59 freq edward (4) - 33 freq rewairdin (4) - 1 freq byward (4) - 2 freq weyward (4) - 1 freq remord (4) - 2 freq rewire (4) - 2 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 |
REWAARD |
| Time to execute Levenshtein function - 0.188998 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.391332 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.032341 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.042797 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.000950 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. |