Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hielanders (0) - 7 freq hielander (1) - 2 freq hielenders (1) - 1 freq hielands (2) - 11 freq heilanders (2) - 2 freq gillanders (2) - 1 freq highlanders (2) - 17 freq islanders (2) - 2 freq irelanders (2) - 1 freq heelands (3) - 1 freq hielandman (3) - 1 freq braelanders (3) - 1 freq lowlanders (3) - 1 freq highlander (3) - 7 freq hinders (3) - 2 freq colanders (3) - 1 freq hielandmen (3) - 1 freq shetlanders (3) - 10 freq englanders (3) - 1 freq ceelinders (3) - 1 freq meanders (3) - 2 freq landers (3) - 10 freq hielandcoo (3) - 3 freq lawlanders (3) - 1 freq hielans (3) - 17 freq |
hielanders (0) - 7 freq hielenders (1) - 1 freq heilanders (2) - 2 freq hielander (2) - 2 freq hielands (3) - 11 freq irelanders (3) - 1 freq islanders (3) - 2 freq flanders (4) - 15 freq slanders (4) - 1 freq colanders (4) - 1 freq landers (4) - 10 freq ceelinders (4) - 1 freq hinders (4) - 2 freq heelands (4) - 1 freq calanders (4) - 1 freq handers (4) - 1 freq gillanders (4) - 1 freq highlanders (4) - 17 freq icelander (5) - 3 freq islander (5) - 1 freq flinders (5) - 2 freq heilands (5) - 1 freq hunders (5) - 25 freq blinders (5) - 2 freq holders (5) - 3 freq |
SoundEx code - H453 heilant - 1 freq heilanders - 2 freq hielanders - 7 freq hieland - 16 freq helmets - 9 freq helmet - 15 freq holland - 16 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 - HLNTRS heilanders - 2 freq hielanders - 7 freq hielenders - 1 freq |
HIELANDERS |
Time to execute Levenshtein function - 0.206702 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.353295 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.027280 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.037275 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.000809 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. |