| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| quanter (0) - 4 freq quaeter (1) - 1 freq quater (1) - 5 freq quarter (1) - 68 freq quaiter (1) - 4 freq quaiten (2) - 1 freq punter (2) - 15 freq quanta (2) - 1 freq quaarter (2) - 1 freq ranter (2) - 1 freq bunter (2) - 8 freq quantum (2) - 5 freq canter (2) - 3 freq unter (2) - 1 freq quaver (2) - 2 freq dunter (2) - 2 freq quaters (2) - 1 freq quaaters (2) - 5 freq squatter (2) - 12 freq wunter (2) - 28 freq duander (2) - 1 freq anter (2) - 1 freq quate (2) - 161 freq shanter (2) - 18 freq quartet (2) - 2 freq |
quanter (0) - 4 freq quarter (2) - 68 freq quaiter (2) - 4 freq quaeter (2) - 1 freq quater (2) - 5 freq quieter (3) - 11 freq aunter (3) - 2 freq anter (3) - 1 freq banter (3) - 43 freq quartir (3) - 1 freq quartier (3) - 1 freq dunter (3) - 2 freq hunter (3) - 48 freq munter (3) - 1 freq wunter (3) - 28 freq quanta (3) - 1 freq canter (3) - 3 freq quantum (3) - 5 freq quaarter (3) - 1 freq ranter (3) - 1 freq punter (3) - 15 freq unter (3) - 1 freq bunter (3) - 8 freq quantity (4) - 8 freq saunter (4) - 5 freq |
SoundEx code - Q536 quandry - 1 freq quanter - 4 freq |
MetaPhone code - KNTR kintra - 251 freq country - 299 freq counter - 20 freq coonter - 72 freq quandry - 1 freq conter - 47 freq kinder - 5 freq kintrae - 46 freq gantry - 6 freq kintrie - 37 freq kintyre - 4 freq cooooouuuntry - 1 freq gander - 14 freq gantrie - 1 freq countrie - 8 freq kintore - 4 freq canter - 3 freq countrie' - 1 freq coonter' - 1 freq cuntra - 29 freq candour - 1 freq coontér - 1 freq cantar - 1 freq cuntre - 2 freq kintra' - 1 freq cuntry - 2 freq cantor - 1 freq contre - 1 freq quanter - 4 freq countra - 5 freq €˜kintra - 1 freq contra - 2 freq coontèr - 1 freq k'nitter - 1 freq country' - 1 freq country” - 1 freq |
QUANTER |
| Time to execute Levenshtein function - 0.206616 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.362139 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.028380 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.038010 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.000957 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. |