Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nostradamus (0) - 2 freq nooradays (4) - 1 freq stravaigs (5) - 6 freq nowadays (5) - 22 freq straabs (5) - 1 freq nostrils (5) - 20 freq rosgrams (5) - 1 freq ootadaeks (5) - 3 freq straddles (5) - 1 freq nooadaes (5) - 1 freq ootrageous (5) - 3 freq noo'adays (5) - 2 freq outrageous (5) - 3 freq natrads (5) - 1 freq portrayals (5) - 1 freq straas (5) - 1 freq nouadays (5) - 44 freq nooaday's (5) - 1 freq notre-dame's (5) - 1 freq noo-adays (5) - 2 freq potamus (5) - 1 freq poraamis (5) - 1 freq streams (5) - 39 freq nooadays (5) - 90 freq poetrydayuk (5) - 3 freq |
nostradamus (0) - 2 freq streams (7) - 39 freq natrads (7) - 1 freq nostrils (7) - 20 freq nasturtiums (7) - 2 freq nooradays (7) - 1 freq amsterdam (8) - 5 freq astrid's (8) - 21 freq stadiums (8) - 3 freq straands (8) - 1 freq norrads (8) - 1 freq stramps (8) - 1 freq yesterdays (8) - 3 freq yesterday's (8) - 5 freq yisterdays (8) - 8 freq yisterday's (8) - 5 freq strides (8) - 16 freq stairms (8) - 1 freq bestrides (8) - 1 freq stroms (8) - 1 freq stoarms (8) - 1 freq introdyeus (8) - 1 freq straabs (8) - 1 freq rosgrams (8) - 1 freq stravaigs (8) - 6 freq |
SoundEx code - N236 nocturne's - 1 freq nostrils - 20 freq nicht-air - 5 freq nosethirles - 1 freq nocturnal - 3 freq next-door - 2 freq nectar - 9 freq nostradamus - 2 freq neestdoor - 1 freq nastier - 1 freq nocturne - 2 freq nixtdoor - 1 freq nixt-dorr - 1 freq nasturtiums - 2 freq neesteran - 1 freq nightdress - 1 freq naist-door's - 1 freq negator - 6 freq nictheárlaich - 1 freq neist-door - 1 freq nicht-work - 1 freq nostre - 1 freq nostril - 1 freq nostril-flarin - 1 freq nicktroyftof - 2 freq nuxtarn - 1 freq nqtdrtgeqz - 1 freq |
MetaPhone code - NSTRTMS nostradamus - 2 freq nasturtiums - 2 freq |
NOSTRADAMUS |
Time to execute Levenshtein function - 0.600952 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 - 1.215937 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.090301 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.104453 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.001005 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. |