| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hittcn (0) - 1 freq hittn (1) - 1 freq hittin (1) - 39 freq hitch (2) - 3 freq hutton (2) - 5 freq wittin (2) - 30 freq kitten (2) - 6 freq witten (2) - 1 freq mitten (2) - 15 freq nitten (2) - 5 freq pitten (2) - 207 freq sitt'n (2) - 1 freq gittn (2) - 1 freq bitten (2) - 7 freq littin (2) - 10 freq hutten (2) - 1 freq pittan (2) - 13 freq gittan (2) - 30 freq whitten (2) - 11 freq sittin (2) - 737 freq whittin (2) - 8 freq dittan (2) - 1 freq aittin (2) - 1 freq hitin (2) - 1 freq fitten (2) - 22 freq |
hittcn (0) - 1 freq hittin (2) - 39 freq hittn (2) - 1 freq littcen (3) - 1 freq hutten (3) - 1 freq hatton (3) - 1 freq hutton (3) - 5 freq fittin (4) - 44 freq hitec (4) - 1 freq gittin (4) - 212 freq fittan (4) - 1 freq rittan (4) - 2 freq hintan (4) - 2 freq tittin (4) - 2 freq hilton (4) - 2 freq sittan (4) - 32 freq aitten (4) - 2 freq shittin (4) - 4 freq gitten (4) - 2 freq ritten (4) - 1 freq kitten (4) - 6 freq hitch (4) - 3 freq hitting (4) - 4 freq kittln (4) - 1 freq kittin (4) - 1 freq |
SoundEx code - H325 hodgson - 2 freq hatchin - 5 freq hoatchin - 9 freq heid-snedder - 5 freq heid-snedder's - 2 freq heid-sneddins - 2 freq het-skinnt - 1 freq hittcn - 1 freq hotchin - 12 freq hootchin - 4 freq hutcheon - 2 freq heid-coont - 66 freq heidsman - 2 freq hudson - 9 freq hedgin-roun - 1 freq hatchan - 1 freq heidsmen - 1 freq haudagainsumm - 1 freq hodgin - 3 freq hitchin - 1 freq heid-quine - 1 freq hidsniffed - 1 freq haud-gauin - 2 freq hdshmumojd - 1 freq hudxxnke - 1 freq haudagain - 1 freq hotsnaxmihole - 1 freq hitching - 1 freq hdshnbw - 1 freq hewitson - 1 freq hdycn - 1 freq |
MetaPhone code - HTKN hittcn - 1 freq heid-quine - 1 freq haud-gauin - 2 freq haudagain - 1 freq |
HITTCN |
| Time to execute Levenshtein function - 0.212030 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.395798 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.033559 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.045789 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.001091 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. |