| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quhar (0) - 24 freq quear (1) - 1 freq quhaar (1) - 8 freq quhat (1) - 23 freq quha (1) - 17 freq quhaur (1) - 1 freq quham (1) - 1 freq quhan (1) - 51 freq quhair (1) - 1 freq char (2) - 2 freq qubare (2) - 1 freq quaw (2) - 2 freq 'whar (2) - 1 freq quho (2) - 2 freq quhairs (2) - 1 freq qua (2) - 2 freq har (2) - 8 freq odhar (2) - 1 freq qvha (2) - 1 freq wuhan (2) - 2 freq quat (2) - 31 freq kumar (2) - 1 freq quair (2) - 15 freq quhy (2) - 2 freq queer (2) - 146 freq |
quhar (0) - 24 freq quhair (1) - 1 freq quhaar (1) - 8 freq quhaur (1) - 1 freq quham (2) - 1 freq quhan (2) - 51 freq quha (2) - 17 freq quear (2) - 1 freq quhat (2) - 23 freq quhit (3) - 33 freq quhv (3) - 1 freq quhais (3) - 1 freq queer (3) - 146 freq shar (3) - 6 freq quhyt (3) - 5 freq quhen (3) - 4 freq quare (3) - 245 freq quhy (3) - 2 freq thar (3) - 102 freq rhar (3) - 1 freq quhase (3) - 1 freq quhom (3) - 1 freq whar (3) - 382 freq qatar (3) - 9 freq har (3) - 8 freq |
SoundEx code - Q600 queer - 146 freq queerie - 8 freq quarry - 60 freq quair - 15 freq query - 2 freq quare - 245 freq qweer - 11 freq quhaur - 1 freq quhar - 24 freq quhair - 1 freq 'quarry - 1 freq quiri - 1 freq €œquhaar - 4 freq quhaar - 8 freq queereye - 1 freq qrw - 2 freq qsgr - 1 freq qyr - 1 freq quear - 1 freq |
MetaPhone code - KHR quhaur - 1 freq quhar - 24 freq quhair - 1 freq €œquhaar - 4 freq quhaar - 8 freq |
QUHAR |
| Time to execute Levenshtein function - 0.212920 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.358802 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.027415 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.036808 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.000858 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. |