| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jamieparkuk (0) - 1 freq jamiepaterek (4) - 8 freq jamieca (5) - 3 freq jamiejaycar (5) - 1 freq hamewark (5) - 5 freq jamieeast (5) - 2 freq tattiepark (5) - 1 freq makitauk (6) - 1 freq jairus (6) - 3 freq jackiepatie (6) - 38 freq katieprice (6) - 1 freq jamiegreeneuk (6) - 3 freq jamierodden (6) - 5 freq jamie's (6) - 10 freq lamarck (6) - 1 freq jamietinlin (6) - 1 freq samarkan (6) - 9 freq jimmypaul (6) - 1 freq jadruk (6) - 1 freq hamewirk (6) - 2 freq jameela (6) - 2 freq angelauk (6) - 4 freq sagitarius (6) - 2 freq jamespearson (6) - 3 freq jamesorr (6) - 1 freq |
jamieparkuk (0) - 1 freq jamiepaterek (6) - 8 freq jamiegreeneuk (8) - 3 freq hamewark (8) - 5 freq jamtarts (9) - 4 freq jamjarim (9) - 2 freq jamesorr (9) - 1 freq i'park (9) - 2 freq jimper (9) - 2 freq jamespearson (9) - 3 freq maxitekuk (9) - 1 freq hamewurk (9) - 1 freq jumpers (9) - 16 freq hamework (9) - 10 freq jamieyourdon (9) - 1 freq rampart (9) - 2 freq jumper's (9) - 1 freq markus (9) - 1 freq carpark (9) - 5 freq jadruk (9) - 1 freq jamieonkeys (9) - 2 freq ramparts (9) - 2 freq tattiepark (9) - 1 freq jamieeast (9) - 2 freq jamieca (9) - 3 freq |
SoundEx code - J516 jumpers - 16 freq jumper - 43 freq jumper's - 1 freq jennifer - 14 freq jennifer's - 1 freq jump-for-joy - 1 freq jimper - 2 freq junipere - 15 freq jamphery - 1 freq jamiefairbairn - 18 freq jnfr - 1 freq juniperquineabz - 1 freq jimmyfer - 4 freq jamiebrysoncpni - 2 freq jimfairlielogie - 1 freq janefraseralba - 1 freq janforindy - 3 freq jennifermjones - 1 freq johnfergusonhh - 1 freq johnburnswriter - 1 freq jimfairlie - 8 freq johnbrash - 25 freq jamiebrodie - 4 freq jamieparkuk - 1 freq jamiehepburn - 1 freq jschamberlain - 1 freq |
MetaPhone code - JMPRKK jamieparkuk - 1 freq |
JAMIEPARKUK |
| Time to execute Levenshtein function - 0.708555 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 - 1.302048 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.091082 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.114482 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.001353 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. |