| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airmpits (0) - 1 freq airmpit (1) - 1 freq armpit (2) - 1 freq airmies (2) - 16 freq airm-pit (2) - 1 freq limpits (2) - 1 freq airmit (2) - 4 freq airports (3) - 3 freq armit (3) - 4 freq limpit (3) - 1 freq inpits (3) - 5 freq mairmit (3) - 1 freq airts (3) - 356 freq admits (3) - 2 freq airies (3) - 1 freq armies (3) - 4 freq airmie (3) - 15 freq aipils (3) - 1 freq airmfus (3) - 1 freq airms (3) - 451 freq gairments (3) - 1 freq airis (3) - 1 freq parapits (3) - 1 freq airchis (3) - 1 freq ailmints (3) - 1 freq |
airmpits (0) - 1 freq airmpit (2) - 1 freq limpits (3) - 1 freq armpit (3) - 1 freq limpets (4) - 2 freq airmies (4) - 16 freq airmit (4) - 4 freq airm-pit (4) - 1 freq limits (5) - 15 freq airmbans (5) - 1 freq airpot (5) - 1 freq jimpit (5) - 5 freq lumpots (5) - 1 freq impit (5) - 1 freq trumpets (5) - 4 freq cairpets (5) - 7 freq airtists (5) - 20 freq erupts (5) - 5 freq rimples (5) - 2 freq tempts (5) - 2 freq impetus (5) - 3 freq lempets (5) - 2 freq ailments (5) - 9 freq airm's (5) - 8 freq hermits (5) - 1 freq |
SoundEx code - A651 airn-baur - 1 freq airmpit - 1 freq armbecidon - 1 freq airmbans - 1 freq airmpits - 1 freq aroonaboot - 1 freq airmband - 1 freq airmfus - 1 freq airm-pit - 1 freq aroonaiberdeen - 1 freq aaronbastani - 1 freq aaronneville - 1 freq armpit - 1 freq |
MetaPhone code - ARMPTS airmpits - 1 freq |
AIRMPITS |
| Time to execute Levenshtein function - 0.230971 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.408199 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.032305 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.039729 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.001014 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. |