| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hedged (0) - 2 freq edged (1) - 9 freq hodged (1) - 3 freq hedge (1) - 40 freq hedges (1) - 38 freq wedged (1) - 3 freq heired (2) - 3 freq neded (2) - 3 freq hede (2) - 4 freq hodge (2) - 3 freq herded (2) - 1 freq begged (2) - 30 freq heched (2) - 1 freq heeled (2) - 1 freq cherged (2) - 4 freq heidded (2) - 1 freq pegged (2) - 2 freq wedded (2) - 4 freq headed (2) - 38 freq fledged (2) - 3 freq heeded (2) - 14 freq hered (2) - 2 freq heaved (2) - 6 freq heared (2) - 14 freq jeidged (2) - 1 freq |
hedged (0) - 2 freq hodged (1) - 3 freq hedges (2) - 38 freq wedged (2) - 3 freq hedge (2) - 40 freq edged (2) - 9 freq heided (3) - 35 freq cadged (3) - 1 freq budged (3) - 1 freq hedgie (3) - 3 freq hudge (3) - 1 freq fidged (3) - 7 freq judged (3) - 16 freq nudged (3) - 5 freq wadged (3) - 1 freq hanged (3) - 6 freq hagged (3) - 2 freq lodged (3) - 6 freq widged (3) - 1 freq mudged (3) - 1 freq hudded (3) - 1 freq nidged (3) - 1 freq jeedged (3) - 3 freq radged (3) - 1 freq dodged (3) - 6 freq |
SoundEx code - H323 hitched - 6 freq howtiest - 1 freq hatched - 9 freq hottest - 4 freq heidstanes - 9 freq headstart - 1 freq heidstane - 14 freq hitchit - 2 freq heidsteens - 4 freq heidsteen - 5 freq heetchid - 1 freq heetched - 1 freq hatchit - 2 freq heidswedgers - 2 freq 'hoots-toots - 1 freq hitcht - 1 freq hotched - 2 freq hyte-skyte - 1 freq heidstones - 3 freq heidstone - 2 freq hetchit - 1 freq heidstrap - 1 freq hedged - 2 freq hatchets - 1 freq hiddie-giddie - 1 freq heid-stane - 1 freq €”hottest - 1 freq hatcht - 1 freq hodged - 3 freq hatchet - 1 freq hotchit - 1 freq heid-hicht - 1 freq heidstrinker - 1 freq headset - 1 freq htscotpol - 5 freq hitsdingingdoon - 1 freq |
MetaPhone code - HJT hejit - 1 freq hedged - 2 freq hodged - 3 freq |
HEDGED |
| Time to execute Levenshtein function - 0.297368 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.540150 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.073926 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.074655 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.000901 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. |