| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| surgery (0) - 29 freq sugery (1) - 1 freq surely (2) - 179 freq surged (2) - 1 freq margery (2) - 1 freq surfer (2) - 1 freq burger (2) - 13 freq forgery (2) - 1 freq buggery (2) - 10 freq sugary (2) - 10 freq surer' (2) - 1 freq surley (2) - 3 freq sergey (2) - 1 freq burgers (2) - 11 freq surrey (2) - 2 freq sudgers (2) - 5 freq nursery (2) - 29 freq suger (2) - 1 freq survey (2) - 33 freq surgeon (2) - 10 freq sorcery (2) - 1 freq surge (2) - 15 freq sure's (3) - 3 freq curlers (3) - 6 freq airtery (3) - 1 freq |
surgery (0) - 29 freq sugery (2) - 1 freq suger (3) - 1 freq sergey (3) - 1 freq sorcery (3) - 1 freq surge (3) - 15 freq sugary (3) - 10 freq surgeon (3) - 10 freq surrey (3) - 2 freq surfer (3) - 1 freq surged (3) - 1 freq burger (3) - 13 freq margery (3) - 1 freq forgery (3) - 1 freq sodger (4) - 114 freq sorry (4) - 483 freq sugar (4) - 87 freq darger (4) - 2 freq server (4) - 2 freq surgeries (4) - 1 freq sarry (4) - 2 freq surgin (4) - 2 freq sorner (4) - 3 freq seeger (4) - 1 freq merger (4) - 1 freq |
SoundEx code - S626 sorcerer' - 1 freq sorcerer's - 1 freq scourger - 2 freq surgery - 29 freq scarecrow - 5 freq scorcher - 4 freq scroag-airch't - 1 freq shargered - 1 freq sorcery - 1 freq scarecraw - 3 freq schwarzer - 1 freq surgeries - 1 freq scorecard - 3 freq surchargit - 1 freq sharger - 1 freq shargeret - 8 freq surcharge - 1 freq sorcerer - 1 freq screechyer - 1 freq sarasheridan - 11 freq scoresjournal - 3 freq shergar - 1 freq |
MetaPhone code - SRJR surgery - 29 freq |
SURGERY |
| Time to execute Levenshtein function - 0.253779 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.338881 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.027062 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.037333 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. |