| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quhais (0) - 1 freq quhair (1) - 1 freq quhairs (1) - 1 freq quhaur (2) - 1 freq quhaar (2) - 8 freq quats (2) - 1 freq queats (2) - 2 freq queans (2) - 5 freq quairs (2) - 3 freq quhat's (2) - 1 freq quhar (2) - 24 freq quail (2) - 5 freq quhyit (2) - 2 freq quhat (2) - 23 freq quait (2) - 131 freq quair (2) - 15 freq quhit (2) - 33 freq quhaams (2) - 1 freq quhase (2) - 1 freq quhan (2) - 51 freq quha (2) - 17 freq quham (2) - 1 freq buhl's (3) - 1 freq quilts (3) - 2 freq burdis (3) - 1 freq |
quhais (0) - 1 freq quhase (2) - 1 freq quhairs (2) - 1 freq quhair (2) - 1 freq quhit (3) - 33 freq quhat (3) - 23 freq quha (3) - 17 freq quham (3) - 1 freq quhyit (3) - 2 freq quhaams (3) - 1 freq quhan (3) - 51 freq quats (3) - 1 freq quhaar (3) - 8 freq quhaur (3) - 1 freq queats (3) - 2 freq queans (3) - 5 freq quhar (3) - 24 freq quairs (3) - 3 freq quhyt (4) - 5 freq whas (4) - 17 freq phaes (4) - 1 freq 'his (4) - 10 freq quhen (4) - 4 freq ihis (4) - 6 freq haus (4) - 1 freq |
SoundEx code - Q200 quick - 374 freq queues - 9 freq quiz - 19 freq 'quiz - 1 freq quaich - 25 freq 'quick - 5 freq qwak - 1 freq quasi - 1 freq queue's - 1 freq queys - 1 freq qweek - 1 freq quoys - 24 freq queek - 22 freq qwik - 4 freq qwick - 4 freq quash - 1 freq qu'she - 2 freq quacks - 1 freq quickie - 1 freq quake - 7 freq quack - 7 freq quiche - 3 freq quïck - 6 freq quik - 5 freq queasy - 2 freq queeck - 1 freq quahog - 1 freq quaak - 3 freq €œquick - 3 freq queazy - 1 freq quyk - 1 freq €˜quick - 1 freq quhase - 1 freq quäck - 1 freq quhais - 1 freq qwqa - 1 freq qois - 1 freq qheqq - 1 freq qikz - 1 freq qsihiz - 1 freq qwaez - 1 freq qwz - 1 freq qkwskq - 1 freq quaj - 1 freq qyac - 1 freq qaz - 1 freq qis - 1 freq qejg - 1 freq qiyx - 1 freq qex - 1 freq qxyk - 1 freq qwkqs - 1 freq qiki - 1 freq |
MetaPhone code - KHS quhase - 1 freq quhais - 1 freq |
QUHAIS |
| Time to execute Levenshtein function - 0.211127 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.424220 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.028954 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.037640 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.001277 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. |