| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| guided (0) - 16 freq guider (1) - 4 freq guide (1) - 91 freq glided (1) - 6 freq guides (1) - 15 freq guide' (1) - 1 freq guerded (2) - 1 freq gutsed (2) - 1 freq glide (2) - 18 freq guidin (2) - 20 freq gubbed (2) - 10 freq gied (2) - 1350 freq guarded (2) - 2 freq griped (2) - 1 freq guidar (2) - 1 freq uized (2) - 21 freq gi'ed (2) - 2 freq grunded (2) - 1 freq gairded (2) - 3 freq luiked (2) - 74 freq guile (2) - 4 freq guids (2) - 24 freq gurged (2) - 1 freq gulder (2) - 24 freq glied (2) - 1 freq |
guided (0) - 16 freq guide' (2) - 1 freq guides (2) - 15 freq goaded (2) - 1 freq guider (2) - 4 freq guide (2) - 91 freq glided (2) - 6 freq aided (3) - 2 freq gide (3) - 1 freq guairded (3) - 3 freq sided (3) - 4 freq gued (3) - 1 freq giled (3) - 1 freq guidal (3) - 1 freq graded (3) - 3 freq girded (3) - 1 freq abided (3) - 1 freq gilded (3) - 3 freq bided (3) - 30 freq wuidid (3) - 1 freq guidly (3) - 4 freq elided (3) - 1 freq guid' (3) - 1 freq raided (3) - 4 freq guidis (3) - 1 freq |
SoundEx code - G330 gutted - 32 freq guidit - 17 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq gated - 1 freq godheid - 5 freq gydit - 3 freq goaded - 1 freq godot - 1 freq €™guided - 1 freq gtid - 1 freq gdwood - 11 freq |
MetaPhone code - KTT cat'd - 1 freq gutted - 32 freq cuttit - 21 freq guidit - 17 freq quoted - 8 freq kiddit - 1 freq quotit - 11 freq gteat - 1 freq guttit - 4 freq goadit - 3 freq guttet - 8 freq guided - 16 freq cuddied - 1 freq quieted - 1 freq coatit - 4 freq coated - 4 freq kittit - 2 freq coatet - 3 freq kiddet - 3 freq cadet - 2 freq kitted - 10 freq quietude - 1 freq quottit - 1 freq gated - 1 freq quited - 1 freq caaed-oot - 1 freq goaded - 1 freq godot - 1 freq coded - 2 freq €™guided - 1 freq gtid - 1 freq kidded - 1 freq ctodd - 1 freq ktid - 1 freq |
GUIDED |
| Time to execute Levenshtein function - 0.194877 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.411137 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.031895 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.039760 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.001020 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. |