| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bachelor (0) - 4 freq bach'ler (2) - 1 freq batcheler (2) - 1 freq bachelor's (2) - 1 freq bacheleir (2) - 1 freq rachel's (3) - 2 freq bucher (3) - 1 freq athenor (3) - 1 freq bather (3) - 59 freq bachled (3) - 1 freq bauchelt (3) - 3 freq rachel (3) - 17 freq dachelt (3) - 1 freq baelow (3) - 10 freq bachly (3) - 1 freq bachlt (3) - 1 freq acher (3) - 1 freq bachle (3) - 1 freq backdoor (3) - 2 freq mackellar (4) - 1 freq bathert (4) - 11 freq cher (4) - 6 freq packer (4) - 1 freq tailor (4) - 28 freq baffel (4) - 1 freq |
bachelor (0) - 4 freq bacheleir (2) - 1 freq batcheler (3) - 1 freq bach'ler (3) - 1 freq bauchelt (4) - 3 freq bachly (4) - 1 freq bachle (4) - 1 freq bachlt (4) - 1 freq bachled (4) - 1 freq bucher (4) - 1 freq bachelor's (4) - 1 freq scholar (5) - 21 freq bauchlie (5) - 1 freq bauchled (5) - 6 freq bauchilt (5) - 2 freq bauchle (5) - 26 freq bauchlin (5) - 1 freq bauchles (5) - 4 freq bauchlet (5) - 1 freq acher (5) - 1 freq rachel (5) - 17 freq bather (5) - 59 freq bauchly (5) - 1 freq dachelt (5) - 1 freq pauchler (5) - 1 freq |
SoundEx code - B246 bachelor - 4 freq bachelor's - 1 freq bookseller - 2 freq bach'ler - 1 freq buik-lear - 2 freq bachelorette - 1 freq beuklare - 2 freq buik-lair - 1 freq bukklers - 1 freq bacheleir - 1 freq buik-lairnin - 1 freq bbclaurak - 1 freq biglarry - 1 freq |
MetaPhone code - BXLR bachelor - 4 freq bach'ler - 1 freq batcheler - 1 freq bacheleir - 1 freq |
BACHELOR |
| Time to execute Levenshtein function - 0.198906 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.380762 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.028519 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.037958 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.000861 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. |