| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kelloside (0) - 1 freq kelvinside (3) - 3 freq hillside (3) - 15 freq kellie (3) - 1 freq ker-side (3) - 1 freq kellheid (3) - 1 freq bell-time (4) - 3 freq kilrogie (4) - 17 freq kilbride (4) - 5 freq teeside (4) - 1 freq mellowed (4) - 2 freq bieldside (4) - 2 freq beidside (4) - 1 freq erosive (4) - 1 freq ellie (4) - 7 freq hillsides (4) - 2 freq keelivine (4) - 2 freq mellie (4) - 2 freq melrose (4) - 6 freq flipside (4) - 1 freq sea-side (4) - 1 freq genocide (4) - 3 freq skellie (4) - 4 freq sooside (4) - 2 freq kellsley (4) - 3 freq |
kelloside (0) - 1 freq hillside (4) - 15 freq kellheid (4) - 1 freq kelvinside (5) - 3 freq kellsley (5) - 3 freq kells (5) - 7 freq kellas (5) - 2 freq kells' (5) - 1 freq kellie (5) - 1 freq ker-side (5) - 1 freq kell-heid (6) - 1 freq bellowed (6) - 2 freq bellisle (6) - 1 freq keillies (6) - 1 freq keilled (6) - 2 freq kelliher (6) - 1 freq kloodie (6) - 1 freq wildside (6) - 1 freq mellissae (6) - 1 freq jalloused (6) - 1 freq calloused (6) - 2 freq wallsie (6) - 1 freq kelsi (6) - 3 freq killie (6) - 26 freq killed (6) - 81 freq |
SoundEx code - K423 kelloside - 1 freq kleist - 1 freq kilsyth - 1 freq kliston - 5 freq killiestandard - 4 freq |
MetaPhone code - KLST clased - 2 freq glazed - 15 freq kelloside - 1 freq closed - 126 freq calloused - 2 freq glossed - 2 freq claesed - 2 freq closet - 9 freq closset - 1 freq glist - 1 freq claised - 1 freq coolest - 1 freq 'closed' - 1 freq cailst - 3 freq clossed - 2 freq glaissie-eed - 1 freq clousta - 3 freq clessed - 1 freq kleist - 1 freq glosst - 1 freq callisto - 2 freq coalesced - 1 freq collecit - 2 freq glessheid - 1 freq cloased - 1 freq classed - 4 freq glasto - 1 freq qahlzidd - 1 freq |
KELLOSIDE |
| Time to execute Levenshtein function - 0.218281 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.368621 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.030295 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.049985 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.000801 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. |