| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rears (0) - 2 freq reads (1) - 59 freq reams (1) - 5 freq nears (1) - 3 freq fears (1) - 40 freq gears (1) - 15 freq roars (1) - 23 freq redars (1) - 1 freq years (1) - 1172 freq bears (1) - 37 freq ears (1) - 112 freq dears (1) - 12 freq tears (1) - 307 freq rear (1) - 29 freq 'ears (1) - 8 freq hears (1) - 46 freq reaps (1) - 11 freq wears (1) - 55 freq lears (1) - 2 freq heers (2) - 2 freq kerrs (2) - 9 freq deals (2) - 18 freq ear (2) - 143 freq rews (2) - 2 freq repairs (2) - 6 freq |
rears (0) - 2 freq roars (1) - 23 freq wears (2) - 55 freq reaps (2) - 11 freq 'ears (2) - 8 freq rear (2) - 29 freq lears (2) - 2 freq rairs (2) - 3 freq reads (2) - 59 freq errs (2) - 1 freq tears (2) - 307 freq hears (2) - 46 freq gears (2) - 15 freq fears (2) - 40 freq dears (2) - 12 freq reams (2) - 5 freq redars (2) - 1 freq nears (2) - 3 freq years (2) - 1172 freq bears (2) - 37 freq ears (2) - 112 freq ycars (3) - 1 freq terrs (3) - 1 freq serrs (3) - 5 freq reps (3) - 1 freq |
SoundEx code - R620 roars - 23 freq rairs - 3 freq rears - 2 freq rehearse - 4 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 - RRS roars - 23 freq rairs - 3 freq rears - 2 freq roar's - 19 freq rorys - 1 freq rohres - 1 freq rur's - 2 freq rer's - 1 freq |
REARS |
| Time to execute Levenshtein function - 0.313157 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.603201 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.086810 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.084899 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.000995 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. |