| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| virginity (0) - 1 freq virginia (2) - 7 freq virginis (2) - 1 freq vicinity (2) - 8 freq dignity (3) - 30 freq virginals (3) - 1 freq infinity (3) - 1 freq virgin's (3) - 1 freq vainity (3) - 2 freq virgin (3) - 34 freq viability (3) - 1 freq virginal (3) - 2 freq trinity (3) - 11 freq divinity (3) - 2 freq signit (4) - 9 freq verging (4) - 1 freq signify (4) - 5 freq orginise (4) - 1 freq affinity (4) - 4 freq latinity (4) - 2 freq ingenuity (4) - 2 freq vergin (4) - 2 freq virtuosity (4) - 1 freq firgitin (4) - 1 freq singin't (4) - 1 freq |
virginity (0) - 1 freq virginis (3) - 1 freq virginia (3) - 7 freq virgin (4) - 34 freq vicinity (4) - 8 freq virginal (4) - 2 freq trinity (5) - 11 freq sairgint (5) - 7 freq virgyne (5) - 1 freq verging (5) - 1 freq vergin (5) - 2 freq dignity (5) - 30 freq virginals (5) - 1 freq virgin's (5) - 1 freq vainity (5) - 2 freq vanity (6) - 10 freq firgit (6) - 13 freq ginty (6) - 4 freq variant (6) - 16 freq sairgent (6) - 2 freq versant (6) - 2 freq indignity (6) - 1 freq versity (6) - 11 freq ignite (6) - 4 freq verdant (6) - 7 freq |
SoundEx code - V625 version - 145 freq virgin - 34 freq vrusum - 1 freq vairsioun - 17 freq virginity - 1 freq virginia - 7 freq vergin - 2 freq versions - 36 freq virrginnnnyahhhhh - 1 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 - FRJNT virginity - 1 freq |
VIRGINITY |
| Time to execute Levenshtein function - 0.265177 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.441440 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.031615 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.042254 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.000970 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. |