Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
jurymen (0) - 22 freq juryman (1) - 1 freq jury-men (1) - 5 freq jurgen (2) - 1 freq wurkmen (2) - 1 freq lumen (3) - 1 freq dug-men (3) - 4 freq laymen (3) - 1 freq curseen (3) - 1 freq turneen (3) - 1 freq dugmen (3) - 2 freq wurmman (3) - 1 freq crymes (3) - 1 freq judgment (3) - 7 freq rymes (3) - 1 freq burden (3) - 24 freq wirkmen (3) - 1 freq bremen (3) - 1 freq wummen (3) - 33 freq rymer (3) - 1 freq furmed (3) - 8 freq airmen (3) - 2 freq carmen (3) - 2 freq jurymen're (3) - 1 freq tureen (3) - 4 freq |
jurymen (0) - 22 freq juryman (1) - 1 freq jury-men (2) - 5 freq jurgen (3) - 1 freq furmin (4) - 1 freq jeremey (4) - 1 freq firemen (4) - 3 freq carmen (4) - 2 freq barmen (4) - 1 freq dairymen (4) - 2 freq bremen (4) - 1 freq normen (4) - 1 freq airmen (4) - 2 freq wurkmen (4) - 1 freq jurney (4) - 2 freq jammen (4) - 1 freq wumen (5) - 7 freq jargon (5) - 3 freq dairyman (5) - 2 freq foreman (5) - 5 freq jury (5) - 109 freq fermeen (5) - 1 freq jurnai (5) - 1 freq worman (5) - 1 freq jeremy (5) - 12 freq |
SoundEx code - J655 jurymen - 22 freq jurymen're - 1 freq jurmummelt - 2 freq jury-men - 5 freq juryman - 1 freq journeyman - 2 freq jurmummled - 1 freq journomikey - 1 freq |
MetaPhone code - JRMN jurymen - 22 freq german - 156 freq jury-men - 5 freq juryman - 1 freq girmny - 1 freq 'german - 2 freq germany - 34 freq germane - 1 freq germanie - 4 freq gerrymooney - 1 freq |
JURYMEN |
Time to execute Levenshtein function - 0.213674 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.422886 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.061119 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.043944 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.001076 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. |