Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
excellence (0) - 25 freq excellence' (1) - 2 freq excellent (2) - 28 freq excelled (3) - 1 freq excelling (3) - 1 freq experience (3) - 149 freq sellence (3) - 1 freq experiences (4) - 26 freq experienced (4) - 34 freq excellent (4) - 2 freq extistence (4) - 1 freq existence (4) - 54 freq seelence (4) - 1 freq scilence (4) - 1 freq seilence (4) - 6 freq expelled (4) - 5 freq expellin (4) - 1 freq expediency (4) - 1 freq expeereence (4) - 1 freq experience' (4) - 3 freq emergence (4) - 4 freq veelence (4) - 1 freq excrescences (4) - 1 freq excheenge (4) - 1 freq eveidence (4) - 1 freq |
excellence (0) - 25 freq excellence' (2) - 2 freq excellent (3) - 28 freq excelling (4) - 1 freq sellence (5) - 1 freq excelled (5) - 1 freq experience (6) - 149 freq expellin (6) - 1 freq scilence (6) - 1 freq sclance (7) - 1 freq seelence (7) - 73 freq excheenge (7) - 1 freq explene (7) - 4 freq clarence (7) - 2 freq cullen (7) - 16 freq challance (7) - 1 freq veelence (7) - 1 freq cellic (7) - 11 freq extollin (7) - 1 freq colline (7) - 1 freq ballance (7) - 1 freq extistence (7) - 1 freq seelence (7) - 1 freq expelled (7) - 5 freq existence (7) - 54 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 - EKSSLNS excellence' - 2 freq excellence - 25 freq |
EXCELLENCE |
Time to execute Levenshtein function - 0.199959 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.386798 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.028983 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.037461 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.000915 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. |