| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| neologism (0) - 2 freq neologisms (1) - 1 freq neologisin (2) - 1 freq geologist (2) - 1 freq apologise (3) - 27 freq apologist (3) - 2 freq zoologist (3) - 2 freq ologist (3) - 1 freq neurologist (3) - 1 freq geologic (3) - 3 freq apolagise (4) - 1 freq realism (4) - 3 freq ologie (4) - 1 freq theologie (4) - 1 freq nomadism (4) - 1 freq apologised (4) - 8 freq apologize (4) - 1 freq geological (4) - 4 freq hologram (4) - 1 freq belgium (4) - 10 freq apologies (4) - 22 freq apologises (4) - 1 freq eulogisit (4) - 1 freq ideologie (4) - 2 freq terrorism (4) - 3 freq |
neologism (0) - 2 freq neologisms (2) - 1 freq neologisin (3) - 1 freq geologist (4) - 1 freq ologist (5) - 1 freq zoologist (5) - 2 freq neurologist (5) - 1 freq apologist (5) - 2 freq apologise (5) - 27 freq apologises (6) - 1 freq apologies (6) - 22 freq belgium (6) - 10 freq eulogisit (6) - 1 freq elitism (6) - 1 freq hologram (6) - 1 freq apologisin (6) - 5 freq ideologies (6) - 4 freq apologeise (6) - 1 freq geologic (6) - 3 freq realism (6) - 3 freq apolagise (6) - 1 freq nomadism (6) - 1 freq apologised (6) - 8 freq genealogist (6) - 1 freq orgasm (7) - 1 freq |
SoundEx code - N422 neologisin - 1 freq neologisms - 1 freq nlcox - 1 freq neologism - 2 freq nljyspx - 1 freq neilsocialist - 2 freq |
MetaPhone code - NLJSM neologism - 2 freq |
NEOLOGISM |
| Time to execute Levenshtein function - 0.288416 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.560728 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.027240 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.072119 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.000865 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. |