Computer-Implemented Phoneme-Grapheme Matching
AssigneeOxford Learning Solutions Limited
InventorMatthew Bradshaw
Life of this patent
Estimating the term…
Abstract
A computer-implemented method involves matching a predetermined sequence of phonemes with a predetermined sequence of graphemes representing one or more words. For each of the phonemes, there is accessed a set of possibly matching graphemes with an associated probability of matching; the probability may be derived from a set of previously matched phonemes and graphemes. For each phoneme, each of the possibly matching graphemes is compared with a sequence of characters in the one or more words, and a score is assigned to each possibly matching grapheme within the sequence of characters. Where there are a plurality of sequences of possibly matching graphemes, a threshold score may be applied, and the sequences may be ranked according to score.
Claims14
A computer-implemented method of determining a sequence of graphemes in a given word corresponding to a given sequence of phonemes corresponding to the given word, the method comprising:
- accessing a database of potential matches between phonemes and graphemes,
- identifying, by means of the database, one or more possible sequences of graphemes in the given word, each corresponding to the given sequence of phonemes;
- and
- outputting data representing at least one said possible sequences of graphemes.
Dependencies are inferred from the claim text.