| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qwine (0) - 2 freq twine (1) - 21 freq wine (1) - 272 freq quine (1) - 588 freq swine (1) - 27 freq qine (1) - 1 freq dwine (1) - 19 freq chine (2) - 2 freq ewin (2) - 1 freq opine (2) - 1 freq zine (2) - 2 freq wines (2) - 8 freq heine (2) - 3 freq win (2) - 980 freq wiye (2) - 2 freq aine (2) - 4 freq paine (2) - 5 freq quine' (2) - 2 freq twice (2) - 188 freq wone (2) - 4 freq wined (2) - 4 freq rhine (2) - 2 freq reine (2) - 2 freq sine (2) - 20 freq dine (2) - 26 freq |
qwine (0) - 2 freq qine (2) - 1 freq swine (2) - 27 freq dwine (2) - 19 freq quine (2) - 588 freq twine (2) - 21 freq wine (2) - 272 freq quene (3) - 12 freq wino (3) - 2 freq twin (3) - 44 freq wane (3) - 12 freq winae (3) - 2 freq wyne (3) - 16 freq quinie (3) - 82 freq swne (3) - 1 freq dwiny (3) - 1 freq qwik (3) - 4 freq wina (3) - 1 freq quinne (3) - 2 freq awin (3) - 5 freq quiney (3) - 5 freq qin (3) - 1 freq win (3) - 980 freq swyne (3) - 1 freq dwyne (3) - 23 freq |
SoundEx code - Q500 queen - 643 freq quine - 588 freq queyn - 3 freq queynie - 1 freq quinie - 82 freq qu'on - 1 freq qwine - 2 freq 'queen - 1 freq queenie - 3 freq quean - 5 freq quhan - 51 freq quine' - 2 freq queuein - 3 freq quyne - 4 freq quene - 12 freq queuin - 3 freq quinnie - 7 freq quhen - 4 freq quhom - 1 freq queen- - 1 freq qin - 1 freq quiney - 5 freq €˜queen - 1 freq qan - 1 freq €œquhan - 5 freq quham - 1 freq quinne - 2 freq qon - 1 freq qmh - 1 freq qmy - 1 freq qwmi - 1 freq quineÂ’ - 1 freq queen' - 1 freq qnu - 1 freq quÂ’un - 2 freq qn - 5 freq qm - 1 freq qjm - 1 freq qqmw - 1 freq ‘queen - 1 freq qine - 1 freq |
MetaPhone code - KWN cawin - 62 freq gawin - 26 freq gowan - 16 freq 'cawin - 1 freq qwine - 2 freq caawen - 1 freq goween - 1 freq cowan - 7 freq cowin - 1 freq gawain - 1 freq gwennie - 1 freq |
QWINE |
| Time to execute Levenshtein function - 0.926953 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 - 1.654620 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.100820 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.117562 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.000922 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. |