| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonnielike (0) - 1 freq bonnie-like (1) - 1 freq bonailie (3) - 1 freq bonniely (3) - 1 freq cannie-like (3) - 4 freq bonnie-die (3) - 1 freq gentielike (3) - 1 freq bonilie (3) - 1 freq cannielik (3) - 1 freq forcie-like (4) - 1 freq bonnieheid (4) - 1 freq bienlike (4) - 2 freq bonnie (4) - 811 freq cannie-lik (4) - 2 freq connerik (4) - 2 freq dowie-like (4) - 8 freq blythelike (4) - 1 freq gentie-like (4) - 10 freq tentie-like (4) - 1 freq somelike (4) - 2 freq bonnie's (4) - 6 freq onietime (4) - 1 freq pensie-like (4) - 1 freq doucelike (4) - 2 freq body-like (4) - 1 freq |
bonnielike (0) - 1 freq bonnie-like (2) - 1 freq bonniely (4) - 1 freq cannielik (4) - 1 freq bienlike (5) - 2 freq bonailie (5) - 1 freq cannie-like (5) - 4 freq bonnily (5) - 11 freq gentielike (5) - 1 freq bonilie (5) - 1 freq bonnie-die (5) - 1 freq bunnels (6) - 1 freq funny-like (6) - 2 freq cannilie (6) - 5 freq blatelike (6) - 1 freq oonlike (6) - 1 freq bunnel (6) - 1 freq belike (6) - 5 freq boannie-laek (6) - 1 freq bairnlike (6) - 4 freq bunnils (6) - 1 freq bunnyel (6) - 1 freq canny-like (6) - 1 freq bunnil (6) - 8 freq bunnle (6) - 8 freq |
SoundEx code - B542 bonnie-lookin - 2 freq boonless - 1 freq bunnles - 3 freq bien-lyke - 1 freq bennels - 1 freq bunnels - 1 freq bienlike - 2 freq bienless - 2 freq boannie-laek - 1 freq bunnils - 1 freq bonnie-like - 1 freq bonnielike - 1 freq bounless - 1 freq bmylcvqiit - 1 freq bmlglyoc - 1 freq benalexcowley - 1 freq |
MetaPhone code - BNLK bien-lyke - 1 freq bienlike - 2 freq boannie-laek - 1 freq bonnie-like - 1 freq bonnielike - 1 freq |
BONNIELIKE |
| Time to execute Levenshtein function - 0.359482 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.631138 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.080366 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.085690 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.001163 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. |