| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vrang (0) - 8 freq brang (1) - 2 freq rang (1) - 83 freq wrang (1) - 832 freq trang (1) - 15 freq crang (1) - 2 freq vrans (1) - 1 freq brand (2) - 51 freq €™ang (2) - 2 freq fang (2) - 12 freq 'lang (2) - 5 freq sang (2) - 623 freq pran (2) - 1 freq raag (2) - 3 freq drane (2) - 1 freq vying (2) - 1 freq kiang (2) - 1 freq bran (2) - 11 freq grand (2) - 363 freq gran' (2) - 1 freq rana (2) - 1 freq rank (2) - 43 freq wran (2) - 2 freq laang (2) - 3 freq bang (2) - 100 freq |
vrang (0) - 8 freq vrans (2) - 1 freq brang (2) - 2 freq trang (2) - 15 freq crang (2) - 2 freq wrang (2) - 832 freq rang (2) - 83 freq ring (3) - 218 freq tring (3) - 1 freq wring (3) - 10 freq raing (3) - 1 freq dring (3) - 1 freq varg (3) - 6 freq wrung (3) - 9 freq range (3) - 93 freq wrong (3) - 140 freq rung (3) - 25 freq varying (3) - 7 freq prong (3) - 1 freq orange (3) - 140 freq bring (3) - 554 freq grange (3) - 4 freq brung (3) - 21 freq rorang (3) - 1 freq vying (3) - 1 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 - FRNK veronica - 3 freq frank - 66 freq frankie - 10 freq franc - 6 freq vrang - 8 freq frunky - 2 freq frieng - 1 freq pharaonic - 1 freq franca - 8 freq firing - 3 freq frunkie - 1 freq frankieÂ’ - 1 freq franko - 1 freq |
VRANG |
| Time to execute Levenshtein function - 0.204186 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.341073 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.027399 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.036919 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.000878 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. |