| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gender (0) - 19 freq ngender (1) - 1 freq fender (1) - 10 freq render (1) - 8 freq sender (1) - 2 freq hender (1) - 1 freq tender (1) - 23 freq gener (1) - 1 freq bender (1) - 5 freq lender (1) - 2 freq gander (1) - 14 freq reider (2) - 5 freq eider (2) - 3 freq sunder (2) - 1 freq neider (2) - 1 freq hunder (2) - 96 freq grinder (2) - 2 freq center (2) - 9 freq tenser (2) - 1 freq pander (2) - 1 freq denier (2) - 1 freq wedder (2) - 3 freq herder (2) - 3 freq enter (2) - 74 freq heeder (2) - 1 freq |
gender (0) - 19 freq gander (1) - 14 freq gener (2) - 1 freq bender (2) - 5 freq tender (2) - 23 freq lender (2) - 2 freq hender (2) - 1 freq ngender (2) - 1 freq fender (2) - 10 freq sender (2) - 2 freq render (2) - 8 freq ganner (3) - 1 freq under (3) - 447 freq goner (3) - 4 freq 'under (3) - 2 freq ginger (3) - 121 freq gulder (3) - 24 freq rendir (3) - 1 freq ganfer (3) - 2 freq girder (3) - 2 freq winder (3) - 112 freq lander (3) - 13 freq yunder (3) - 10 freq zander (3) - 43 freq cinder (3) - 2 freq |
SoundEx code - G536 gantries - 1 freq gentry - 15 freq gantry - 6 freq gander - 14 freq gentrie - 5 freq gantrie - 1 freq geometry - 5 freq gender-tension - 1 freq gunderman - 1 freq gintry - 1 freq gentrie-lik - 1 freq gender - 19 freq gantrees - 1 freq gentrice - 1 freq gantry's - 1 freq gentrifeed - 1 freq €˜gender - 1 freq genderstereotyped - 1 freq gumtree - 1 freq gender-pish - 1 freq |
MetaPhone code - JNTR janitor - 6 freq gentry - 15 freq jondrew - 2 freq gentrie - 5 freq gintry - 1 freq gender - 19 freq jantry - 1 freq €˜gender - 1 freq johndeere - 3 freq |
GENDER |
| Time to execute Levenshtein function - 0.187574 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.341908 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.027848 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.038296 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.000838 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. |