Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hillside (0) - 15 freq hillsides (1) - 2 freq wildside (2) - 1 freq 'hillside' (2) - 1 freq hillie (2) - 1 freq widside (3) - 5 freq hail-size (3) - 1 freq kelloside (3) - 1 freq sillie (3) - 2 freq illie (3) - 2 freq hilligo (3) - 1 freq tillie (3) - 8 freq millie (3) - 5 freq fireside (3) - 21 freq hillswiek (3) - 1 freq shillie (3) - 1 freq hulsyde (3) - 1 freq willie (3) - 197 freq iside (3) - 1 freq aillie (3) - 1 freq killie (3) - 26 freq bieldside (3) - 2 freq haillsale (3) - 1 freq hills (3) - 245 freq hallie (3) - 1 freq |
hillside (0) - 15 freq hillsides (2) - 2 freq hulsyde (4) - 1 freq hillheid (4) - 2 freq haillsale (4) - 1 freq kelloside (4) - 1 freq hills (4) - 245 freq hillies (4) - 11 freq hillie (4) - 1 freq hollande (4) - 1 freq wildside (4) - 1 freq 'hillside' (4) - 1 freq wallsie (5) - 1 freq caldside (5) - 1 freq hillies' (5) - 5 freq haillie (5) - 8 freq hulls (5) - 9 freq hellie (5) - 1 freq holland (5) - 17 freq hell'd (5) - 1 freq hells (5) - 1 freq halled (5) - 2 freq hillhead (5) - 2 freq halliday (5) - 1 freq hallis (5) - 1 freq |
SoundEx code - H423 hailsteens - 5 freq hailstanes - 2 freq heelster-gowdie - 6 freq hallockit - 7 freq heelster-gowdle - 1 freq hillside - 15 freq hillsides - 2 freq hilshed - 1 freq holiest - 2 freq holstered - 1 freq helcht - 1 freq halikit - 1 freq halakit - 1 freq heelstergoudie - 1 freq holistic - 4 freq hailstane - 1 freq haliket - 2 freq holo-exit - 3 freq heelster - 2 freq heelstergowdie - 7 freq 'hillside' - 1 freq hailsed - 2 freq hielichts - 1 freq hielicht - 3 freq hie-liggit - 1 freq hallstaan - 1 freq houliston - 2 freq halliget - 1 freq hailsteen - 1 freq hulsyde - 1 freq hulstert - 1 freq hailstones - 1 freq hailstone - 1 freq hielichtit - 1 freq heelichts - 1 freq hailsteenes - 1 freq |
MetaPhone code - HLST hillside - 15 freq holiest - 2 freq 'hillside' - 1 freq hailsed - 2 freq hulsyde - 1 freq |
HILLSIDE |
Time to execute Levenshtein function - 0.222241 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.436446 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.039025 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.052347 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.001585 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. |