| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quhaams (0) - 1 freq quhat's (2) - 1 freq quhaar (2) - 8 freq quham (2) - 1 freq quhairs (2) - 1 freq quhais (2) - 1 freq qualms (2) - 4 freq quhan (3) - 51 freq chaas (3) - 2 freq quats (3) - 1 freq quhair (3) - 1 freq laams (3) - 1 freq haa's (3) - 1 freq hams (3) - 10 freq quhiles (3) - 3 freq queats (3) - 2 freq whaaps (3) - 1 freq quhar (3) - 24 freq quhase (3) - 1 freq haas (3) - 10 freq whaals (3) - 4 freq quha (3) - 17 freq haals (3) - 9 freq quarts (3) - 1 freq qualm (3) - 2 freq |
quhaams (0) - 1 freq quhais (3) - 1 freq quhairs (3) - 1 freq qualms (3) - 4 freq quham (3) - 1 freq quhase (4) - 1 freq quhom (4) - 1 freq hams (4) - 10 freq haims (4) - 4 freq haums (4) - 1 freq quhiles (4) - 3 freq quhat's (4) - 1 freq quhaar (4) - 8 freq haimes (5) - 3 freq bahamas (5) - 2 freq shames (5) - 2 freq chums (5) - 13 freq haads (5) - 17 freq whaas (5) - 1 freq queans (5) - 5 freq homs (5) - 1 freq haans (5) - 26 freq hames (5) - 51 freq hums (5) - 3 freq thooms (5) - 8 freq |
SoundEx code - Q520 queen's - 55 freq queens - 40 freq quine's - 18 freq quines - 156 freq quines' - 2 freq queyn's - 2 freq quinie's - 12 freq queans - 5 freq queanie's - 1 freq quinies - 7 freq quhaams - 1 freq quango - 1 freq quince - 2 freq quench - 1 freq queenis - 1 freq quynes - 1 freq quines - 1 freq qnksa - 1 freq quins - 1 freq qyms - 1 freq qnq - 1 freq qamjs - 2 freq qmg - 1 freq quinikie - 1 freq queenies - 1 freq qmqe - 1 freq qmj - 1 freq |
MetaPhone code - KHMS quhaams - 1 freq |
QUHAAMS |
| Time to execute Levenshtein function - 0.188818 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.400457 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.029845 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.037682 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.000870 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. |