| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nihilistic (0) - 1 freq simplistic (3) - 2 freq holistic (3) - 4 freq unrealistic (4) - 2 freq moralistic (4) - 1 freq nepotistic (4) - 1 freq optimistic (4) - 11 freq airtistic (4) - 8 freq ballistic (4) - 2 freq realistic (4) - 8 freq cabalistic (4) - 1 freq philistine (4) - 4 freq idealistic (4) - 2 freq stylistic (4) - 1 freq atheistic (4) - 1 freq syphilitic (4) - 2 freq civilitie (4) - 1 freq nobilitie (4) - 1 freq linguistic (4) - 194 freq fatalistic (4) - 3 freq dialectic (5) - 1 freq listin (5) - 4 freq flistit (5) - 1 freq militaristic (5) - 1 freq bikelists (5) - 1 freq |
nihilistic (0) - 1 freq holistic (4) - 4 freq unrealistic (5) - 2 freq cabalistic (6) - 1 freq philistine (6) - 4 freq idealistic (6) - 2 freq atheistic (6) - 1 freq fatalistic (6) - 3 freq realistic (6) - 8 freq stylistic (6) - 1 freq moralistic (6) - 1 freq ballistic (6) - 2 freq nepotistic (6) - 1 freq simplistic (6) - 2 freq novelists (7) - 8 freq whilst (7) - 124 freq enthusiastic (7) - 7 freq eucharistic (7) - 2 freq plestic (7) - 4 freq nationalistic (7) - 2 freq naituralistic (7) - 1 freq enlistit (7) - 1 freq elastic (7) - 16 freq athletic (7) - 7 freq elestic (7) - 2 freq |
SoundEx code - N423 naelstring - 1 freq no-looked-for - 1 freq nihilistic - 1 freq nlscotland - 1 freq |
MetaPhone code - NHLSTK nihilistic - 1 freq |
NIHILISTIC |
| Time to execute Levenshtein function - 0.221134 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.368401 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.027653 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.037279 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.000918 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. |