| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| katrina (0) - 1 freq catrina (1) - 1 freq katrine (1) - 3 freq marina (2) - 4 freq catriona (2) - 3 freq 'katrine (2) - 1 freq karine (2) - 2 freq patina (2) - 1 freq athin (3) - 226 freq wastrin (3) - 1 freq kari (3) - 16 freq harin (3) - 2 freq aathin' (3) - 1 freq caterin (3) - 4 freq karen (3) - 114 freq athing (3) - 77 freq katja (3) - 6 freq datin (3) - 11 freq machina (3) - 1 freq airin (3) - 4 freq airing (3) - 1 freq atin (3) - 3 freq eatin' (3) - 2 freq angina (3) - 3 freq pairing (3) - 2 freq |
katrina (0) - 1 freq katrine (1) - 3 freq catrina (2) - 1 freq karine (3) - 2 freq 'katrine (3) - 1 freq catriona (3) - 3 freq kaitren (3) - 6 freq paatrin (4) - 1 freq antrin (4) - 67 freq cautrine (4) - 3 freq katharine (4) - 2 freq karn (4) - 7 freq kythin (4) - 35 freq kathryn (4) - 1 freq karoona (4) - 1 freq trine (4) - 2 freq patron (4) - 10 freq kittin (4) - 1 freq ootrin (4) - 1 freq patren (4) - 3 freq katherine (4) - 5 freq waterin (4) - 7 freq matron (4) - 2 freq kavrny (4) - 1 freq kabrun (4) - 1 freq |
SoundEx code - K365 katherine - 5 freq 'katherine - 1 freq katrine - 3 freq katrina - 1 freq kathryn - 1 freq katharine - 2 freq 'katrine - 1 freq kyoderin - 1 freq kaitren - 6 freq katheryne - 1 freq kitterumpit - 1 freq katrinamurphyir - 7 freq kathrynhall - 1 freq katrinawatson - 1 freq |
MetaPhone code - KTRN katrine - 3 freq katrina - 1 freq cautrine - 3 freq cateran - 3 freq caterin - 4 freq 'katrine - 1 freq gadarine - 1 freq gadderin - 14 freq cataran - 1 freq gadarene - 1 freq kaitren - 6 freq gutterin - 5 freq caudron - 1 freq cuiterin - 1 freq catrina - 1 freq gaaderin - 1 freq catriona - 3 freq |
KATRINA |
| Time to execute Levenshtein function - 0.336417 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.597878 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.027095 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.077685 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.001035 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. |