| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| grectin (0) - 1 freq greitin (1) - 26 freq erectin (1) - 1 freq greetin (1) - 366 freq reckin (2) - 5 freq wreckin (2) - 3 freq greitit (2) - 1 freq greetins (2) - 7 freq electin (2) - 2 freq greinin (2) - 3 freq greenin (2) - 7 freq grespin (2) - 3 freq graftin (2) - 6 freq breetin (2) - 1 freq greetan (2) - 10 freq gleetin (2) - 2 freq grenein (2) - 1 freq grittin (2) - 3 freq frettin (2) - 2 freq geckin (2) - 3 freq vreetin (2) - 2 freq treatin (2) - 15 freq recitin (2) - 7 freq vreitin (2) - 1 freq greeting (2) - 13 freq |
grectin (0) - 1 freq greitin (2) - 26 freq greetin (2) - 366 freq erectin (2) - 1 freq erection (3) - 3 freq gratin (3) - 4 freq grantin (3) - 2 freq recitin (3) - 7 freq directin (3) - 4 freq reactin (3) - 6 freq groutin (3) - 1 freq gruntin (3) - 7 freq grecian (3) - 1 freq grittin (3) - 3 freq gertin (3) - 1 freq greittin (3) - 2 freq 'recitin (3) - 1 freq greetan (3) - 10 freq graftin (3) - 6 freq breckin (4) - 2 freq wreckin (4) - 3 freq greivin (4) - 1 freq greachan (4) - 5 freq reaction (4) - 51 freq grenein (4) - 1 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 - KRKTN correctin - 6 freq kirktoun - 1 freq grectin - 1 freq croquetin - 1 freq kirkton - 5 freq croquetan - 1 freq crackdoon - 1 freq |
GRECTIN |
| Time to execute Levenshtein function - 0.550291 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.739533 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.052724 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.060850 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.000913 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. |