| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quoymirris (0) - 1 freq quoyclerks (4) - 1 freq quagmires (4) - 2 freq smirr's (5) - 1 freq quoymorhouse (5) - 1 freq quiri (5) - 1 freq quirkie (5) - 12 freq norris (5) - 1 freq quirks (5) - 4 freq quires (5) - 1 freq morris (5) - 14 freq judymurray (5) - 1 freq quhilkis (5) - 1 freq yeiris (5) - 1 freq curmurrin (5) - 1 freq mirrie (5) - 7 freq quoybeezie (5) - 1 freq marris (5) - 2 freq mirrir (5) - 1 freq cookiris (5) - 4 freq pairris (5) - 2 freq quoys (5) - 24 freq quhairs (5) - 1 freq fulmartis (5) - 1 freq quagmire (5) - 1 freq |
quoymirris (0) - 1 freq morris (6) - 14 freq mirras (6) - 2 freq quarries (6) - 4 freq smirrs (6) - 1 freq marris (6) - 2 freq quagmires (6) - 2 freq quoymorhouse (6) - 1 freq marros (7) - 1 freq smirr's (7) - 1 freq quhairs (7) - 1 freq quoyclerks (7) - 1 freq ymir's (7) - 2 freq quairs (7) - 3 freq mirrir (7) - 1 freq mairries (7) - 8 freq pairris (7) - 2 freq admirers (7) - 4 freq quires (7) - 1 freq merries (7) - 6 freq quirks (7) - 4 freq mirrie (7) - 7 freq norris (7) - 1 freq marras (7) - 6 freq bombers (8) - 7 freq |
SoundEx code - Q562 quoymirris - 1 freq quoymorhouse - 1 freq |
MetaPhone code - KMRS cameras - 10 freq comers - 2 freq gumrie's - 1 freq commerce - 4 freq camras - 1 freq quoymirris - 1 freq cumers - 1 freq comer's - 1 freq camera's - 1 freq |
QUOYMIRRIS |
| Time to execute Levenshtein function - 0.241616 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.400515 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.028675 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.038234 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. |