| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qubare (0) - 1 freq quare (1) - 245 freq quarz (2) - 2 freq quatre (2) - 1 freq quhar (2) - 24 freq quares (2) - 1 freq guare (2) - 1 freq quear (2) - 1 freq bare (2) - 175 freq square (2) - 164 freq quart (2) - 3 freq quhase (2) - 1 freq quate (2) - 161 freq queart (2) - 3 freq quake (2) - 7 freq squares (3) - 17 freq queans (3) - 5 freq ushare (3) - 1 freq lube (3) - 1 freq quha (3) - 17 freq cuntre (3) - 2 freq nare (3) - 1 freq sware (3) - 1 freq huband (3) - 1 freq debate (3) - 81 freq |
qubare (0) - 1 freq quare (2) - 245 freq quhar (3) - 24 freq quear (3) - 1 freq quatre (3) - 1 freq bare (3) - 175 freq uber (4) - 2 freq tuber (4) - 1 freq qub (4) - 4 freq qubsu (4) - 1 freq aubrey (4) - 4 freq queerer (4) - 2 freq quatary (4) - 1 freq queer (4) - 146 freq fibre (4) - 8 freq quarry (4) - 61 freq queirer (4) - 1 freq query (4) - 2 freq sabre (4) - 2 freq quair (4) - 15 freq quhaar (4) - 8 freq quaver (4) - 2 freq bar (4) - 493 freq bore (4) - 41 freq queir (4) - 2 freq |
SoundEx code - Q160 quiver - 6 freq quaver - 2 freq quiver' - 1 freq qubare - 1 freq qxypr - 1 freq qgphr - 1 freq |
MetaPhone code - KBR caber - 4 freq caberray - 1 freq caberay - 1 freq cobra - 5 freq caber' - 2 freq khyber - 1 freq qubare - 1 freq |
QUBARE |
| Time to execute Levenshtein function - 0.422400 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.571173 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.027676 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.071823 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.001048 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. |