Spell checker with arbitrary length string-to-string transformations to improve noisy channel spelling correction
US7366983B2 · kind B2 · utility
26Cited by
60References
15Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jul 15, 2005 |
| Grant date | Apr 29, 2008 |
| Priority date | — |
| Expiry date | Aug 23, 2025 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG10L15/183
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A spell checker based on the noisy channel model has a source model and an error model. The source model determines how likely a word w in a dictionary is to have been generated. The error model determines how likely the word w was to have been incorrectly entered as the string s (e.g., mistyped or incorrectly interpreted by a speech recognition system) according to the probabilities of string-to-string edits. The string-to-string edits allow conversion of one arbitrary length character sequence to another arbitrary length character sequence.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.