| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| doricbananaman (0) - 1 freq doricana (6) - 2 freq doricbanter (6) - 1 freq doricmakaton (6) - 1 freq loubanana (7) - 1 freq richardosman (7) - 1 freq derekbateman (7) - 2 freq barbaranairn (7) - 3 freq dothebartman (7) - 1 freq bananasmin (7) - 8 freq dragon-man (7) - 1 freq highlandman (8) - 1 freq banannas (8) - 1 freq jonanan (8) - 1 freq inn-man (8) - 1 freq draeman (8) - 4 freq dominatin (8) - 6 freq dorian's (8) - 16 freq cameraman (8) - 2 freq britannia (8) - 2 freq cànanan (8) - 1 freq corinthian (8) - 2 freq dorian (8) - 32 freq crannachan (8) - 4 freq brianma (8) - 1 freq |
doricbananaman (0) - 1 freq doricbanter (9) - 1 freq derekbateman (10) - 2 freq dragon-man (10) - 1 freq doricmakaton (10) - 1 freq doricana (10) - 2 freq doricaubergine (11) - 1 freq cinnamon (11) - 5 freq draconian (11) - 6 freq bananasmin (11) - 8 freq deracination (11) - 1 freq barbaranairn (11) - 3 freq dothebartman (11) - 1 freq crocanation (12) - 1 freq bannan (12) - 1 freq doricquine (12) - 1 freq drinkan (12) - 6 freq no-cannin (12) - 1 freq dreaman (12) - 2 freq brannigan (12) - 1 freq doberman (12) - 2 freq monicalennon (12) - 2 freq bannerman (12) - 1 freq grinnan (12) - 1 freq drauchtisman (12) - 1 freq |
SoundEx code - D621 door-gap - 1 freq daurk-broon - 2 freq drug-fuelled - 1 freq derisively - 1 freq doricaubergine - 1 freq doricbananaman - 1 freq doricbanter - 1 freq doricphrases - 139 freq doorsopendays - 1 freq derekofhighbury - 1 freq dorisvulva - 7 freq diraaxvzyp - 1 freq derekbateman - 2 freq derickfaeyell - 2 freq drrosebland - 2 freq drakeford - 1 freq driseborough - 1 freq drawzfj - 2 freq drwsv - 1 freq |
MetaPhone code - TRKBNNMN doricbananaman - 1 freq |
DORICBANANAMAN |
| Time to execute Levenshtein function - 0.274617 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.412184 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.029487 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.042861 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.001023 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. |