| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gilded (0) - 3 freq gelded (1) - 1 freq giled (1) - 1 freq girded (1) - 1 freq graded (2) - 3 freq eilder (2) - 1 freq gilead (2) - 2 freq gleed (2) - 7 freq tilled (2) - 3 freq milder (2) - 2 freq tilted (2) - 5 freq filed (2) - 11 freq widded (2) - 1 freq gulder (2) - 24 freq dilled (2) - 3 freq milled (2) - 3 freq giles (2) - 9 freq golder (2) - 1 freq willed (2) - 4 freq hirded (2) - 1 freq glued (2) - 13 freq gulped (2) - 7 freq gildro (2) - 1 freq inded (2) - 1 freq golden (2) - 87 freq |
gilded (0) - 3 freq gelded (1) - 1 freq glided (2) - 6 freq girded (2) - 1 freq giled (2) - 1 freq falded (3) - 1 freq folded (3) - 14 freq gulped (3) - 7 freq glued (3) - 13 freq gildro (3) - 1 freq golden (3) - 87 freq gairded (3) - 3 freq gelled (3) - 1 freq guided (3) - 16 freq glied (3) - 1 freq goaded (3) - 1 freq guilden (3) - 1 freq bielded (3) - 3 freq wielded (3) - 2 freq golder (3) - 1 freq gleed (3) - 7 freq gild (3) - 1 freq gilead (3) - 2 freq gildit (3) - 1 freq graded (3) - 3 freq |
SoundEx code - G433 glided - 6 freq glidit - 1 freq gloatit - 2 freq gildit - 1 freq glideth - 1 freq giltit - 3 freq gilded - 3 freq gluttit - 1 freq gelded - 1 freq |
MetaPhone code - JLTT gildit - 1 freq giltit - 3 freq gilded - 3 freq jolted - 4 freq gelded - 1 freq |
GILDED |
| Time to execute Levenshtein function - 0.236239 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.384007 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.029855 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.041743 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.001003 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. |