Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
heilands (0) - 1 freq heelands (1) - 1 freq heiland (1) - 2 freq heilans (1) - 8 freq heeland (2) - 1 freq shetlands (2) - 6 freq heilant (2) - 1 freq hielands (2) - 11 freq newlands (2) - 2 freq wetlands (2) - 1 freq heilanders (2) - 2 freq zeiland (2) - 2 freq heidlans (2) - 1 freq heilins (2) - 1 freq hertlands (2) - 2 freq headlands (2) - 1 freq heilan (2) - 17 freq heilan' (2) - 1 freq husbands (3) - 8 freq hands (3) - 175 freq shetland' (3) - 1 freq maitlands (3) - 2 freq heidlamps (3) - 4 freq heiled (3) - 1 freq eland (3) - 1 freq |
heilands (0) - 1 freq heelands (1) - 1 freq heilans (2) - 8 freq heiland (2) - 2 freq hielands (2) - 11 freq headlands (3) - 1 freq heeland (3) - 1 freq heilins (3) - 1 freq heilanders (3) - 2 freq hieland (4) - 16 freq healins (4) - 1 freq helds (4) - 1 freq glands (4) - 2 freq hinds (4) - 3 freq holylands (4) - 1 freq hielans (4) - 17 freq islands (4) - 61 freq lands (4) - 59 freq haands (4) - 43 freq uplands (4) - 2 freq hielants (4) - 1 freq hertlands (4) - 2 freq heilant (4) - 1 freq heidlans (4) - 1 freq zeiland (4) - 2 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 - HLNTS hielants - 1 freq hielands - 11 freq heilands - 1 freq €˜hielands - 1 freq heelands - 1 freq |
HEILANDS |
Time to execute Levenshtein function - 0.201129 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.393261 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.027849 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.037739 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.000874 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. |