| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| elegance (0) - 2 freq relevance (2) - 5 freq elegaic (2) - 2 freq elegant (2) - 12 freq seance (3) - 2 freq penance (3) - 2 freq blance (3) - 2 freq eleanor (3) - 10 freq emergence (3) - 4 freq cleane (3) - 1 freq clearance (3) - 16 freq begane (3) - 1 freq legacie (3) - 2 freq revengance (3) - 1 freq relegate (3) - 2 freq newance (3) - 4 freq glence (3) - 4 freq allegiance (3) - 7 freq pleisance (3) - 1 freq pleasance (3) - 3 freq greeance (3) - 18 freq elegie (3) - 3 freq delegate (3) - 3 freq owerance (3) - 35 freq alliance (3) - 30 freq |
elegance (0) - 2 freq elegant (3) - 12 freq elegaic (3) - 2 freq legacie (4) - 2 freq alliance (4) - 30 freq legacy (4) - 44 freq lance (4) - 5 freq allegiance (4) - 7 freq relevance (4) - 5 freq glance (5) - 47 freq elgin (5) - 24 freq enhance (5) - 15 freq tolerance (5) - 7 freq abeyance (5) - 1 freq legend (5) - 92 freq seelance (5) - 1 freq eence (5) - 319 freq plesaunce (5) - 1 freq legianet (5) - 1 freq lugmince (5) - 2 freq eloquence (5) - 3 freq licence (5) - 29 freq diligence (5) - 1 freq allouance (5) - 3 freq logan (5) - 12 freq |
SoundEx code - E425 elegant - 12 freq elgin - 24 freq eilskin's - 1 freq elshin - 1 freq elegantlike - 1 freq eloquently - 2 freq elision - 2 freq eliakim - 7 freq elegance - 2 freq eloquence - 3 freq eleision - 1 freq eloquent - 3 freq eljonesuk - 1 freq ellahickson - 4 freq elgincityfc - 1 freq elginhsgeog - 2 freq elcouncil - 5 freq elsamaishman - 1 freq |
MetaPhone code - ELKNS elegance - 2 freq eloquence - 3 freq |
ELEGANCE |
| Time to execute Levenshtein function - 0.394892 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.687105 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.065044 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.038243 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.000891 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. |