Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
helecopter (0) - 1 freq helicopter (1) - 31 freq helecopters (1) - 1 freq helicopters (2) - 2 freq 'elected (4) - 1 freq helter (4) - 3 freq elector (4) - 2 freq heecher (4) - 1 freq hereefter (4) - 3 freq welcomer (4) - 1 freq helper (4) - 5 freq here-efter (4) - 3 freq telescope (4) - 19 freq telescopes (4) - 6 freq developer (4) - 3 freq heelster (4) - 2 freq hereaifter (4) - 3 freq selected (4) - 8 freq heeter (4) - 9 freq elected (4) - 10 freq hereafter (4) - 1 freq hulmawater (5) - 1 freq perconte (5) - 1 freq reflected (5) - 11 freq desecrate (5) - 1 freq |
helecopter (0) - 1 freq helicopter (1) - 31 freq helecopters (2) - 1 freq helicopters (3) - 2 freq elector (6) - 2 freq heelster (6) - 2 freq helper (6) - 5 freq helter (6) - 3 freq halter (7) - 5 freq hoochter (7) - 1 freq slachter (7) - 3 freq hector (7) - 13 freq flichter (7) - 12 freq helcht (7) - 1 freq lachter (7) - 16 freq helenohtroy (7) - 1 freq huchter (7) - 1 freq helpt (7) - 9 freq flachter (7) - 1 freq lectur (7) - 2 freq leicester (7) - 2 freq hereafter (7) - 1 freq here-efter (7) - 3 freq flochter (7) - 9 freq halper (7) - 2 freq |
SoundEx code - H421 helicopter - 31 freq helecopters - 1 freq helicopters - 2 freq hlkpqhwgzu - 1 freq hlkvlhowpu - 1 freq hhlckhpol - 1 freq hleqwvh - 1 freq hlspbngzv - 1 freq helecopter - 1 freq helecopteronmars - 1 freq |
MetaPhone code - HLKPTR helicopter - 31 freq helecopter - 1 freq |
HELECOPTER |
Time to execute Levenshtein function - 0.319480 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.472412 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.026941 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.044017 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.000838 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. |