| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oxbridge (0) - 8 freq oatridge (2) - 2 freq bridge (2) - 74 freq footbridge (3) - 1 freq o'pride (3) - 1 freq coleridge (3) - 1 freq porridge (3) - 44 freq ridge (3) - 18 freq parridge (3) - 3 freq bridged (3) - 1 freq bevridge (3) - 1 freq oxide (3) - 1 freq bridge' (3) - 3 freq longridge (3) - 1 freq bridle (3) - 12 freq abridged (3) - 1 freq bride (3) - 55 freq bridie (3) - 35 freq cambridge (3) - 14 freq bridges (3) - 12 freq bridget (3) - 2 freq oblige (3) - 2 freq merridge (3) - 1 freq mcbride (3) - 2 freq thebridge (3) - 1 freq |
oxbridge (0) - 8 freq bridge (3) - 74 freq oatridge (4) - 2 freq cambridge (5) - 14 freq bridie (5) - 35 freq abridged (5) - 1 freq bridges (5) - 12 freq bride (5) - 55 freq thebridge (5) - 1 freq coatbridge (5) - 1 freq purridge (5) - 8 freq bridle (5) - 12 freq merridge (5) - 1 freq bridget (5) - 2 freq fridge (5) - 59 freq porridge (5) - 44 freq coleridge (5) - 1 freq footbridge (5) - 1 freq parridge (5) - 3 freq ridge (5) - 18 freq bevridge (5) - 1 freq bridged (5) - 1 freq bridge' (5) - 3 freq briggie (6) - 2 freq umbrage (6) - 1 freq |
SoundEx code - O216 oxford - 27 freq oxbridge - 8 freq osborne - 3 freq ospreys - 1 freq oxfurd - 2 freq o'spray - 1 freq oxford-learit - 1 freq osprey - 2 freq occupier - 1 freq osbourne - 1 freq o-is-for-hoolet-back-green-photo-by-irene-mcfarlane-lst - 1 freq o-is-for-hoolet-scratch-arches-live-oct- - 1 freq ogfrjys - 1 freq oisforhoolet - 4 freq oxforddiplomat - 2 freq oxfordshire - 1 freq |
MetaPhone code - OKSBRJ oxbridge - 8 freq |
OXBRIDGE |
| Time to execute Levenshtein function - 0.205808 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.346515 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.028592 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.037596 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.000883 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. |