| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quoybeezie (0) - 1 freq queerie (4) - 8 freq queenie (4) - 3 freq quoymirris (5) - 1 freq queetin (5) - 1 freq beerie (5) - 7 freq queenies (5) - 1 freq squeeze (5) - 57 freq fulyerie (5) - 1 freq squeezin (5) - 9 freq queeit (5) - 2 freq quietie (5) - 1 freq dundreerie (5) - 5 freq quaetlie (5) - 2 freq queelin (5) - 1 freq queeried (5) - 3 freq dundeerie (5) - 1 freq beefie (5) - 1 freq deezie (5) - 1 freq upheeze (5) - 4 freq queenis (5) - 1 freq quoyclerks (5) - 1 freq quebecois (5) - 1 freq yeeze (5) - 1 freq soberlie (5) - 1 freq |
quoybeezie (0) - 1 freq queenie (6) - 3 freq queerie (6) - 8 freq quebecois (7) - 1 freq yeeze (7) - 1 freq queenis (7) - 1 freq beefie (7) - 1 freq beenie (7) - 5 freq deezie (7) - 1 freq queynie (7) - 1 freq quebec (7) - 3 freq qubare (7) - 1 freq queazy (7) - 1 freq queeried (7) - 3 freq beez (7) - 1 freq upheeze (7) - 4 freq queeit (7) - 2 freq beerie (7) - 7 freq queenies (7) - 1 freq squeeze (7) - 57 freq quietie (7) - 1 freq queelin (7) - 1 freq quaetlie (7) - 2 freq queetin (7) - 1 freq bozie (7) - 1 freq |
SoundEx code - Q120 quebec - 3 freq quips - 2 freq quoybeezie - 1 freq qubsu - 1 freq qkqjcfg - 1 freq qbjqscew - 1 freq qpic - 1 freq qpx - 1 freq qjwfk - 1 freq qpvuq - 1 freq qjbfj - 4 freq qyfws - 1 freq qvzca - 1 freq qopwyuj - 1 freq qxpg - 1 freq qcuvvagqxq - 1 freq qiefwkkz - 1 freq qfc - 1 freq |
MetaPhone code - KBS cubes - 12 freq cubs - 7 freq gubs - 1 freq gabs - 3 freq coyboys - 1 freq 'cowboys' - 1 freq gobs - 4 freq quoybeezie - 1 freq cobs - 1 freq gabsie - 1 freq kubis - 3 freq cooboys - 4 freq cowboys - 3 freq cabbies - 1 freq cobbis - 1 freq gobbs - 20 freq qubsu - 1 freq cabesy - 5 freq cbus - 1 freq keeeeebzy - 2 freq |
QUOYBEEZIE |
| Time to execute Levenshtein function - 0.199667 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.353413 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.027429 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.036784 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.001020 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. |