| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hielandman (0) - 1 freq hielandmen (1) - 1 freq hielanman (1) - 3 freq highlandman (2) - 1 freq hielanmen (2) - 2 freq hielandman's (2) - 1 freq hieland (3) - 16 freq highlandman' (3) - 1 freq hielands (3) - 11 freq husbandman (3) - 1 freq hielandcoo (3) - 3 freq hielanders (3) - 7 freq hielander (3) - 2 freq hielan' (4) - 1 freq headan (4) - 3 freq hieweyman (4) - 1 freq hielant (4) - 4 freq hill-man (4) - 1 freq heeland (4) - 1 freq hicland (4) - 1 freq hielants (4) - 1 freq heilanmen (4) - 1 freq milanda (4) - 1 freq heelands (4) - 1 freq hielaun (4) - 1 freq |
hielandman (0) - 1 freq hielandmen (1) - 1 freq hielanman (2) - 3 freq hielanmen (3) - 2 freq hielandman's (4) - 1 freq highlandman (4) - 1 freq hielanders (5) - 7 freq hielander (5) - 2 freq heilanmen (5) - 1 freq hielandcoo (5) - 3 freq handyman (5) - 2 freq husbandman (5) - 1 freq hieland (5) - 16 freq hielands (5) - 11 freq hangman (6) - 9 freq hielenders (6) - 1 freq heidman (6) - 1 freq henman (6) - 1 freq hillman (6) - 3 freq hanuman (6) - 1 freq heelands (6) - 1 freq landan (6) - 2 freq heeland (6) - 1 freq hill-man (6) - 1 freq highlandman' (6) - 1 freq |
SoundEx code - H453 heilant - 1 freq heilanders - 2 freq hielanders - 7 freq hieland - 16 freq helmets - 9 freq helmet - 15 freq holland - 17 freq hielandmen - 1 freq hielant - 4 freq hielants - 1 freq hielands - 11 freq 'hole-in-the-waas' - 1 freq heiland - 2 freq helmits - 1 freq hielandman's - 1 freq hielandman - 1 freq hulmawater - 1 freq hielander - 2 freq hole-in-the-wa - 1 freq hielenders - 1 freq heilands - 1 freq hollande - 1 freq €˜hielands - 1 freq heelands - 1 freq helentrevone - 1 freq hielandcoo - 3 freq helenohtroy - 1 freq heeland - 1 freq |
MetaPhone code - HLNTMN hielandmen - 1 freq hielandman - 1 freq |
HIELANDMAN |
| Time to execute Levenshtein function - 0.213777 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.645242 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.033218 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.049950 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.000990 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. |