| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hilltoon (0) - 1 freq hilltoun (1) - 7 freq huhlltoon (2) - 1 freq hilltop (2) - 4 freq hilton (2) - 2 freq hillroun (2) - 1 freq hilligo (3) - 1 freq halfmoon (3) - 1 freq hilltap (3) - 1 freq hallooin (3) - 2 freq billion (3) - 34 freq dillion (3) - 3 freq hul-toun (3) - 1 freq wilton (3) - 1 freq milton (3) - 4 freq bilston (3) - 14 freq platoon (3) - 5 freq hallion (3) - 16 freq pilton (3) - 1 freq million (3) - 156 freq walltown (3) - 1 freq pillion (3) - 1 freq dillon (3) - 2 freq haltoun (3) - 1 freq hillmen (3) - 1 freq |
hilltoon (0) - 1 freq hilltoun (1) - 7 freq hilton (3) - 2 freq hillroun (3) - 1 freq hilltop (3) - 4 freq huhlltoon (3) - 1 freq holton (4) - 5 freq hallion (4) - 16 freq hillmen (4) - 1 freq hul-toun (4) - 1 freq haltoun (4) - 1 freq hillman (4) - 3 freq hallon (4) - 1 freq hallooin (4) - 2 freq hilltap (4) - 1 freq hollin (5) - 1 freq hallaeen (5) - 12 freq chilloot (5) - 3 freq balloon (5) - 37 freq hametoon (5) - 5 freq liltan (5) - 1 freq hallan (5) - 1 freq hamilton (5) - 40 freq hellyan (5) - 2 freq hailstone (5) - 1 freq |
SoundEx code - H435 holdin - 18 freq holding - 8 freq hauldin - 10 freq haliday-makkers - 1 freq haldane - 2 freq holden - 2 freq heldyins - 1 freq hilltoon - 1 freq hilltoun - 7 freq haldane's - 1 freq haltin' - 1 freq hul-toun - 1 freq holidaymakers - 1 freq howldan - 4 freq haltoun - 1 freq holton - 5 freq hilton - 2 freq hail-time - 1 freq huhlltoon - 1 freq holidayin - 1 freq haldon - 1 freq hilton's - 1 freq hooletontour - 2 freq hldnn - 1 freq |
MetaPhone code - HLTN holdin - 18 freq hauldin - 10 freq haldane - 2 freq holden - 2 freq hilltoon - 1 freq hilltoun - 7 freq haltin' - 1 freq hul-toun - 1 freq howldan - 4 freq haltoun - 1 freq holton - 5 freq hilton - 2 freq huhlltoon - 1 freq haldon - 1 freq |
HILLTOON |
| Time to execute Levenshtein function - 0.298690 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.578912 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.031410 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.092075 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.000977 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. |