| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boatmen (0) - 9 freq boatman (1) - 1 freq boatmens (1) - 3 freq batmen (1) - 1 freq boarden (2) - 1 freq boatmans (2) - 1 freq goatten (2) - 2 freq roadmen (2) - 1 freq boather (2) - 5 freq footmen (2) - 1 freq barmen (2) - 1 freq batman (2) - 5 freq atmen (2) - 1 freq boaren (2) - 1 freq batten (2) - 1 freq boatie (2) - 124 freq boatles (2) - 6 freq boatled (2) - 1 freq beaten (2) - 20 freq boatle (2) - 12 freq boaties (2) - 18 freq boatin (2) - 1 freq bammin (3) - 3 freq brazen (3) - 3 freq blacken (3) - 3 freq |
boatmen (0) - 9 freq boatman (1) - 1 freq batmen (1) - 1 freq batman (2) - 5 freq boatmens (2) - 3 freq barmen (3) - 1 freq atmen (3) - 1 freq beaten (3) - 20 freq batten (3) - 1 freq footmen (3) - 1 freq boatmans (3) - 1 freq bitumen (3) - 1 freq boatin (3) - 1 freq batein (4) - 2 freq baton (4) - 3 freq footman (4) - 11 freq fitmen (4) - 1 freq bremen (4) - 1 freq fatman (4) - 1 freq binmen (4) - 1 freq hatman (4) - 1 freq bootin (4) - 2 freq beamin (4) - 25 freq blamin (4) - 6 freq beaton (4) - 35 freq |
SoundEx code - B355 buttin-in - 1 freq buttonin - 4 freq boatmen - 9 freq batman - 5 freq badminton - 6 freq bitumen - 1 freq batman's - 1 freq batmen - 1 freq boatman - 1 freq bodmin - 1 freq batmangilmour - 2 freq boatmens - 3 freq boatmans - 1 freq |
MetaPhone code - BTMN boatmen - 9 freq batman - 5 freq bitumen - 1 freq batmen - 1 freq boatman - 1 freq bodmin - 1 freq |
BOATMEN |
| Time to execute Levenshtein function - 0.184284 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.329900 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.027492 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.036621 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.000806 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. |