| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jeeled (0) - 4 freq jeered (1) - 1 freq reeled (1) - 6 freq peeled (1) - 17 freq keeled (1) - 5 freq heeled (1) - 1 freq gelled (2) - 1 freq jeeve (2) - 1 freq meeved (2) - 22 freq reeved (2) - 2 freq reelee (2) - 1 freq jeelt (2) - 16 freq meeler (2) - 1 freq jewelled (2) - 5 freq waeled (2) - 5 freq jyled (2) - 2 freq haeled (2) - 2 freq heeld (2) - 2 freq jeeves (2) - 3 freq reesled (2) - 1 freq meeded (2) - 1 freq jeyned (2) - 2 freq weeded (2) - 1 freq feezed (2) - 1 freq geeked (2) - 1 freq |
jeeled (0) - 4 freq jyled (2) - 2 freq jiled (2) - 5 freq jailed (2) - 1 freq heeled (2) - 1 freq jeered (2) - 1 freq reeled (2) - 6 freq peeled (2) - 17 freq keeled (2) - 5 freq jeel (3) - 7 freq heiled (3) - 1 freq jeelie (3) - 11 freq yelled (3) - 20 freq jeelies (3) - 4 freq jeelin (3) - 5 freq jellied (3) - 1 freq sealed (3) - 17 freq healed (3) - 10 freq jeellied (3) - 1 freq jeels (3) - 3 freq reled (3) - 1 freq jeelit (3) - 2 freq jeelip (3) - 2 freq veiled (3) - 3 freq jeely (3) - 45 freq |
SoundEx code - J430 jyled - 2 freq jeelt - 16 freq jilday - 1 freq jillet - 2 freq jewelled - 5 freq jeelit - 2 freq jowlt - 1 freq jollity - 2 freq juliet - 7 freq jiled - 5 freq jolt - 7 freq jeeled - 4 freq jowelt - 2 freq jellied - 1 freq jeellied - 1 freq jailed - 1 freq jlhd - 1 freq jei'lt - 2 freq jqliuhd - 1 freq julidy - 2 freq |
MetaPhone code - JLT jyled - 2 freq gelled - 1 freq jeelt - 16 freq jilday - 1 freq giled - 1 freq jillet - 2 freq geelt - 2 freq geeeeold - 1 freq gild - 1 freq jeelit - 2 freq gel't - 1 freq gilt - 2 freq gilead - 2 freq giltee - 2 freq jowlt - 1 freq jollity - 2 freq juliet - 7 freq gelt - 1 freq jiled - 5 freq jolt - 7 freq jeeled - 4 freq gealt - 3 freq geelit - 1 freq jellied - 1 freq jeellied - 1 freq jailed - 1 freq jlhd - 1 freq jei'lt - 2 freq julidy - 2 freq |
JEELED |
| Time to execute Levenshtein function - 0.194225 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.328374 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.028515 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.038562 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.000820 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. |