| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quheill (0) - 1 freq quhill (1) - 1 freq quill (2) - 15 freq quhile (2) - 5 freq quhilk (2) - 4 freq quell (2) - 5 freq cheils (3) - 33 freq chill (3) - 45 freq shrill (3) - 20 freq queen'll (3) - 3 freq whill (3) - 13 freq muse'll (3) - 1 freq heile (3) - 1 freq quhen (3) - 4 freq shill (3) - 4 freq wheils (3) - 1 freq quile (3) - 1 freq heil (3) - 1 freq muthill (3) - 1 freq 'hell (3) - 1 freq tchell (3) - 1 freq he'll (3) - 422 freq aweill (3) - 6 freq uphill (3) - 3 freq queekly (3) - 6 freq |
quheill (0) - 1 freq quhill (1) - 1 freq quell (3) - 5 freq quhilk (3) - 4 freq quhile (3) - 5 freq quill (3) - 15 freq hill (4) - 468 freq 'hell (4) - 1 freq ahill (4) - 1 freq uphill (4) - 3 freq hell (4) - 375 freq quelle (4) - 1 freq shell (4) - 39 freq 'hill (4) - 1 freq thell (4) - 4 freq jhill (4) - 19 freq shill (4) - 4 freq quhiles (4) - 3 freq haill (4) - 411 freq whill (4) - 13 freq chill (4) - 45 freq thill (4) - 1 freq theyll (4) - 5 freq quietly (5) - 61 freq oneill (5) - 2 freq |
SoundEx code - Q400 quelle - 1 freq quile - 1 freq quill - 15 freq quell - 5 freq qual - 3 freq quail - 5 freq qweel - 1 freq quhile - 5 freq quyhle - 1 freq quheill - 1 freq €œqually - 1 freq qkxggjlo - 1 freq qlw - 1 freq qually - 1 freq qalye - 1 freq qgl - 1 freq quhill - 1 freq |
MetaPhone code - KHL keyhole - 5 freq quhile - 5 freq quheill - 1 freq quhill - 1 freq |
QUHEILL |
| Time to execute Levenshtein function - 0.332764 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.581974 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.031836 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.071830 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.000978 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. |