| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| excerpt (0) - 5 freq except (1) - 144 freq exempt (2) - 12 freq expert (2) - 43 freq excep (2) - 14 freq excerptin (2) - 1 freq exert (2) - 1 freq exerce (3) - 1 freq excpet (3) - 1 freq efter't (3) - 4 freq expcect (3) - 1 freq export (3) - 10 freq oxtert (3) - 6 freq 'cept (3) - 9 freq excel (3) - 3 freq exeest (3) - 1 freq excess (3) - 10 freq experts (3) - 25 freq expecit (3) - 2 freq eccent (3) - 4 freq exect (3) - 1 freq €˜except (3) - 1 freq escort (3) - 3 freq 'expert (3) - 1 freq exertit (3) - 2 freq |
excerpt (0) - 5 freq except (2) - 144 freq excerptin (3) - 1 freq excpet (4) - 1 freq exempt (4) - 12 freq expert (4) - 43 freq exert (4) - 1 freq excep (4) - 14 freq accept (5) - 74 freq crept (5) - 33 freq excitit (5) - 31 freq exertit (5) - 2 freq excitet (5) - 6 freq exceptit (5) - 2 freq exerptit (5) - 1 freq crypt (5) - 2 freq curpet (5) - 1 freq exceppin (5) - 2 freq cept (5) - 25 freq carpit (5) - 2 freq exceptin (5) - 6 freq receipt (5) - 18 freq exect (5) - 1 freq script (5) - 30 freq escort (5) - 3 freq |
SoundEx code - E261 ecarfuffle - 1 freq excerpt - 5 freq exerptit - 1 freq escarpment - 2 freq escribir - 2 freq e-screive - 13 freq e-scrieve - 1 freq excerptin - 1 freq exorbitant - 1 freq eacrobertburns - 1 freq |
MetaPhone code - EKSSRPT excerpt - 5 freq |
EXCERPT |
| Time to execute Levenshtein function - 0.233896 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.392671 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.027860 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.000797 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. |