| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| excerpt (0) - 5 freq except (1) - 148 freq excerptin (2) - 1 freq expert (2) - 44 freq excep (2) - 14 freq exert (2) - 1 freq exempt (2) - 12 freq eert (3) - 1 freq excpet (3) - 1 freq experts (3) - 25 freq receipt (3) - 18 freq cert (3) - 1 freq exeest (3) - 1 freq enterit (3) - 2 freq exceed (3) - 1 freq excess (3) - 10 freq exceptin (3) - 6 freq exertit (3) - 2 freq exkeest (3) - 1 freq cerpet (3) - 1 freq 'expert (3) - 1 freq expcect (3) - 1 freq exerce (3) - 1 freq 'cept (3) - 9 freq accept (3) - 76 freq |
excerpt (0) - 5 freq except (2) - 148 freq excerptin (3) - 1 freq excpet (4) - 1 freq cerpet (4) - 1 freq exempt (4) - 12 freq expert (4) - 44 freq excep (4) - 14 freq exert (4) - 1 freq cept (5) - 25 freq excitit (5) - 31 freq exceppin (5) - 2 freq carpit (5) - 2 freq oxtert (5) - 6 freq crypt (5) - 2 freq exceptit (5) - 2 freq exerptit (5) - 1 freq excitet (5) - 6 freq export (5) - 10 freq accept (5) - 76 freq escort (5) - 3 freq exect (5) - 1 freq curpet (5) - 1 freq creept (5) - 2 freq cert (5) - 1 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.218683 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.455319 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.031926 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.042456 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.004354 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. |