| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| requirements (0) - 14 freq requirement (1) - 7 freq requiremint (2) - 1 freq retirement (3) - 17 freq retirement's (3) - 1 freq reteirment (4) - 1 freq requires (4) - 10 freq equipment (4) - 10 freq meuvements (4) - 1 freq refinement (4) - 3 freq depairtments (4) - 17 freq regiments (4) - 12 freq measurements (4) - 1 freq decorements (4) - 3 freq replacements (4) - 2 freq muivements (4) - 8 freq equivelent (4) - 1 freq represents (4) - 18 freq realignments (4) - 1 freq equivalents (4) - 6 freq meisurements (4) - 1 freq requests (5) - 7 freq departments (5) - 1 freq requirin (5) - 1 freq equivelant (5) - 2 freq |
requirements (0) - 14 freq requirement (2) - 7 freq requiremint (3) - 1 freq retirement's (5) - 1 freq retirement (5) - 17 freq measurements (6) - 1 freq decorements (6) - 3 freq meisurements (6) - 1 freq regiments (6) - 12 freq represents (6) - 18 freq reteirment (6) - 1 freq requires (7) - 10 freq greements (7) - 1 freq depairtments (7) - 17 freq argiements (7) - 11 freq experiments (7) - 3 freq realignments (7) - 1 freq gairments (7) - 1 freq equivalents (7) - 6 freq meuvements (7) - 1 freq refinement (7) - 3 freq equipment (7) - 10 freq replacements (7) - 2 freq airgiements (7) - 1 freq muivements (7) - 8 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 - RKRMNTS requirements - 14 freq |
REQUIREMENTS |
| Time to execute Levenshtein function - 0.205679 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.401330 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.027669 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.037112 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.000891 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. |