| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airmen (0) - 2 freq fairmen (1) - 1 freq airmed (1) - 21 freq fairmer (2) - 65 freq aiten (2) - 4 freq aire (2) - 61 freq aimin (2) - 10 freq wirkmen (2) - 1 freq wimen (2) - 1 freq airm (2) - 358 freq airm's (2) - 8 freq dairymen (2) - 2 freq daimen (2) - 4 freq airmie (2) - 15 freq normen (2) - 1 freq airnin (2) - 1 freq airon (2) - 1 freq fairmin (2) - 22 freq weirmen (2) - 2 freq armed (2) - 18 freq airlan (2) - 174 freq airer (2) - 1 freq carmen (2) - 2 freq mirren (2) - 144 freq aimed (2) - 16 freq |
airmen (0) - 2 freq airmed (2) - 21 freq fairmen (2) - 1 freq airmit (3) - 4 freq oilmen (3) - 1 freq airtan (3) - 2 freq firemen (3) - 4 freq wiemen (3) - 1 freq airmy (3) - 92 freq atmen (3) - 1 freq aren (3) - 3 freq barmen (3) - 1 freq wairmin (3) - 2 freq ciemen (3) - 1 freq armani (3) - 1 freq airmies (3) - 16 freq airtin (3) - 36 freq airin (3) - 4 freq airms (3) - 451 freq raimon (3) - 1 freq airn (3) - 52 freq arden (3) - 2 freq airm' (3) - 1 freq airmor (3) - 1 freq airm (3) - 358 freq |
SoundEx code - A655 aroonwance - 1 freq airm-in-airm - 5 freq airmaments - 1 freq airm-inairm - 1 freq armand - 1 freq armani - 1 freq airnin - 1 freq a-rinnin - 1 freq airmen - 2 freq armaments - 1 freq |
MetaPhone code - ARMN armani - 1 freq airmen - 2 freq |
AIRMEN |
| Time to execute Levenshtein function - 0.220201 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.328685 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.027341 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.037818 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.000894 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. |