Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
visiting (0) - 15 freq visitin (1) - 22 freq visitir (2) - 1 freq listing (2) - 4 freq visitn (2) - 1 freq vomiting (2) - 1 freq 'visitin (2) - 1 freq visitit (2) - 2 freq veisitin (2) - 4 freq limiting (2) - 1 freq righting (3) - 1 freq sichting (3) - 1 freq posting (3) - 6 freq visited (3) - 23 freq visions (3) - 7 freq aisling (3) - 1 freq twiting (3) - 1 freq visits (3) - 24 freq igniting (3) - 1 freq pissing (3) - 2 freq wisening (3) - 1 freq resting (3) - 4 freq sting (3) - 12 freq biting (3) - 1 freq viking (3) - 60 freq |
visiting (0) - 15 freq visitin (2) - 22 freq veisitin (3) - 4 freq vomiting (3) - 1 freq visitn (3) - 1 freq listing (3) - 4 freq wasting (4) - 6 freq veesitin (4) - 31 freq festing (4) - 1 freq sting (4) - 12 freq suiting (4) - 1 freq costing (4) - 1 freq lusting (4) - 1 freq voting (4) - 27 freq casting (4) - 1 freq testing (4) - 12 freq tasting (4) - 5 freq resting (4) - 4 freq fasting (4) - 1 freq existing (4) - 1 freq lasting (4) - 3 freq dusting (4) - 1 freq visitit (4) - 2 freq limiting (4) - 1 freq posting (4) - 6 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.197016 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.332763 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.026998 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.036959 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.000827 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. |