Spell checker with arbitrary length string-to-string...

Details Spell checker with arbitrary length string-to-string... Spell checker with arbitrary length string-to-string...

2007-10-30

2007-10-30

Hong, Stephen (Department: 2178)

Data processing: presentation processing of document, operator i

Presentation processing of document

Layout

Reexamination Certificate

active

11182388

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.

REFERENCES:
patent: 4383307 (1983-05-01), Gibson, III
patent: 4833610 (1989-05-01), Zamora et al.
patent: 5095432 (1992-03-01), Reed
patent: 5175803 (1992-12-01), Yeh
patent: 5214583 (1993-05-01), Miike et al.
patent: 5218536 (1993-06-01), McWherter
patent: 5258909 (1993-11-01), Damerau et al.
patent: 5278943 (1994-01-01), Gasper et al.
patent: 5319552 (1994-06-01), Zhong
patent: 5510998 (1996-04-01), Woodurff et al.
patent: 5521816 (1996-05-01), Roche et al.
patent: 5535119 (1996-07-01), Ito et al.
patent: 5572423 (1996-11-01), Church
patent: 5594642 (1997-01-01), Collins et al.
patent: 5646840 (1997-07-01), Yamauchi et al.
patent: 5652898 (1997-07-01), Kaji
patent: 5671426 (1997-09-01), Armstrong, III
patent: 5704007 (1997-12-01), Cecys
patent: 5715469 (1998-02-01), Arning
patent: 5732276 (1998-03-01), Komatsu et al.
patent: 5774834 (1998-06-01), Visser
patent: 5781884 (1998-07-01), Pereira et al.
patent: 5806021 (1998-09-01), Chen et al.
patent: 5835924 (1998-11-01), Maruyama et al.
patent: 5893133 (1999-04-01), Chen
patent: 5907705 (1999-05-01), Carter
patent: 5930755 (1999-07-01), Cecys
patent: 5933525 (1999-08-01), Makhoul et al.
patent: 5956739 (1999-09-01), Golding et al.
patent: 5970492 (1999-10-01), Nielsen
patent: 5974371 (1999-10-01), Hirai et al.
patent: 5974413 (1999-10-01), Beauregard et al.
patent: 5987403 (1999-11-01), Sugimura
patent: 6047300 (2000-04-01), Walfish et al.
patent: 6073146 (2000-06-01), Chen
patent: 6131102 (2000-10-01), Potter
patent: 6148285 (2000-11-01), Busardo
patent: 6154758 (2000-11-01), Chiang
patent: 6173252 (2001-01-01), Qiu et al.
patent: 6246976 (2001-06-01), Mukaigawa et al.
patent: 6256630 (2001-07-01), Gilai et al.
patent: 6356866 (2002-03-01), Pratley et al.
patent: 6374210 (2002-04-01), Chu
patent: 6490563 (2002-12-01), Hon et al.
patent: 6573844 (2003-06-01), Venolia et al.
patent: 6646572 (2003-11-01), Brand
patent: 6848080 (2005-01-01), Lee et al.
patent: 7047493 (2006-05-01), Brill et al.
patent: 7076731 (2006-07-01), Brill et al.
patent: 1158776 (1969-07-01), None
Church, K. and W. Gale (1991). “Probability Scoring for Spelling Correction.” Statistics and Computing 1 pp. 93-103.□□.
Brill, Eric and Robert C. Moore (2000). “An Improved Error Model for Noisy Channel Spelling Correction.”

Affiliated with

Also associated with

Rating

Spell checker with arbitrary length string-to-string... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Spell checker with arbitrary length string-to-string..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spell checker with arbitrary length string-to-string... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3895396