Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
varying (0) - 7 freq varyin (1) - 5 freq warning (2) - 11 freq karling (2) - 1 freq 'trying (2) - 1 freq barking (2) - 1 freq €˜varying (2) - 1 freq erying (2) - 1 freq parking (2) - 9 freq verging (2) - 1 freq paying (2) - 13 freq burying (2) - 1 freq darting (2) - 1 freq carting (2) - 1 freq warring (2) - 1 freq valuing (2) - 3 freq darning (2) - 1 freq warming (2) - 3 freq harsing (2) - 1 freq drying (2) - 6 freq vying (2) - 1 freq marrying (2) - 1 freq yarning (2) - 1 freq farting (2) - 3 freq carling (2) - 3 freq |
varying (0) - 7 freq varyin (2) - 5 freq burying (3) - 1 freq raring (3) - 2 freq vrang (3) - 8 freq valuing (3) - 3 freq vying (3) - 1 freq drying (3) - 6 freq frying (3) - 2 freq verging (3) - 1 freq crying (3) - 16 freq varyan (3) - 1 freq daring (3) - 1 freq trying (3) - 106 freq erying (3) - 1 freq caring (3) - 5 freq wring (4) - 10 freq raing (4) - 1 freq bring (4) - 554 freq vining (4) - 17 freq firing (4) - 3 freq tiring (4) - 1 freq variant (4) - 16 freq tring (4) - 1 freq boring (4) - 14 freq |
SoundEx code - V652 veronica - 3 freq varying - 7 freq vernacular - 34 freq vrang - 8 freq vernix - 1 freq varnish - 6 freq veronx - 1 freq værniesh - 1 freq virmishin - 2 freq virmished - 1 freq vrangous - 1 freq variance - 2 freq varnished - 3 freq €˜varying - 1 freq vernaclar - 2 freq vrans - 1 freq vernaclir - 1 freq vernaklir - 3 freq |
MetaPhone code - FRYNK varying - 7 freq frying - 2 freq €˜varying - 1 freq |
VARYING |
Time to execute Levenshtein function - 0.197029 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.384231 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.034638 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.039169 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.000981 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. |