| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| roaren (0) - 6 freq boaren (1) - 1 freq roarin (1) - 60 freq roared (1) - 93 freq roaran (1) - 4 freq aren (2) - 3 freq 'roarin (2) - 2 freq soarey (2) - 1 freq modren (2) - 202 freq roabin (2) - 1 freq soared (2) - 6 freq rodden (2) - 15 freq boarden (2) - 1 freq oapen (2) - 1 freq roadmen (2) - 1 freq road-en (2) - 3 freq laren (2) - 21 freq rarin (2) - 5 freq pooren (2) - 2 freq roaring (2) - 5 freq roart (2) - 74 freq loasen (2) - 3 freq rohres (2) - 1 freq rare (2) - 301 freq karen (2) - 114 freq |
roaren (0) - 6 freq roarin (1) - 60 freq roaran (1) - 4 freq rearan (2) - 1 freq roared (2) - 93 freq rarin (2) - 5 freq rearin (2) - 8 freq boaren (2) - 1 freq roamin (3) - 9 freq moarn (3) - 18 freq roarit (3) - 6 freq roarie (3) - 2 freq coarn (3) - 51 freq koarn (3) - 1 freq rouen (3) - 2 freq rairin (3) - 22 freq rared (3) - 2 freq boarn (3) - 66 freq rerun (3) - 1 freq roarin' (3) - 6 freq roars (3) - 23 freq boren (3) - 1 freq roadin (3) - 87 freq noarn (3) - 1 freq soarin (3) - 9 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 |
ROAREN |
| Time to execute Levenshtein function - 0.608170 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.890208 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.085596 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.037627 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.000961 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. |