Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
adrenalin (0) - 4 freq adrenaline (1) - 20 freq dreedlin (3) - 1 freq alienatin (3) - 1 freq dreeplin (3) - 1 freq adressin (3) - 1 freq appealin (3) - 6 freq dreelin (3) - 1 freq draalin (3) - 2 freq dreadin (3) - 9 freq regalin (3) - 1 freq dreeblin (3) - 3 freq dreamin (3) - 38 freq dreezlin (3) - 1 freq dealin (3) - 30 freq dreillin (3) - 1 freq kennlin (4) - 5 freq agreean (4) - 1 freq dreepin (4) - 66 freq droolin (4) - 3 freq airnin (4) - 1 freq branglin (4) - 2 freq argillin (4) - 1 freq breslin (4) - 1 freq andreline (4) - 1 freq |
adrenalin (0) - 4 freq adrenaline (1) - 20 freq dreeblin (4) - 3 freq draalin (4) - 2 freq dreezlin (4) - 1 freq dreillin (4) - 1 freq dreelin (4) - 1 freq dreedlin (4) - 1 freq dreeplin (4) - 1 freq derlin (5) - 1 freq draiglin (5) - 1 freq drooklin (5) - 1 freq driblin (5) - 1 freq dinnlin (5) - 2 freq drawlin (5) - 7 freq drinkin (5) - 135 freq dronin (5) - 3 freq dunlin (5) - 2 freq driplin (5) - 1 freq adornin (5) - 1 freq drillin (5) - 13 freq derklin (5) - 1 freq dwinlin (5) - 2 freq dealin (5) - 30 freq regalin (5) - 1 freq |
SoundEx code - A365 adorin - 1 freq adrenaline - 20 freq adrienne - 1 freq adherents - 8 freq adherence - 3 freq adherent - 1 freq adornt - 1 freq adorn - 6 freq adorns - 2 freq adorned - 2 freq atrim - 1 freq attorney - 1 freq adrenaline-fueled - 1 freq atrms - 1 freq adoring - 1 freq atremble - 1 freq aitherins - 1 freq aw-terrain - 1 freq adrenalin - 4 freq adornin - 1 freq atrium - 1 freq adornments - 1 freq a-tearin - 1 freq awtroon - 26 freq adrian - 4 freq audreymarks - 2 freq adrianmckinty - 1 freq adrianflux - 1 freq adriandlambert - 1 freq adrianlambert - 2 freq |
MetaPhone code - ATRNLN adrenaline - 20 freq adrenalin - 4 freq |
ADRENALIN |
Time to execute Levenshtein function - 0.237737 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.400521 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.028369 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.041690 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.001251 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. |