Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hielands (0) - 11 freq hielans (1) - 17 freq hielants (1) - 1 freq hieland (1) - 16 freq heelands (1) - 1 freq hielan (2) - 27 freq hielanders (2) - 7 freq hielan' (2) - 1 freq islands (2) - 61 freq €˜hielands (2) - 1 freq hielander (2) - 2 freq heeland (2) - 1 freq midlands (2) - 3 freq hielant (2) - 4 freq highlands (2) - 12 freq widlands (2) - 2 freq heilands (2) - 1 freq hicland (2) - 1 freq island (3) - 131 freq baelangs (3) - 2 freq heiland (3) - 2 freq homeland (3) - 1 freq highland (3) - 31 freq 'iceland' (3) - 1 freq lawlands (3) - 4 freq |
hielands (0) - 11 freq heelands (1) - 1 freq heilands (2) - 1 freq hieland (2) - 16 freq hielans (2) - 17 freq hielants (2) - 1 freq heeland (3) - 1 freq islands (3) - 61 freq hielander (3) - 2 freq hielanders (3) - 7 freq uplands (4) - 2 freq glands (4) - 2 freq hands (4) - 175 freq hielenders (4) - 1 freq holylands (4) - 1 freq headlands (4) - 1 freq hielandcoo (4) - 3 freq helds (4) - 1 freq hinds (4) - 3 freq lands (4) - 59 freq haands (4) - 43 freq heilans (4) - 8 freq widlands (4) - 2 freq midlands (4) - 3 freq highlands (4) - 12 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 |
HIELANDS |
Time to execute Levenshtein function - 0.187756 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.372871 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.027994 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.038682 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.000879 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. |