| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| highlander (0) - 7 freq highlanders (1) - 17 freq highlander' (1) - 1 freq hielander (2) - 2 freq highland (2) - 31 freq highlands (2) - 12 freq hielanders (3) - 7 freq icelander (3) - 3 freq rsrhighlander (3) - 9 freq highlandlit (3) - 1 freq englander (3) - 1 freq highlans (3) - 1 freq highlandman (3) - 1 freq highlandermsp (3) - 1 freq islander (3) - 1 freq hieland (4) - 16 freq lawlander (4) - 1 freq slander (4) - 3 freq carolander (4) - 1 freq brigander (4) - 1 freq vigilante (4) - 2 freq devihighlander (4) - 1 freq outlander (4) - 3 freq higher (4) - 79 freq hielenders (4) - 1 freq |
highlander (0) - 7 freq highlanders (2) - 17 freq highlander' (2) - 1 freq highlands (3) - 12 freq highland (3) - 31 freq hielander (4) - 2 freq englander (5) - 1 freq highlans (5) - 1 freq highlandlit (5) - 1 freq highlandman (5) - 1 freq hielanders (6) - 7 freq rsrhighlander (6) - 9 freq glinder (6) - 4 freq devihighlander (6) - 1 freq islander (6) - 1 freq icelander (6) - 3 freq highlandermsp (6) - 1 freq colander (7) - 1 freq vigeland (7) - 1 freq englanders (7) - 1 freq hinder (7) - 20 freq heightened (7) - 2 freq lander (7) - 13 freq grander (7) - 3 freq highlandman' (7) - 1 freq |
SoundEx code - H245 highlander - 7 freq highland - 31 freq hucklin - 2 freq hicland - 1 freq highlands - 12 freq highlander' - 1 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 - HFLNTR highlander - 7 freq highlander' - 1 freq |
HIGHLANDER |
| Time to execute Levenshtein function - 0.193065 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.364988 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.027597 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.036992 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.000937 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. |