| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vergin (0) - 2 freq vermin (1) - 3 freq verging (1) - 1 freq virgin (1) - 33 freq vengin (1) - 1 freq jerkin (2) - 2 freq verie (2) - 23 freq kervin (2) - 4 freq gertin (2) - 1 freq veggie (2) - 15 freq avertin (2) - 1 freq dargin (2) - 7 freq fertin (2) - 1 freq avengin (2) - 1 freq mertin (2) - 2 freq herrin (2) - 23 freq varyin (2) - 5 freq emergin (2) - 6 freq veggio (2) - 2 freq forgin (2) - 1 freq gerkin (2) - 1 freq verge (2) - 9 freq 'virgin (2) - 1 freq virgil (2) - 1 freq merkin (2) - 6 freq |
vergin (0) - 2 freq virgin (1) - 33 freq averagin (2) - 1 freq vengin (2) - 1 freq verging (2) - 1 freq vermin (2) - 3 freq everhin (3) - 1 freq virgyne (3) - 1 freq divergin (3) - 1 freq virginia (3) - 7 freq veerin (3) - 1 freq vernon (3) - 1 freq bargin (3) - 2 freq vigin (3) - 1 freq surgin (3) - 2 freq gorgin (3) - 1 freq verges (3) - 5 freq bergen (3) - 2 freq ergan (3) - 1 freq margin (3) - 3 freq vegan (3) - 12 freq vaigin (3) - 4 freq version (3) - 143 freq vaegin (3) - 1 freq jirgin (3) - 2 freq |
SoundEx code - V625 version - 143 freq virgin - 33 freq vrusum - 1 freq vairsioun - 17 freq virginity - 1 freq virginia - 7 freq vergin - 2 freq versions - 36 freq versiouns - 1 freq versioun - 1 freq virginal - 2 freq virigens - 1 freq versant - 2 freq virgin's - 1 freq 'virgin - 1 freq vershun - 2 freq vairsions - 10 freq vairsiouns - 5 freq verschwunden - 1 freq vairsin - 1 freq vairsion - 20 freq virrsome - 6 freq virgyne - 1 freq virginis - 1 freq verging - 1 freq virginals - 1 freq varshini - 16 freq €˜versions - 1 freq vrgnja - 1 freq virginmedia - 1 freq virginactiveuk - 1 freq virginatlantic - 1 freq virginradiouk - 1 freq |
MetaPhone code - FRJN forgiein - 3 freq forgien - 42 freq virgin - 33 freq virginia - 7 freq vergin - 2 freq 'virgin - 1 freq forgein - 1 freq virgyne - 1 freq forgin - 1 freq |
VERGIN |
| Time to execute Levenshtein function - 0.198228 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.367264 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.028881 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.038098 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.000822 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. |