Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
eiss-shintie (0) - 1 freq eiss-shokkils (5) - 1 freq missmcvittie (5) - 2 freq dissapintin (5) - 1 freq soshietie (5) - 2 freq disapointit (6) - 1 freq lint-white (6) - 1 freq sinshine (6) - 10 freq dog-shite (6) - 1 freq dissapyntin (6) - 1 freq seivintie (6) - 1 freq shinnie (6) - 1 freq gob-shite (6) - 1 freq birdshite (6) - 2 freq ers-spikkin (6) - 1 freq mischancie (6) - 1 freq lick-spittle (6) - 2 freq disseminate (6) - 2 freq shantie (6) - 1 freq hirs-shae (6) - 1 freq kilspindie (6) - 1 freq assassinatit (6) - 1 freq yin-mintit (6) - 1 freq tesswhite (6) - 1 freq assasinate (6) - 1 freq |
eiss-shintie (0) - 1 freq assasinate (8) - 1 freq soshietie (8) - 2 freq mis-spent (8) - 1 freq assassinate (8) - 1 freq rosy-white (9) - 1 freq shantie (9) - 1 freq dug-shite (9) - 1 freq sunshine (9) - 79 freq mid-shift (9) - 1 freq disseminate (9) - 2 freq assistant (9) - 19 freq assassinatit (9) - 1 freq dog-shite (9) - 1 freq eiss-shokkils (9) - 1 freq dissapintin (9) - 1 freq gob-shite (9) - 1 freq sinshine (9) - 10 freq make-shift (10) - 1 freq shinty (10) - 14 freq snashit (10) - 1 freq smushin (10) - 4 freq assessin (10) - 4 freq shushin (10) - 1 freq pusshin (10) - 1 freq |
SoundEx code - E253 ecountry - 1 freq essentially - 6 freq essential - 47 freq eccentrics - 1 freq eccentric - 2 freq ex-model - 1 freq ezentn - 1 freq eccent - 4 freq 'essential - 1 freq essentials - 3 freq exeunt - 4 freq ecantrip - 1 freq essentiallie - 1 freq ee-candy - 1 freq eiss-shintie - 1 freq €œessential - 1 freq essention - 1 freq exeemed - 1 freq eecmdqqi - 1 freq eoghand - 1 freq ex-meadow - 1 freq eqomtfhgto - 1 freq ekxmduy - 1 freq ekeinootmorehoursfaedaday - 1 freq |
MetaPhone code - ESXNT eiss-shintie - 1 freq |
EISS-SHINTIE |
Time to execute Levenshtein function - 0.385797 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.587163 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.028891 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.070885 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.000896 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. |