Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
visiting (0) - 15 freq visitin (1) - 22 freq vomiting (2) - 1 freq 'visitin (2) - 1 freq visitir (2) - 1 freq visitit (2) - 2 freq listing (2) - 4 freq limiting (2) - 1 freq veisitin (2) - 4 freq visitn (2) - 1 freq wishing (3) - 7 freq vissiein (3) - 3 freq lilting (3) - 1 freq hitting (3) - 4 freq fasting (3) - 1 freq diluting (3) - 2 freq gitting (3) - 12 freq editing (3) - 3 freq visitor (3) - 23 freq ristin (3) - 3 freq insisting (3) - 1 freq dissing (3) - 1 freq lusting (3) - 1 freq tistin (3) - 1 freq issuing (3) - 1 freq |
visiting (0) - 15 freq visitin (2) - 22 freq listing (3) - 4 freq visitn (3) - 1 freq veisitin (3) - 4 freq vomiting (3) - 1 freq veesitin (4) - 31 freq dusting (4) - 1 freq lasting (4) - 3 freq testing (4) - 12 freq lusting (4) - 1 freq suiting (4) - 1 freq existing (4) - 1 freq resting (4) - 4 freq costing (4) - 1 freq wasting (4) - 6 freq tasting (4) - 5 freq fasting (4) - 1 freq limiting (4) - 1 freq visitit (4) - 2 freq visitir (4) - 1 freq 'visitin (4) - 1 freq sting (4) - 12 freq posting (4) - 6 freq festing (4) - 1 freq |
SoundEx code - V235 veesitin - 31 freq vexation - 5 freq veisitin - 4 freq victimised - 1 freq victim - 29 freq victims - 10 freq 'visitin - 1 freq veectim - 3 freq vestments - 1 freq veeseeten - 1 freq vacation - 2 freq vocation - 2 freq visitin - 22 freq visiting - 15 freq vestenfraa - 1 freq vastness - 1 freq veectims - 2 freq veictim - 1 freq €”veesitin - 1 freq vkdmxomjbp - 1 freq visitn - 1 freq |
MetaPhone code - FSTNK fasting - 1 freq visiting - 15 freq feasting - 1 freq festing - 1 freq |
VISITING |
Time to execute Levenshtein function - 0.210761 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.383692 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.027592 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.037032 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.000888 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. |