Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
unrealistic (0) - 2 freq realistic (2) - 8 freq idealistic (3) - 2 freq moralistic (3) - 1 freq realisit (4) - 1 freq realitie (4) - 2 freq cabalistic (4) - 1 freq fatalistic (4) - 3 freq surrealist (4) - 1 freq realisin (4) - 13 freq unrelatit (4) - 2 freq journalistic (4) - 4 freq unremittin (4) - 1 freq nihilistic (4) - 1 freq unprelatic (4) - 1 freq unrelentin (4) - 3 freq statistic (5) - 6 freq hubristic (5) - 1 freq resistin (5) - 1 freq elastic (5) - 13 freq normalisin (5) - 1 freq unraison (5) - 1 freq atheistic (5) - 1 freq capitalistic (5) - 1 freq unbelievin (5) - 2 freq |
unrealistic (0) - 2 freq realistic (3) - 8 freq moralistic (4) - 1 freq nihilistic (5) - 1 freq idealistic (5) - 2 freq journalistic (6) - 4 freq unprelatic (6) - 1 freq unrelatit (6) - 2 freq unrelentin (6) - 3 freq fatalistic (6) - 3 freq cabalistic (6) - 1 freq realisit (6) - 1 freq naituralistic (7) - 1 freq energitic (7) - 1 freq imperialistic (7) - 1 freq voyeuristic (7) - 1 freq ballistic (7) - 2 freq enlistit (7) - 1 freq realiset (7) - 1 freq realisation (7) - 21 freq sarcastic (7) - 11 freq paralytic (7) - 2 freq airtistic (7) - 8 freq unrest (7) - 6 freq evangelistic (7) - 1 freq |
SoundEx code - U564 unrolled - 7 freq unrael - 1 freq unreal - 10 freq unnerline - 2 freq unworldly - 1 freq unrelentin - 3 freq unroult - 2 freq unnerlined - 2 freq unnerlinin - 2 freq unrelated - 2 freq unrealistic - 2 freq unnerlay - 1 freq unroyalle - 1 freq unreliable - 2 freq unrulie - 1 freq unrelatit - 2 freq unnaural - 1 freq unnerlyin - 6 freq unnerlie - 1 freq €œunrelated - 1 freq unrelentless - 1 freq unrelenting - 1 freq |
MetaPhone code - UNRLSTK unrealistic - 2 freq |
UNREALISTIC |
Time to execute Levenshtein function - 0.222912 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.389793 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.027992 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.038977 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.000927 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. |