| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| highland (0) - 30 freq highlands (1) - 10 freq highlans (1) - 1 freq vigeland (2) - 1 freq hicland (2) - 1 freq hieland (2) - 16 freq highlander (2) - 7 freq legoland (3) - 2 freq england (3) - 224 freq ireland (3) - 142 freq vinland (3) - 2 freq heeland (3) - 1 freq highways (3) - 3 freq highway (3) - 6 freq gigglan (3) - 1 freq highball (3) - 1 freq fightan (3) - 3 freq highlandman (3) - 1 freq hielant (3) - 4 freq vagaland (3) - 1 freq finland (3) - 6 freq 'iceland (3) - 2 freq highlandlit (3) - 1 freq higuian (3) - 1 freq hielan' (3) - 1 freq |
highland (0) - 30 freq highlands (2) - 10 freq highlans (2) - 1 freq highlander (3) - 7 freq heightend (4) - 1 freq hieland (4) - 16 freq vigeland (4) - 1 freq hicland (4) - 1 freq ingland (5) - 50 freq hairtland (5) - 1 freq hameland (5) - 7 freq highly (5) - 17 freq highroad (5) - 6 freq holland (5) - 16 freq hertland (5) - 3 freq heiland (5) - 2 freq heightened (5) - 1 freq irishland (5) - 1 freq highlandlit (5) - 1 freq highlanders (5) - 17 freq eoghand (5) - 1 freq highlander' (5) - 1 freq homeland (5) - 1 freq heeland (5) - 1 freq highlandman (5) - 1 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 - HFLNT highland - 30 freq |
HIGHLAND |
| Time to execute Levenshtein function - 0.247412 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.435637 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.033816 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.047815 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.001050 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. |