| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| excellent (0) - 28 freq excelled (2) - 1 freq €˜excellent (2) - 2 freq excelling (2) - 1 freq excellence (2) - 25 freq repellent (3) - 1 freq excellence' (3) - 2 freq excrement (3) - 2 freq expelled (3) - 5 freq expellin (3) - 1 freq excitment (3) - 1 freq expleit (4) - 1 freq weelkent (4) - 1 freq explene (4) - 4 freq excerpt (4) - 5 freq explaens (4) - 1 freq excesses (4) - 2 freq easement (4) - 9 freq extollin (4) - 1 freq ebullient (4) - 1 freq cellist (4) - 1 freq exclaimt (4) - 24 freq seilent (4) - 6 freq element (4) - 45 freq descendent (4) - 4 freq |
excellent (0) - 28 freq excellence (3) - 25 freq excelling (3) - 1 freq €˜excellent (4) - 2 freq excelled (4) - 1 freq excitment (5) - 1 freq callant (5) - 21 freq expellin (5) - 1 freq excellence' (5) - 2 freq repellent (5) - 1 freq excrement (5) - 2 freq cellist (6) - 1 freq exclaimt (6) - 24 freq ebullient (6) - 1 freq excitement (6) - 100 freq extollin (6) - 1 freq excludit (6) - 7 freq cullen (6) - 16 freq client (6) - 2 freq asclent (6) - 1 freq expelled (6) - 5 freq explaint (6) - 14 freq exultant (6) - 1 freq collect (6) - 29 freq succulent (6) - 1 freq |
SoundEx code - E245 exclaimt - 24 freq exclaimed - 36 freq exclamation - 4 freq exclaims - 4 freq excellence' - 2 freq excellence - 25 freq exclaimit - 1 freq exclaimations - 1 freq exclaim - 7 freq exhalin - 1 freq excellent - 28 freq exclaimin - 1 freq esquiline - 1 freq exclamaetion - 1 freq eaglewaang - 1 freq easslin - 1 freq esh-lance - 1 freq eglon - 1 freq exclamations - 1 freq esslemont - 3 freq excelling - 1 freq echelons - 1 freq €˜excellent - 2 freq exclaimet - 1 freq |
MetaPhone code - EKSSLNT excellent - 28 freq €˜excellent - 2 freq |
EXCELLENT |
| Time to execute Levenshtein function - 0.474172 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.693415 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.029243 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.089525 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.000882 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. |