| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acceptilautioun (0) - 1 freq receptautioun (4) - 1 freq destinautioun (5) - 4 freq ventilation (6) - 2 freq leitigatioun (6) - 1 freq accumulation (6) - 1 freq desolautioun (6) - 1 freq eddicautioun (6) - 3 freq acceleration (6) - 1 freq applicatioun (6) - 1 freq investigatioun (6) - 1 freq complicatioun (6) - 1 freq accreditation (6) - 2 freq compilation (6) - 3 freq sitivautioun (6) - 6 freq compensautioun (6) - 1 freq constitutioun (6) - 1 freq temptautioun (6) - 1 freq encapsulatioun (6) - 1 freq devolutioun (7) - 1 freq exceptioun (7) - 1 freq acceptabilty (7) - 1 freq complication (7) - 2 freq retributioun (7) - 1 freq estimation (7) - 1 freq |
acceptilautioun (0) - 1 freq receptautioun (6) - 1 freq compilation (8) - 3 freq accumulation (8) - 1 freq encapsulatioun (8) - 1 freq constitutioun (9) - 1 freq compensautioun (9) - 1 freq temptautioun (9) - 1 freq occupation (9) - 14 freq captivatin (9) - 3 freq acceptin (9) - 16 freq accumulatin (9) - 1 freq acceptabilty (9) - 1 freq acceptit (9) - 46 freq acceleration (9) - 1 freq ventilation (9) - 2 freq destinautioun (9) - 4 freq accreditation (9) - 2 freq complicatioun (9) - 1 freq leitigatioun (10) - 1 freq constitution (10) - 15 freq compitition (10) - 1 freq receptioun (10) - 1 freq cultivation (10) - 2 freq populatioun (10) - 1 freq |
SoundEx code - A213 accept - 76 freq acceptance - 31 freq accepts - 6 freq acceptin - 16 freq accepted - 25 freq acceptable - 25 freq accepit - 2 freq acceptit - 46 freq acceptabilty - 1 freq accepting - 3 freq achieved - 14 freq aspidistra - 1 freq asphodel - 1 freq accepte - 1 freq acceppit - 12 freq acceptilautioun - 1 freq aquavit - 1 freq acceptability - 1 freq acceptid - 1 freq acceptsna - 1 freq ajfter - 1 freq assipattle - 5 freq assipattle's - 1 freq aspd - 1 freq agiftaday - 4 freq aqua-fit - 1 freq aqbudsuu - 1 freq |
MetaPhone code - AKSPTLXN acceptilautioun - 1 freq |
ACCEPTILAUTIOUN |
| Time to execute Levenshtein function - 0.225995 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.435167 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.027569 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.042470 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.001130 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. |