| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airmfus (0) - 1 freq hairmfu (2) - 5 freq airms (2) - 451 freq airmour (2) - 7 freq armous (2) - 1 freq airm's (2) - 8 freq airmies (2) - 16 freq airtfu (2) - 1 freq aimfor (3) - 2 freq artful (3) - 2 freq airmor (3) - 1 freq hairtfu (3) - 1 freq aircs (3) - 1 freq nimbus (3) - 1 freq aires (3) - 1 freq dormous (3) - 39 freq rufus (3) - 5 freq armys (3) - 1 freq hairms (3) - 2 freq hairmles (3) - 1 freq virus (3) - 57 freq airfix (3) - 1 freq virrfu (3) - 3 freq sairious (3) - 34 freq firm's (3) - 4 freq |
airmfus (0) - 1 freq airm's (3) - 8 freq airmies (3) - 16 freq armous (3) - 1 freq airms (3) - 451 freq aurms (4) - 1 freq armies (4) - 4 freq armys (4) - 1 freq army's (4) - 3 freq airtfu (4) - 1 freq hairmfu (4) - 5 freq airmour (4) - 7 freq rufus (4) - 5 freq arms (4) - 67 freq aromas (5) - 1 freq air's (5) - 26 freq airmbans (5) - 1 freq airmed (5) - 21 freq airmit (5) - 4 freq sairmons (5) - 1 freq airm (5) - 358 freq atrms (5) - 1 freq airrs (5) - 2 freq airbugs (5) - 1 freq airchis (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 - ARMFS airmfus - 1 freq |
AIRMFUS |
| Time to execute Levenshtein function - 0.188958 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.358248 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.027822 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.037877 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.000863 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. |