Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
vrochtin (0) - 2 freq wrochtin (1) - 1 freq crochlin (2) - 1 freq drochlin (2) - 2 freq brichtin (2) - 1 freq rochlin (2) - 1 freq richtin (2) - 3 freq frichtin (2) - 1 freq vrocht (2) - 35 freq drochtit (2) - 1 freq rightin (3) - 1 freq grectin (3) - 1 freq druchtit (3) - 1 freq yachtin (3) - 1 freq rocketin (3) - 1 freq vrockt (3) - 1 freq richtit (3) - 2 freq hoochin (3) - 2 freq trottin (3) - 11 freq rootin (3) - 3 freq drochaid (3) - 2 freq fechtin (3) - 164 freq urchin (3) - 2 freq roastin (3) - 23 freq procht (3) - 3 freq |
vrochtin (0) - 2 freq wrochtin (2) - 1 freq richtin (3) - 3 freq frichtin (3) - 1 freq brichtin (3) - 1 freq vrocht (3) - 35 freq crichton (4) - 14 freq vricht (4) - 6 freq frichten (4) - 8 freq wrouchten (4) - 1 freq brichten (4) - 9 freq brechtian (4) - 1 freq vrichts (4) - 1 freq drauchtin (4) - 1 freq rochlin (4) - 1 freq drochlin (4) - 2 freq crochlin (4) - 1 freq drochtit (4) - 1 freq brocht (5) - 733 freq plichtin (5) - 1 freq hechtin (5) - 1 freq vocation (5) - 2 freq frichtnin (5) - 3 freq brochan (5) - 3 freq sechtin (5) - 1 freq |
SoundEx code - V623 varsity - 9 freq variegated - 1 freq virused - 1 freq vrocht - 35 freq vrockt - 1 freq versities - 4 freq versity - 11 freq varsity's - 2 freq versatile - 4 freq versed - 4 freq vricht - 6 freq verstummen - 1 freq varsitie - 3 freq vrichts - 1 freq 'varsity - 1 freq varstled - 1 freq versatility - 2 freq vrochtin - 2 freq voyeuristic - 1 freq veracity - 2 freq varged - 1 freq vrsdin - 1 freq |
MetaPhone code - FRXTN frichten - 8 freq frichtin - 1 freq vrochtin - 2 freq fritchtin - 1 freq |
VROCHTIN |
Time to execute Levenshtein function - 0.332555 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.382971 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.028910 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.041645 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.000850 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. |