| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spinal (0) - 3 freq epinal (1) - 1 freq spital (1) - 1 freq spiral (1) - 11 freq spinks (2) - 1 freq singal (2) - 1 freq spinny (2) - 1 freq spinne (2) - 2 freq shinan (2) - 10 freq spinnan (2) - 3 freq spined (2) - 1 freq spinly (2) - 1 freq spitals (2) - 1 freq spink (2) - 1 freq sinai (2) - 2 freq spindle (2) - 1 freq spiel (2) - 19 freq speal (2) - 1 freq ospital (2) - 8 freq spill (2) - 24 freq urinal (2) - 6 freq penal (2) - 5 freq final (2) - 166 freq spirals (2) - 2 freq spinfu (2) - 1 freq |
spinal (0) - 3 freq spinly (2) - 1 freq spiral (2) - 11 freq epinal (2) - 1 freq spital (2) - 1 freq spinnly (3) - 1 freq spin (3) - 65 freq penal (3) - 5 freq spinfu (3) - 1 freq spinnle (3) - 4 freq spint (3) - 24 freq spine (3) - 28 freq signal (3) - 30 freq spirl (3) - 4 freq seminal (3) - 1 freq spins (3) - 10 freq spill (3) - 24 freq spines (3) - 5 freq spindly (3) - 3 freq spaniel (3) - 4 freq spink (3) - 1 freq spined (3) - 1 freq spinne (3) - 2 freq ospital (3) - 8 freq spindle (3) - 1 freq |
SoundEx code - S154 spineless - 3 freq spinal - 3 freq spinly - 1 freq spaniel - 4 freq spinnle - 4 freq spinnle-ligged - 1 freq span-lang - 2 freq spinnles - 1 freq spinnly - 1 freq sophieenaylor - 1 freq spinelesssuperheroes - 1 freq |
MetaPhone code - SPNL spinal - 3 freq spinly - 1 freq spaniel - 4 freq spinnle - 4 freq spinnly - 1 freq |
SPINAL |
| Time to execute Levenshtein function - 0.213309 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.359233 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.027991 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.038927 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.000931 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. |