| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| greggwatson (0) - 1 freq regulation (4) - 4 freq tryggvason (4) - 1 freq regulations (5) - 5 freq lloydwatson (5) - 2 freq relaxation (5) - 3 freq predication (5) - 4 freq negation (5) - 2 freq greenwash (5) - 1 freq creaation (5) - 1 freq freemason (5) - 1 freq generation (5) - 106 freq gravitation (5) - 1 freq dreggan (5) - 1 freq dreggans (5) - 1 freq retwattin (5) - 1 freq graduation (5) - 2 freq recreation (5) - 5 freq greggwylde (5) - 1 freq imwatson (5) - 1 freq relocation (5) - 2 freq relegation (5) - 4 freq greggs (5) - 21 freq watson (5) - 46 freq relation (5) - 18 freq |
greggwatson (0) - 1 freq tryggvason (7) - 1 freq greggs' (8) - 1 freq greggs (8) - 21 freq greggwylde (8) - 1 freq regulation (8) - 4 freq georgeson (9) - 14 freq watson (9) - 46 freq lloydwatson (9) - 2 freq gerrywilson (9) - 1 freq imwatson (9) - 1 freq segregation (9) - 4 freq greats (9) - 4 freq brewtoon (9) - 1 freq resignation (9) - 12 freq irrigation (9) - 1 freq hewitson (9) - 1 freq relegation (9) - 4 freq braggarts (9) - 1 freq gravitation (9) - 1 freq greenwash (9) - 1 freq grigg's (9) - 1 freq dreggans (9) - 1 freq dreggan (9) - 1 freq graduation (9) - 2 freq |
SoundEx code - G623 grazed - 5 freq grossit - 2 freq grushed - 1 freq grosets - 3 freq gairsty - 2 freq goargit - 1 freq groustie - 2 freq grayssed - 1 freq grist - 36 freq greased - 3 freq grectin - 1 freq graced - 4 freq grassed - 5 freq greased-back - 1 freq greasy-heidit - 1 freq gurged - 1 freq gorged - 2 freq gristle - 3 freq greast - 1 freq grogged - 1 freq gree-get - 1 freq greastest - 1 freq girst - 2 freq grossets - 1 freq gourgaud - 1 freq grosset - 2 freq gorsedh - 1 freq garscadden - 2 freq garygatesmusic - 1 freq georgethepoet - 1 freq grctjk - 1 freq grozet - 1 freq greggwatson - 1 freq |
MetaPhone code - KRKWTSN greggwatson - 1 freq |
GREGGWATSON |
| Time to execute Levenshtein function - 0.704878 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.057066 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.029422 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.175700 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.000965 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. |