Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
raptor (0) - 1 freq captor (1) - 1 freq raptors (1) - 1 freq raptur (1) - 3 freq reactor (2) - 2 freq raynor (2) - 1 freq razzor (2) - 2 freq ranter (2) - 1 freq actor (2) - 19 freq factor (2) - 31 freq fapor (2) - 2 freq cantor (2) - 1 freq rapier (2) - 2 freq pastor (2) - 1 freq raitir (2) - 1 freq bator (2) - 1 freq riptur (2) - 1 freq captur (2) - 1 freq tractor (2) - 57 freq orator (2) - 2 freq raphoe (2) - 1 freq ratton (2) - 51 freq captors (2) - 4 freq taptoo (2) - 1 freq captir (2) - 1 freq |
raptor (0) - 1 freq raptur (1) - 3 freq riptur (2) - 1 freq captor (2) - 1 freq rapture (2) - 1 freq raptors (2) - 1 freq captir (3) - 1 freq captur (3) - 1 freq orator (3) - 2 freq rapt (3) - 1 freq ripture (3) - 2 freq raitir (3) - 1 freq rafter (3) - 1 freq rector (3) - 4 freq rapper (3) - 4 freq ranter (3) - 1 freq rapier (3) - 2 freq reactor (3) - 2 freq caiptur (4) - 1 freq rpr (4) - 2 freq raynor (4) - 1 freq ratier (4) - 1 freq restore (4) - 9 freq bator (4) - 1 freq capture (4) - 22 freq |
SoundEx code - R136 riptur - 1 freq revedere - 1 freq rafters - 11 freq ruif-trees - 1 freq refters - 1 freq roof-tree - 1 freq ruptured - 1 freq rafter - 1 freq raptor - 1 freq raptur - 3 freq rabbit-horn - 1 freq ripture - 2 freq riptured - 8 freq riptures - 13 freq robotars - 1 freq rapture - 1 freq raptors - 1 freq rapturous - 1 freq robdrummond - 6 freq |
MetaPhone code - RPTR riptur - 1 freq raptor - 1 freq raptur - 3 freq ripture - 2 freq rapture - 1 freq |
RAPTOR |
Time to execute Levenshtein function - 0.250135 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.368508 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.029461 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.040803 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.001045 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. |