| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| orbit (0) - 10 freq orbits (1) - 1 freq oubit (1) - 2 freq worrit (2) - 22 freq rit (2) - 13 freq forkit (2) - 4 freq oobin (2) - 2 freq ojbt (2) - 1 freq amorbit (2) - 1 freq robit (2) - 1 freq sorrit (2) - 4 freq oolit (2) - 2 freq fornit (2) - 1 freq oobits (2) - 5 freq oreat (2) - 1 freq -bit (2) - 1 freq arrit (2) - 1 freq forbid (2) - 10 freq bobbit (2) - 2 freq greit (2) - 18 freq gorbilt (2) - 1 freq abit (2) - 1 freq freit (2) - 2 freq rait (2) - 3 freq oit (2) - 1 freq |
orbit (0) - 10 freq arbeit (2) - 1 freq robit (2) - 1 freq orbits (2) - 1 freq oubit (2) - 2 freq bit (3) - 7597 freq ruit (3) - 19 freq orb (3) - 2 freq robbit (3) - 2 freq urgit (3) - 1 freq armit (3) - 4 freq 'bit (3) - 24 freq orbital (3) - 3 freq orkut (3) - 1 freq rbib (3) - 1 freq ort (3) - 2 freq debit (3) - 2 freq sorbet (3) - 2 freq orbitan (3) - 2 freq orbitin (3) - 1 freq rebat (3) - 5 freq crabit (3) - 1 freq robot (3) - 6 freq robt (3) - 1 freq orti (3) - 1 freq |
SoundEx code - O613 orbit - 10 freq orbitin - 1 freq orbital - 3 freq orbitan - 2 freq owrepeyed - 1 freq orbits - 1 freq orvieto - 1 freq owerhyped - 1 freq orbttimtoy - 1 freq oorpatts - 3 freq |
MetaPhone code - ORBT orbit - 10 freq |
ORBIT |
| Time to execute Levenshtein function - 0.288406 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.609302 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.081791 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.090446 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.000913 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. |