| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| requirin (0) - 1 freq requirit (1) - 1 freq requiring (1) - 2 freq required (2) - 28 freq acquirin (2) - 3 freq recurrin (2) - 2 freq enquirin (2) - 3 freq require (2) - 10 freq requirt (2) - 1 freq requires (2) - 10 freq rewirin (2) - 1 freq retuirn (2) - 1 freq requerit (2) - 1 freq retirin (2) - 10 freq repairin (2) - 3 freq beirin (3) - 4 freq resultin (3) - 7 freq refinin (3) - 2 freq restorin (3) - 3 freq requered (3) - 1 freq reducin (3) - 3 freq revisin (3) - 5 freq reuril (3) - 1 freq ruisin (3) - 2 freq heirin (3) - 2 freq |
requirin (0) - 1 freq requirit (2) - 1 freq requiring (2) - 2 freq requerit (3) - 1 freq retuirn (3) - 1 freq repairin (3) - 3 freq requires (3) - 10 freq retirin (3) - 10 freq rewirin (3) - 1 freq requirt (3) - 1 freq required (3) - 28 freq enquirin (3) - 3 freq acquirin (3) - 3 freq require (3) - 10 freq refarin (4) - 1 freq rairin (4) - 22 freq requeired (4) - 1 freq retourin (4) - 4 freq referin (4) - 1 freq squarin (4) - 1 freq return (4) - 132 freq rearin (4) - 8 freq requered (4) - 1 freq recurrin (4) - 2 freq squirtin (5) - 4 freq |
SoundEx code - R265 reassurance - 5 freq reassuringly - 2 freq reassurin - 7 freq requirement - 7 freq re-occurrin - 1 freq requirements - 14 freq recriminations - 1 freq reserrin - 1 freq recurrent - 2 freq recurrin - 2 freq requiring - 2 freq reassuran - 1 freq €˜rogerin - 1 freq re-assurance - 1 freq ragoran - 6 freq €œragoran - 1 freq reassuring - 2 freq recurring - 1 freq requirin - 1 freq rwgerruhmw - 1 freq rosgrams - 1 freq rogermiles - 1 freq rczrim - 1 freq requiremint - 1 freq |
MetaPhone code - RKRN recurrin - 2 freq ragoran - 6 freq €œragoran - 1 freq requirin - 1 freq |
REQUIRIN |
| Time to execute Levenshtein function - 0.255007 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.514339 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.033400 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.043198 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.001257 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. |