| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kwintra (0) - 3 freq kintra (1) - 251 freq kintrae (2) - 46 freq wintry (2) - 5 freq kintras (2) - 57 freq kintra' (2) - 1 freq switha (3) - 1 freq sinatra (3) - 3 freq wintery (3) - 5 freq contra (3) - 2 freq klintie (3) - 1 freq winna (3) - 384 freq wina (3) - 1 freq intaa (3) - 1 freq wint (3) - 628 freq winfa (3) - 1 freq kint (3) - 57 freq wintit (3) - 111 freq mantra (3) - 9 freq kaint (3) - 4 freq mintna (3) - 1 freq cuntra (3) - 29 freq twinty (3) - 161 freq inta (3) - 109 freq kinna (3) - 279 freq |
kwintra (0) - 3 freq kintra (2) - 251 freq wintry (3) - 5 freq kintrae (3) - 46 freq wintir (4) - 8 freq kintrie (4) - 37 freq kintyre (4) - 4 freq kintore (4) - 4 freq kwqtr (4) - 2 freq winter (4) - 427 freq wuntry (4) - 1 freq kintra' (4) - 1 freq wintery (4) - 5 freq kintras (4) - 57 freq twintie (5) - 7 freq countra (5) - 5 freq gintry (5) - 1 freq winted (5) - 40 freq rwintie (5) - 1 freq intro (5) - 6 freq wunter (5) - 27 freq intry (5) - 3 freq winters (5) - 21 freq tantra (5) - 1 freq kwite (5) - 1 freq |
SoundEx code - K536 kintra - 251 freq kintraside - 8 freq kwintra - 3 freq kintrae's - 2 freq kinder - 5 freq kintrae - 46 freq kintras - 57 freq kintraeside's - 1 freq kintraeside - 5 freq kintrie - 37 freq kintyre - 4 freq kindred - 4 freq kintore - 4 freq kintra's - 11 freq kintraes - 8 freq kintrieside - 5 freq kintrie-pairt - 41 freq kintries - 4 freq kintrie's - 1 freq knitter - 2 freq kind-hertit - 1 freq kintra-side - 3 freq kintra' - 1 freq kintraman's - 1 freq €˜kintra - 1 freq kintramen - 1 freq kintra-men - 1 freq kineddart - 4 freq kindrick - 1 freq knitters - 1 freq kindergarten - 2 freq kintra-lad - 1 freq kmotherofcats - 12 freq kenthehorse - 1 freq knoydart - 1 freq k'nitter - 1 freq kintrawide - 1 freq |
MetaPhone code - KWNTR kwintra - 3 freq |
KWINTRA |
| Time to execute Levenshtein function - 0.203502 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.355787 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.029262 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.039372 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.000788 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. |