| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| alunt (0) - 1 freq lunt (1) - 5 freq plunt (1) - 6 freq aunt (1) - 76 freq blunt (1) - 9 freq glint (2) - 29 freq cahunt (2) - 1 freq grunt (2) - 33 freq alon (2) - 2 freq alane (2) - 273 freq blun (2) - 1 freq alans (2) - 2 freq alset (2) - 1 freq talent (2) - 65 freq flung (2) - 156 freq abune (2) - 178 freq agun (2) - 1 freq abut (2) - 1 freq blent (2) - 6 freq slant (2) - 3 freq plunty (2) - 2 freq stunt (2) - 3 freq aunts (2) - 10 freq alang (2) - 1171 freq brunt (2) - 73 freq |
alunt (0) - 1 freq lunt (1) - 5 freq lent (2) - 38 freq lint (2) - 17 freq blunt (2) - 9 freq plunt (2) - 6 freq aunt (2) - 76 freq punt (3) - 9 freq lung (3) - 14 freq daunt (3) - 3 freq blint (3) - 3 freq plaunt (3) - 2 freq ahint (3) - 748 freq junt (3) - 1 freq taunt (3) - 2 freq alen (3) - 1 freq alan (3) - 150 freq saunt (3) - 14 freq hunt (3) - 62 freq dunt (3) - 92 freq glent (3) - 30 freq agent (3) - 14 freq gaunt (3) - 8 freq aint (3) - 13 freq aloat (3) - 8 freq |
SoundEx code - A453 alan'd - 1 freq alienate - 1 freq alunt - 1 freq almeida - 1 freq alienated - 2 freq alienatit - 1 freq alienatin - 1 freq allander - 1 freq allanhotel - 3 freq alnodaeitagain - 1 freq allinthenameofun - 1 freq alandmcclure - 15 freq alamooties - 2 freq alanheaton - 1 freq alandas - 8 freq |
MetaPhone code - ALNT alan'd - 1 freq alienate - 1 freq aligned - 2 freq alunt - 1 freq |
ALUNT |
| Time to execute Levenshtein function - 0.768984 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 - 1.318273 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.097800 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.111391 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.001142 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. |