| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gender (0) - 19 freq gander (1) - 12 freq fender (1) - 10 freq hender (1) - 1 freq sender (1) - 2 freq render (1) - 8 freq ngender (1) - 1 freq bender (1) - 4 freq lender (1) - 2 freq tender (1) - 23 freq gener (1) - 1 freq hende (2) - 1 freq bunder (2) - 1 freq wunder (2) - 26 freq geezer (2) - 6 freq gendy (2) - 1 freq rander (2) - 2 freq feeder (2) - 5 freq genie (2) - 7 freq rendir (2) - 1 freq reeder (2) - 3 freq yunder (2) - 10 freq genert (2) - 1 freq binder (2) - 22 freq kinder (2) - 5 freq |
gender (0) - 19 freq gander (1) - 12 freq bender (2) - 4 freq tender (2) - 23 freq gener (2) - 1 freq ngender (2) - 1 freq lender (2) - 2 freq render (2) - 8 freq sender (2) - 2 freq hender (2) - 1 freq fender (2) - 10 freq cinder (3) - 2 freq dunder (3) - 5 freq wander (3) - 36 freq finder (3) - 5 freq lander (3) - 13 freq rinder (3) - 1 freq goner (3) - 4 freq meander (3) - 2 freq gadder (3) - 19 freq endear (3) - 1 freq sunder (3) - 1 freq neider (3) - 1 freq grinder (3) - 2 freq sander (3) - 1 freq |
SoundEx code - G536 gantries - 1 freq gentry - 15 freq gantry - 6 freq gentrie - 5 freq gantrie - 1 freq gander - 12 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.235211 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.367315 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.027955 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.039072 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.000830 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. |