Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hillsides (0) - 2 freq hillside (1) - 15 freq hillies (2) - 11 freq 'hillside' (2) - 1 freq bisides (3) - 1 freq willies (3) - 6 freq hollies (3) - 2 freq fitsides (3) - 1 freq firesides (3) - 2 freq hillie (3) - 1 freq billies (3) - 14 freq ghillies (3) - 1 freq collides (3) - 1 freq hillies' (3) - 5 freq hillswiek (3) - 1 freq millies (3) - 1 freq gillies (3) - 7 freq wildside (3) - 1 freq insides (3) - 15 freq sillies (3) - 1 freq hallies (3) - 1 freq lillies (3) - 1 freq tillies (3) - 1 freq hielander (4) - 2 freq halliday (4) - 1 freq |
hillsides (0) - 2 freq hillside (2) - 15 freq 'hillside' (4) - 1 freq hillies (4) - 11 freq hillswiek (5) - 1 freq hallies (5) - 1 freq hillies' (5) - 5 freq collides (5) - 1 freq hollies (5) - 2 freq hillaireous (6) - 1 freq hill's (6) - 3 freq bellises (6) - 1 freq hollande (6) - 1 freq holylands (6) - 1 freq hillocks (6) - 3 freq hulsyde (6) - 1 freq hielands (6) - 11 freq kelloside (6) - 1 freq hallis (6) - 1 freq hills (6) - 242 freq hallions (6) - 51 freq hilltaps (6) - 1 freq illusions (6) - 4 freq hillheid (6) - 2 freq helliers (6) - 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 - HLSTS hillsides - 2 freq |
HILLSIDES |
Time to execute Levenshtein function - 0.269770 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.393859 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.033090 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.042322 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.003977 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. |