Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
spotify (0) - 13 freq stify (2) - 1 freq spoty (2) - 1 freq spotty (2) - 2 freq stotin (3) - 2 freq justify (3) - 14 freq snotty (3) - 1 freq stiy (3) - 1 freq spongy (3) - 1 freq motif (3) - 1 freq scoti (3) - 1 freq polity (3) - 4 freq potion (3) - 12 freq spottie (3) - 1 freq stoiff (3) - 2 freq policy (3) - 149 freq sporting (3) - 5 freq potfu (3) - 1 freq motifs (3) - 1 freq soity (3) - 1 freq spooky (3) - 7 freq spoutin (3) - 7 freq spiky (3) - 2 freq spoonfu (3) - 11 freq fortify (3) - 1 freq |
spotify (0) - 13 freq spitefu (3) - 1 freq spotty (3) - 2 freq stify (3) - 1 freq spoty (3) - 1 freq spots (4) - 29 freq spot (4) - 245 freq spoutin (4) - 7 freq spoof (4) - 2 freq sporf (4) - 1 freq spooty (4) - 1 freq spootin (4) - 5 freq spoonfu (4) - 11 freq potfu (4) - 1 freq spoff (4) - 4 freq spottie (4) - 1 freq spitin (4) - 2 freq stife (4) - 1 freq spiteful (5) - 2 freq spoots (5) - 12 freq stotit (5) - 1 freq spatula (5) - 2 freq spyit (5) - 3 freq septic (5) - 3 freq spicy (5) - 11 freq |
SoundEx code - S131 spitefu - 1 freq saft-plappin - 1 freq spitefully - 1 freq safety-valve - 1 freq saftfitted - 1 freq saft-fried - 1 freq spitfill - 1 freq spiteful - 2 freq spätboot - 1 freq spitfires - 1 freq spitfire - 2 freq spotify - 13 freq spotifycares - 1 freq sxgvbvdvkp - 1 freq sfootball - 2 freq shepdep - 3 freq |
MetaPhone code - SPTF spitefu - 1 freq spotify - 13 freq |
SPOTIFY |
Time to execute Levenshtein function - 0.179341 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.322881 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.027179 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.037509 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.000847 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. |