Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
orbit (0) - 10 freq oubit (1) - 2 freq orbits (1) - 1 freq corbitt (2) - 1 freq crait (2) - 1 freq oagit (2) - 5 freq oolit (2) - 2 freq oit (2) - 1 freq crabit (2) - 1 freq corbie (2) - 27 freq wormit (2) - 6 freq debit (2) - 2 freq vreit (2) - 1 freq forkit (2) - 4 freq orti (2) - 1 freq freit (2) - 2 freq worsit (2) - 11 freq oreat (2) - 1 freq forit (2) - 1 freq owbbt (2) - 3 freq grait (2) - 1 freq arbeit (2) - 1 freq morbid (2) - 3 freq robit (2) - 1 freq trait (2) - 11 freq |
orbit (0) - 10 freq arbeit (2) - 1 freq oubit (2) - 2 freq robit (2) - 1 freq orbits (2) - 1 freq habit (3) - 49 freq roit (3) - 1 freq orkut (3) - 1 freq orbitin (3) - 1 freq ebbit (3) - 1 freq bit (3) - 7493 freq ort (3) - 2 freq rit (3) - 13 freq sorbet (3) - 2 freq rebat (3) - 5 freq rait (3) - 3 freq wibit (3) - 1 freq arrit (3) - 1 freq ojbt (3) - 1 freq wabit (3) - 1 freq robbit (3) - 2 freq obitu (3) - 1 freq amorbit (3) - 1 freq robt (3) - 1 freq robot (3) - 6 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.245207 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.387561 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.028209 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.038409 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.000826 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. |