| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| purpie-blue (0) - 1 freq purpie-wulk (4) - 1 freq purelie (5) - 1 freq purple-green (5) - 1 freq grey-blue (5) - 3 freq pirliecue (5) - 1 freq purple (5) - 110 freq superglue (5) - 9 freq ice-blue (5) - 1 freq curieuslye (5) - 1 freq possieble (5) - 1 freq puggie-like (5) - 1 freq blaik-blue (5) - 1 freq purpose-like (5) - 1 freq permeable (5) - 1 freq purpie (5) - 23 freq priestlie (5) - 1 freq purnell (6) - 1 freq truible (6) - 1 freq puil-she (6) - 1 freq prnielk (6) - 1 freq mirrie-lik (6) - 1 freq humphie-back (6) - 1 freq pirliecules (6) - 1 freq particule (6) - 1 freq |
purpie-blue (0) - 1 freq purpie-wulk (6) - 1 freq purple (7) - 110 freq grey-blue (7) - 3 freq permeable (7) - 1 freq printable (8) - 6 freq trade-able (8) - 1 freq portable (8) - 9 freq parable (8) - 54 freq purposeful (8) - 1 freq prubablee (8) - 1 freq prestable (8) - 2 freq purposely (8) - 1 freq priestlie (8) - 1 freq problee (8) - 1 freq preferable (8) - 3 freq profitable (8) - 4 freq possieble (8) - 1 freq purpley (8) - 1 freq purelie (8) - 1 freq ice-blue (8) - 1 freq probable (8) - 4 freq palpable (8) - 3 freq blaik-blue (8) - 1 freq purpie (8) - 23 freq |
SoundEx code - P611 probably - 268 freq probabeelity - 1 freq prubablee - 1 freq prubbably - 1 freq pre-fab - 1 freq purpie-blue - 1 freq probability - 2 freq prefabs - 2 freq prefab - 3 freq probable - 4 freq probably - 3 freq probably - 2 freq probabilities - 1 freq probably - 1 freq |
MetaPhone code - PRPBL purpie-blue - 1 freq |
PURPIE-BLUE |
| Time to execute Levenshtein function - 0.222027 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.379752 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.028792 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.043662 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.000836 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. |