| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| verge (0) - 9 freq veige (1) - 2 freq serge (1) - 4 freq verve (1) - 2 freq veage (1) - 9 freq lerge (1) - 1 freq verges (1) - 5 freq venge (1) - 1 freq verse (1) - 127 freq merge (1) - 4 freq verie (1) - 23 freq verde (1) - 2 freq versie (2) - 1 freq veg (2) - 17 freq ferget (2) - 2 freq cherge (2) - 4 freq erae (2) - 1 freq eerie (2) - 34 freq pege (2) - 2 freq varg (2) - 6 freq vega (2) - 1 freq aere (2) - 1 freq merse (2) - 4 freq perce (2) - 1 freq hedge (2) - 40 freq |
verge (0) - 9 freq verie (2) - 23 freq merge (2) - 4 freq virgo (2) - 1 freq average (2) - 28 freq varg (2) - 6 freq verse (2) - 127 freq verde (2) - 2 freq veige (2) - 2 freq venge (2) - 1 freq serge (2) - 4 freq verve (2) - 2 freq veage (2) - 9 freq verges (2) - 5 freq lerge (2) - 1 freq gorge (3) - 5 freq verm (3) - 1 freq averse (3) - 6 freq torge (3) - 1 freq varse (3) - 1 freq veggi (3) - 1 freq veggie (3) - 15 freq veere (3) - 1 freq vire (3) - 2 freq surge (3) - 15 freq |
SoundEx code - V620 various - 59 freq verse - 127 freq vairse - 15 freq verge - 9 freq vera's - 3 freq versie - 1 freq virus - 57 freq vers - 1 freq versa - 4 freq verucca - 2 freq veruca - 39 freq 'veruca - 2 freq verse' - 1 freq varius - 1 freq virgo - 1 freq vawrious - 2 freq 'vairse' - 1 freq varse - 1 freq voars - 3 freq varg - 6 freq viewers - 6 freq verus - 1 freq verk - 2 freq vark - 1 freq vuark - 1 freq varck - 1 freq vork - 1 freq virk - 1 freq vyrk - 1 freq varies - 2 freq versy - 1 freq vries - 1 freq veers - 1 freq vrck - 1 freq verish - 1 freq vrajs - 1 freq virkie - 1 freq varios - 1 freq viris - 1 freq |
MetaPhone code - FRJ forge - 14 freq 'forgie - 3 freq forgie - 92 freq fridge - 59 freq fergie - 121 freq 'fergie - 1 freq verge - 9 freq forage - 4 freq farage - 10 freq fergie' - 1 freq freedge - 1 freq phrygia - 2 freq €œforgie - 1 freq freja - 1 freq |
VERGE |
| Time to execute Levenshtein function - 0.164332 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.320084 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.028346 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.037252 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.000840 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. |