| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| batcheler (0) - 1 freq bacheleir (2) - 1 freq bachelor (2) - 4 freq bach'ler (2) - 1 freq bauchles (3) - 4 freq catcher (3) - 2 freq batthered (3) - 1 freq butchered (3) - 4 freq watchees (3) - 1 freq bauchlet (3) - 1 freq satchel (3) - 8 freq barchester (3) - 1 freq bachle (3) - 1 freq bather (3) - 59 freq bauchle (3) - 26 freq bathered (3) - 8 freq bauchelt (3) - 3 freq pauchler (3) - 1 freq watcher (3) - 1 freq bauchled (3) - 6 freq bachled (3) - 1 freq butcher (3) - 36 freq wauchelt (4) - 2 freq rauchled (4) - 1 freq battels (4) - 1 freq |
batcheler (0) - 1 freq bachelor (3) - 4 freq bacheleir (3) - 1 freq butcher (4) - 36 freq bach'ler (4) - 1 freq pauchler (5) - 1 freq bauchle (5) - 26 freq watcher (5) - 1 freq bachled (5) - 1 freq bather (5) - 59 freq butchery (5) - 2 freq bauchled (5) - 6 freq bauchelt (5) - 3 freq bauchlet (5) - 1 freq bauchles (5) - 4 freq butchered (5) - 4 freq satchel (5) - 8 freq bachle (5) - 1 freq catcher (5) - 2 freq witchell (6) - 1 freq baither (6) - 2 freq bother (6) - 329 freq bitches (6) - 6 freq butler (6) - 8 freq brocher (6) - 2 freq |
SoundEx code - B324 bed-claes - 4 freq bedclathes - 1 freq bedclaes - 12 freq botticelli - 1 freq buit-soles - 1 freq batcheler - 1 freq budgells - 1 freq bedclothes - 1 freq btglqkqf - 1 freq |
MetaPhone code - BXLR bachelor - 4 freq bach'ler - 1 freq batcheler - 1 freq bacheleir - 1 freq |
BATCHELER |
| Time to execute Levenshtein function - 0.216443 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.437190 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.036797 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.048581 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.001151 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. |