| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ethics (0) - 3 freq ethic (1) - 1 freq ethnic (2) - 32 freq etchins (2) - 1 freq strics (2) - 1 freq etins (2) - 5 freq thits (2) - 1 freq thick (2) - 218 freq ethical (2) - 5 freq this (2) - 11106 freq ethos (2) - 2 freq thirs (2) - 41 freq thies (2) - 1 freq ehic (2) - 1 freq athins (2) - 2 freq 'this (2) - 71 freq ithirs (2) - 10 freq ettils (2) - 14 freq thins (2) - 2 freq stoics (2) - 1 freq 'thirs (2) - 1 freq kythins (3) - 1 freq tis (3) - 38 freq thit (3) - 566 freq thairs (3) - 14 freq |
ethics (0) - 3 freq ethic (2) - 1 freq thirs (3) - 41 freq thies (3) - 1 freq ethos (3) - 2 freq thins (3) - 2 freq this (3) - 11106 freq ithirs (3) - 10 freq athins (3) - 2 freq ethical (3) - 5 freq thits (3) - 1 freq thick (3) - 218 freq thows (4) - 1 freq thurs (4) - 16 freq thers (4) - 1 freq thees (4) - 4 freq thickos (4) - 1 freq topics (4) - 17 freq thats (4) - 200 freq thums (4) - 1 freq thors (4) - 1 freq thugs (4) - 4 freq thens (4) - 2 freq theis (4) - 19 freq thos (4) - 1 freq |
SoundEx code - E320 edge - 186 freq eats - 29 freq etec - 1 freq eh-it's - 1 freq etc - 189 freq eattocks - 1 freq edgy - 6 freq eit's - 29 freq et's - 8 freq eits - 1 freq eets - 58 freq eet's - 58 freq eat's - 1 freq eddie's - 3 freq edick - 1 freq etts - 2 freq eddies - 1 freq ethic - 1 freq eatch - 1 freq eds - 9 freq etch - 2 freq ethics - 3 freq etc' - 3 freq eidduc - 1 freq ethos - 2 freq €™edge - 1 freq etjwh - 1 freq ehts - 1 freq etxu - 1 freq etoo's - 1 freq edg - 1 freq 'eats - 2 freq ethgx - 1 freq edj - 1 freq etg - 1 freq etsy - 1 freq etjx - 1 freq eoeutzi - 1 freq |
MetaPhone code - E0KS ethics - 3 freq |
ETHICS |
| Time to execute Levenshtein function - 0.183727 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.362936 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.028741 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.037300 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.000798 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. |