| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| holiest (0) - 2 freq holes (2) - 71 freq polist (2) - 4 freq howtiest (2) - 1 freq halies (2) - 2 freq hottest (2) - 4 freq oolies (2) - 1 freq holiness (2) - 1 freq honist (2) - 1 freq pokiest (2) - 1 freq folies (2) - 1 freq holmes (2) - 16 freq hollies (2) - 2 freq oldest (2) - 3 freq howest (2) - 1 freq holit (2) - 1 freq holie (2) - 10 freq howies (2) - 1 freq honest (2) - 190 freq hoist (2) - 5 freq erliest (2) - 1 freq solist (2) - 1 freq totiest (2) - 1 freq dowiest (2) - 1 freq ponies (3) - 6 freq |
holiest (0) - 2 freq hoist (3) - 5 freq erliest (3) - 1 freq howest (3) - 1 freq solist (3) - 1 freq holit (3) - 1 freq honest (3) - 190 freq honist (3) - 1 freq halies (3) - 2 freq polist (3) - 4 freq holes (3) - 71 freq houlet (4) - 9 freq glist (4) - 1 freq hoast (4) - 41 freq blest (4) - 1 freq earliest (4) - 19 freq honesty (4) - 20 freq helios (4) - 5 freq loest (4) - 1 freq hols (4) - 6 freq holistic (4) - 4 freq holt (4) - 1 freq hairst (4) - 182 freq heles (4) - 1 freq coolest (4) - 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 |
HOLIEST |
| Time to execute Levenshtein function - 0.390394 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.694593 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.029237 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.067298 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.004294 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. |