Eugene H Ratzlaff

US Patent:

6401067, Jun 4, 2002

Filed:

Jan 28, 1999

Appl. No.:

09/238288

Inventors:

James R. Lewis - Delray Beach FL
Michael P. Perrone - Yorktown NY
John F. Pitrelli - Danbury CT
Eugene H. Ratzlaff - Hopewell Junction NY
Jayashree Subrahmonia - White Plains NY

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G10L 1500

US Classification:

704275, 704231

Abstract:

A data recognition system and method which allows a user to select between a âdefault recognitionâ mode and a âconstrained recognitionâ mode via a user interface. In the default recognition mode, a recognition engine utilizes predetermined default recognition parameters to decode data (e. g. , handwriting and speech). In the constrained recognition mode, the user can select one or more of a plurality of recognition constraints which temporarily modify the default recognition parameters to decode uncharacteristic and/or special data. The recognition parameters associated with the selected constraint enable the recognition engine to utilize specific information to decode the special data, thereby providing increased recognition accuracy.

US Patent:

6603881, Aug 5, 2003

Filed:

Oct 23, 2001

Appl. No.:

10/047152

Inventors:

Michael P. Perrone - Yorktown NY
Eugene H. Ratzlaff - Hopewell Junction NY

Assignee:

International Business Machines Corporation - Armonk NJ

International Classification:

G06K 918

US Classification:

382186, 382181, 382187, 382189, 382202, 382225

Abstract:

Systems and methods for reordering unconstrained handwriting data using both spatial and temporal interrelationships prior to recognition, and for spatially organizing and formatting machine recognized transcription results. The present invention allows a machine recognizer to generate and present a full and accurate transcription of unconstrained handwriting in its correct spatial context such that the transcription output can appear to âmirrorâ the corresponding handwriting.

US Patent:

6757647, Jun 29, 2004

Filed:

Jul 30, 1998

Appl. No.:

09/126269

Inventors:

Krishna S. Nathan - New York NY
Eugene H. Ratzlaff - Hopewell Junction NY

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1721

US Classification:

704 10, 704254, 715532

Abstract:

Systems and methods are described for concisely encoding into a lexicon (or dictionary) and decoding from the lexicon regular expressions that can represent certain huge word lists that might otherwise be considered unmanageably large. Sets of words (character sequences or âstringsâ) that share certain commonalities such as a set of numbers, which share common digits, may be condensed into digital lexicons by representing the set with a regular expression. The regular expression is a string that includes meta-character, where each meta-character is a place-marker that represents a set of at least two normal characters. When accessing or searching the lexicon, the regular expressions are dynamically expanded, as needed, to the underlying, original word list. The methods disclosed are applicable to many lexicon driven language based systems such as spelling verification systems, handwriting recognition systems, speech recognition systems and the like.

US Patent:

6826306, Nov 30, 2004

Filed:

Jan 29, 1999

Appl. No.:

09/240146

Inventors:

James R. Lewis - Delray Beach FL
Julia E. Maners - Boca Raton FL
Kerry A. Ortega - Deerfield Beach FL
Michael P. Perrone - Yorktown NY
Eugene H. Ratzlaff - Hopewell Junction NY
Jayashree Subrahmonia - White Plains NY
Ron Van Buskirk - IndianTown FL
Huifang Wang - West Palm Beach FL

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06K 900

US Classification:

382187, 382228, 382119, 704244

Abstract:

A system and method for automatically providing quality assurance for user enrollment in a recognition system. Advantageously, the quality a new enrollment (i. e. , a newly trained user-dependent prototype) is assessed before the new enrollment is accepted in place of a current enrollment. This quality check is performed by decoding stored user test data using the new enrollment, comparing the decoding results of the new enrollment to the known script used to generate the test data to obtain an accuracy score for the new enrollment, and then comparing the accuracy score for the new enrollment with an accuracy score of a previous qualified enrollment (or, in the case where there is no previous, qualified enrollment, to the accuracy of the speaker independent model). If the decoding results of the new enrollment are acceptable, the new enrollment will be used for recognition; otherwise it will be rejected and discarded.

US Patent:

7260779, Aug 21, 2007

Filed:

Sep 30, 2005

Appl. No.:

11/240605

Inventors:

Paul Turquand Keyser - Mount Kisco NY, US
Michael Peter Perrone - Yorktown NY, US
Eugene H. Ratzlaff - Hopewell Junction NY, US
Jayashree Subrahmonia - White Plains NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 15/00

US Classification:

715525, 382187

Abstract:

In one aspect of the present invention, page breaks are identified in the following manner. A set of ink data and a document description are processed by a variety of scoring methods, each of which generates a score for each possible insertion point in the ink. These scores are combined to produce a ranked list of hypothesized page breaks for the corresponding ink data. This ranked list is then used either to insert page breaks automatically using a predefined threshold to determine a cut-off in the list; or to present, on-line, to a human for verification/approval; or a mixture of the two based on two thresholds: one for automatic insertion and the other for human verification. It is to be understood not all scoring methods need be used, that is, one or more of the scoring methods may be used as needed.

US Patent:

7400277, Jul 15, 2008

Filed:

Apr 6, 2004

Appl. No.:

10/818567

Inventors:

Michael P. Perrone - Yorktown Heights NY, US
Eugene H. Ratzlaff - Hopewell Junction NY, US
Jianying Hu - Bronx NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H03M 7/00

US Classification:

341107, 341106, 341 65, 341 67

Abstract:

The present invention relates to a method, computer program product and system for the compression of a probability table and the reconstruction of one or more probability elements using the compressed data and method. After determining a probability table that is to be compressed, the probability table is compressed using a first probability table compression method, wherein the probability table compression method creates a first compressed probability table. The first compressed probability table contains a plurality of probability elements. Further, the probability table is compressed using a second probability table compression method, wherein the probability table compression method creates a second compressed probability table. The second compressed probability table containing a plurality of probability elements. A first probability element reconstructed using the first compressed probability table is thereafter merged with a second probability element reconstructed using the second compressed probability table in order to produce a merged probability element.

US Patent:

7502017, Mar 10, 2009

Filed:

Nov 20, 2007

Appl. No.:

11/943260

Inventors:

Eugene Henry Ratzlaff - Hopewell Junction NY, US
Yin-Min Chee - Yorktown Heights NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 3/041

US Classification:

345173, 715700

Abstract:

A handwriting recognition device including a handwriting recognizing component such as a software application running on a microprocessor. A user interface includes a display having a stroke entry field for digitizing and displaying the strokes comprising one or more written characters, and also incorporates a character spacing indicator to indicate a new character entry field with an adjacent new word indicator to indicate a new word entry field. A recognized character display area is on the display substantially adjacent to the stroke entry and display field. The handwriting recognition component includes an output recognition buffer (ORB) for holding and correcting characters while the characters are being displayed in the recognized character display area.

US Patent:

7627596, Dec 1, 2009

Filed:

Feb 19, 2002

Appl. No.:

10/079741

Inventors:

Thomas Yu-Kiu Kwok - Washington Township NJ, US
James Randal Moulic - Poughkeepsie NY, US
Kenneth Blair Ocheltree - Ossining NY, US
Michael Peter Perrone - Yorktown Heights NY, US
John Ferdinand Pitrelli - Danbury CT, US
Eugene Henry Ratzlaff - Hopewell Junction NY, US
Gregory Fraser Russell - Yorktown Heights NY, US
Jayashree Subrahmonia - White Plains NY, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/00

US Classification:

707102, 715268

Abstract:

The techniques in the present invention allow both text and handwritten queries, and the queries can be single-word or multiword. Generally, each handwritten word in a handwritten document is converted to a document stack of words, where each document stack contains a list of text words and a word score of some type for each text word in the list. The query is also converted to one or more stacks of words. A measure is determined from each query and document stack. Documents that meet search criteria in the query are then selected based on the query and the values of the measures. The present invention also performs multiple recognitions, with multiple recognizers, on a handwritten document to create multiple recognized transcriptions of the document. The multiple transcriptions are used for document retrieval. In another embodiment, a single transcription is created from the multiple transcriptions, and the single transcription is used for document retrieval.