| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| recapturin (0) - 1 freq capturin (2) - 1 freq recaptured (2) - 3 freq recantin (3) - 1 freq featurin (3) - 8 freq enrapturin (3) - 1 freq reassurin (3) - 7 freq caipturin (3) - 1 freq lecturin (3) - 3 freq caterin (4) - 4 freq reassuring (4) - 2 freq captain (4) - 71 freq recurrin (4) - 2 freq retumin (4) - 1 freq reassurit (4) - 1 freq retirin (4) - 10 freq captur (4) - 1 freq gesturin (4) - 18 freq featuring (4) - 4 freq scaiterin (4) - 1 freq return (4) - 132 freq captured (4) - 30 freq recaain (4) - 1 freq hectorin (4) - 1 freq scaurin (4) - 1 freq |
recapturin (0) - 1 freq recaptured (3) - 3 freq capturin (3) - 1 freq caipturin (4) - 1 freq receptioun (5) - 1 freq reception (5) - 30 freq lecturin (5) - 3 freq recantin (5) - 1 freq enrapturin (5) - 1 freq rapture (6) - 1 freq registerin (6) - 3 freq caperin (6) - 3 freq capture (6) - 22 freq captures (6) - 3 freq captin (6) - 2 freq cap'rin (6) - 1 freq recoverin (6) - 7 freq repairin (6) - 3 freq retourin (6) - 4 freq raptur (6) - 3 freq receptautioun (6) - 1 freq recitin (6) - 7 freq canterin (6) - 1 freq reactin (6) - 6 freq picturin (6) - 1 freq |
SoundEx code - R213 received - 53 freq reception - 30 freq risped - 1 freq receipt - 18 freq recaptured - 3 freq receivit - 3 freq rose-fite - 1 freq reeseeved - 1 freq respite - 4 freq rugby-tackle - 1 freq rose-bed - 1 freq receptionist - 10 freq rasped - 3 freq resaived - 2 freq receptacles - 1 freq receipts - 5 freq respiyt - 1 freq rosebuds - 1 freq rispit - 1 freq receptautioun - 1 freq recapturin - 1 freq receptioun - 1 freq receptive - 4 freq receptacle - 1 freq re-shaped - 1 freq rosebed - 1 freq receptionists - 2 freq rikfyddljv - 1 freq recipt - 1 freq rugbyaid - 1 freq rosebeds - 1 freq rsbatxdve - 1 freq rspbdandg - 1 freq |
MetaPhone code - RKPTRN recapturin - 1 freq |
RECAPTURIN |
| Time to execute Levenshtein function - 0.235552 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.413977 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.027741 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.037595 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.000982 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. |