| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neolithic (0) - 6 freq megalithic (3) - 2 freq monolithic (3) - 4 freq neithir (3) - 1 freq neithin (3) - 3 freq politic (3) - 5 freq regolith (4) - 1 freq keithc (4) - 1 freq gothic (4) - 5 freq nithir (4) - 1 freq politie (4) - 2 freq neeölithik (4) - 1 freq naeithin (4) - 1 freq holistic (4) - 4 freq nepotistic (4) - 1 freq semitic (4) - 1 freq prolific (4) - 5 freq politics (4) - 161 freq nothin (4) - 194 freq neighin (4) - 1 freq delitit (4) - 3 freq naithin (4) - 3 freq polishin (4) - 10 freq politico (4) - 2 freq meithit (4) - 1 freq |
neolithic (0) - 6 freq monolithic (4) - 4 freq politic (5) - 5 freq neithin (5) - 3 freq megalithic (5) - 2 freq neithir (5) - 1 freq celtic (6) - 115 freq neither (6) - 169 freq nothin (6) - 194 freq naithin (6) - 3 freq oneithin (6) - 1 freq neurotic (6) - 2 freq nithin (6) - 71 freq neithen (6) - 3 freq politico (6) - 2 freq wealthie (6) - 1 freq lithca (6) - 1 freq nithir (6) - 1 freq gothic (6) - 5 freq keithc (6) - 1 freq neethir (6) - 3 freq ethic (6) - 1 freq neythin (6) - 1 freq neathin (6) - 1 freq naeithin (6) - 1 freq |
SoundEx code - N432 neolithic - 6 freq nolte's - 1 freq neeölithik - 1 freq noladiesplz - 1 freq |
MetaPhone code - NL0K neolithic - 6 freq neeölithik - 1 freq |
NEOLITHIC |
| Time to execute Levenshtein function - 0.210046 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.418942 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.028077 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.037029 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.000913 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. |