Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
helicopter (0) - 31 freq helecopter (1) - 1 freq helicopters (1) - 2 freq helecopters (2) - 1 freq heicher (4) - 30 freq welcomer (4) - 1 freq flichter (4) - 12 freq delichted (4) - 9 freq helter (4) - 3 freq leicester (4) - 2 freq delichtet (4) - 1 freq soliciter (4) - 1 freq heliport (4) - 2 freq heiter (4) - 1 freq helper (4) - 5 freq helicon (4) - 1 freq delicate (4) - 21 freq lichter (4) - 8 freq leister (5) - 2 freq indicater (5) - 1 freq hoochter (5) - 1 freq flochter (5) - 9 freq perimeter (5) - 10 freq welcome' (5) - 1 freq 'elected (5) - 1 freq |
helicopter (0) - 31 freq helecopter (1) - 1 freq helicopters (2) - 2 freq helecopters (3) - 1 freq leicester (6) - 2 freq soliciter (6) - 1 freq helter (6) - 3 freq helper (6) - 5 freq flichter (6) - 12 freq lichter (6) - 8 freq heelster (7) - 2 freq flachter (7) - 1 freq hulmawater (7) - 1 freq huchter (7) - 1 freq slachter (7) - 3 freq halper (7) - 2 freq hielichts (7) - 1 freq halter (7) - 5 freq solicitor (7) - 8 freq hielicht (7) - 3 freq elector (7) - 2 freq helpt (7) - 9 freq heelichts (7) - 1 freq hector (7) - 13 freq lachter (7) - 16 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 |
HELICOPTER |
Time to execute Levenshtein function - 0.177759 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.346582 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.027397 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.037531 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.000799 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. |