| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airmband (0) - 1 freq airmbans (1) - 1 freq armand (2) - 1 freq hairband (2) - 1 freq airland (2) - 2 freq fairmhand (2) - 1 freq rimbaud (3) - 1 freq armani (3) - 1 freq birnand (3) - 2 freq fairmlan (3) - 1 freq wirdbank (3) - 1 freq faireland (3) - 1 freq airtans (3) - 3 freq air-raid (3) - 1 freq airbnb (3) - 1 freq i'band (3) - 2 freq airlann (3) - 20 freq tirbans (3) - 1 freq hairtland (3) - 1 freq fairyland (3) - 1 freq gairland (3) - 1 freq airnhard (3) - 1 freq riband (3) - 1 freq airmed (3) - 21 freq fermhand (3) - 1 freq |
airmband (0) - 1 freq airmbans (2) - 1 freq armand (3) - 1 freq riband (4) - 1 freq fairmhand (4) - 1 freq rimbaud (4) - 1 freq airland (4) - 2 freq hairband (4) - 1 freq yirbard (5) - 1 freq disband (5) - 2 freq fermhand (5) - 1 freq ireland (5) - 145 freq airmed (5) - 21 freq arkbound (5) - 1 freq ribbond (5) - 1 freq irland (5) - 6 freq airmen (5) - 2 freq niemand (5) - 1 freq fermland (5) - 1 freq airbnb (5) - 1 freq armani (5) - 1 freq remand (5) - 2 freq i'band (5) - 2 freq carmond (6) - 4 freq ribban (6) - 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 - ARMNT armand - 1 freq airmband - 1 freq |
AIRMBAND |
| Time to execute Levenshtein function - 0.280989 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.431202 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.029849 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.041319 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.001087 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. |