| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rearan (0) - 1 freq nearan (1) - 1 freq readan (1) - 10 freq hearan (1) - 14 freq wearan (1) - 9 freq roaran (1) - 4 freq rearin (1) - 8 freq reelan (2) - 3 freq learin (2) - 8 freq reason (2) - 324 freq learn (2) - 294 freq rear (2) - 29 freq rebrand (2) - 2 freq bearin (2) - 28 freq eatan (2) - 1 freq earn (2) - 41 freq relaxan (2) - 2 freq d'aran (2) - 1 freq gearin (2) - 2 freq nearhan (2) - 28 freq nearin (2) - 6 freq readin (2) - 373 freq peeran (2) - 2 freq fearin (2) - 4 freq reasin (2) - 2 freq |
rearan (0) - 1 freq roaran (1) - 4 freq rearin (1) - 8 freq rarin (2) - 5 freq roaren (2) - 6 freq roarin (2) - 60 freq erran (2) - 3 freq rerun (2) - 1 freq readan (2) - 10 freq hearan (2) - 14 freq nearan (2) - 1 freq wearan (2) - 9 freq rairin (3) - 22 freq errin (3) - 1 freq reekan (3) - 1 freq raxan (3) - 3 freq ryaan (3) - 8 freq ragan (3) - 1 freq yearn (3) - 1 freq searin (3) - 4 freq reared (3) - 24 freq refarin (3) - 1 freq keiran (3) - 3 freq arran (3) - 15 freq refrain (3) - 13 freq |
SoundEx code - R650 rairin - 22 freq roarin - 60 freq rearin - 8 freq rarin - 5 freq roaran - 4 freq roarin' - 6 freq rewirin - 1 freq rewirin' - 1 freq roaren - 6 freq 'roarin - 2 freq rearan - 1 freq 'rairin - 1 freq rear-enn - 1 freq re-run - 1 freq rerun - 1 freq rwran - 1 freq |
MetaPhone code - RRN rairin - 22 freq roarin - 60 freq rearin - 8 freq rarin - 5 freq roaran - 4 freq roarin' - 6 freq roaren - 6 freq 'roarin - 2 freq rearan - 1 freq 'rairin - 1 freq rear-enn - 1 freq re-run - 1 freq rerun - 1 freq rwran - 1 freq |
REARAN |
| Time to execute Levenshtein function - 0.420773 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.399711 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.064046 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.037007 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.000879 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. |