| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| highlandermsp (0) - 1 freq highlanders (2) - 17 freq highlander (3) - 7 freq highlander' (3) - 1 freq highlands (4) - 10 freq hielanders (4) - 7 freq highlandman (4) - 1 freq islanders (5) - 2 freq englanders (5) - 1 freq gillanders (5) - 1 freq irelanders (5) - 1 freq hielenders (5) - 1 freq hielander (5) - 2 freq highlandman' (5) - 1 freq highlandwriter (5) - 8 freq highland (5) - 30 freq highlandchica (5) - 1 freq heilanders (5) - 2 freq highlans (5) - 1 freq highlandlit (5) - 1 freq shetlanders- (6) - 1 freq vigilateers (6) - 2 freq inglandurs (6) - 1 freq icelander (6) - 3 freq highers (6) - 12 freq |
highlandermsp (0) - 1 freq highlanders (4) - 17 freq highlander' (6) - 1 freq highlander (6) - 7 freq highlandman (7) - 1 freq highlands (7) - 10 freq highlandman' (8) - 1 freq highlandrampage (8) - 1 freq hielanders (8) - 7 freq highlandchica (9) - 1 freq heilanders (9) - 2 freq highlandlit (9) - 1 freq highland (9) - 30 freq englanders (9) - 1 freq highlans (9) - 1 freq highlandwriter (9) - 8 freq gillanders (9) - 1 freq hielenders (9) - 1 freq inglandurs (10) - 1 freq mgoldenmsp (10) - 13 freq irelanders (10) - 1 freq islanders (10) - 2 freq hielander (10) - 2 freq calanders (11) - 1 freq hinders (11) - 2 freq |
SoundEx code - H245 highlander - 7 freq highland - 30 freq hucklin - 2 freq hicland - 1 freq highlander' - 1 freq highlands - 10 freq highlanders - 17 freq hasslin - 1 freq hazelnits - 1 freq highlandman' - 1 freq hook-line - 1 freq haiglin - 3 freq hushlin - 1 freq highlandman - 1 freq highlans - 1 freq hagglin - 1 freq hazelnut - 1 freq highlandwriter - 8 freq highlandhistory - 1 freq highlandrampage - 1 freq hecklin - 1 freq haslington - 1 freq highlandermsp - 1 freq highlandlit - 1 freq haslam - 1 freq highlandchica - 1 freq |
MetaPhone code - HFLNTRMS |
HIGHLANDERMSP |
| Time to execute Levenshtein function - 0.236813 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.383483 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.027459 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.038934 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.001023 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. |