Kurzweil Applied Intelligence, Inc.

Scansoft, Inc.

Lernout & Hauspie Speech Products N.v.

Kurzwell Applied Intelligence, Inc.

John Armstrong, Iii

Donald Bryant Selesky

William F Ganong, Iii

Stuart Merrill Shieber

Girija Yegnanarayanan

Brian Wilson

Dong Hsu

Rafael Baptista

Brian Gladstein

Bryan A Bentz

Rafael Jose Baptista

A graphical user interface allows a speech recognition system user to browse available grammars and their topics. A dialog box interface displays the currently active grammar, grammar searching mode, and a current input. A list of valid word phrases of at least one word also is generated and displayed. Using the interface, a user additionally may select an active grammar and a method of searching and displaying valid examples from the grammar based on the current input.

User interface for speech recognition system grammars

A system and method of allowing a user to control a computer application with spoken commands, include the steps of processing the spoken commands with a Speech Recognition application into candidate word phrases, and parsing at least one candidate word phrase with a Context Free Grammar (CFG) parser, into a parse tree. A plurality of predefined rewrite rules grouped into a plurality of phases applied are to the parse tree, for rewriting the parse tree. Each of the plurality of rewrite rules includes a pattern matching portion, for matching at least a part of the parse tree, and a rewrite component, for rewriting the matched part. A command string is produced by traversing each terminal node of the modified parse tree. The command string is sent to an interpreter application or directly to the computer application. Possible applications include word processing and other voice-entry systems.

Command parsing and rewrite system

A system and method for remotely grouping contents of an action history stack running on a computer system. An action is performed in a first application which causes a beginning marker to be placed on the action history stack. One or more actions are performed in the first application. Each action performed is also stored on the action history stack. Finally an action is performed which causes an end marker to be placed on the action history stack. When some actions need to be undone, a first action is caused to be undone. If the undone action indicates an end marker, then more actions are caused to be undone until an undone action indicates a beginning marker. This method is useful for any application which uses an action history stack, and where access to the action history stack is limited. In one embodiment, the application is a word processing program, and the steps of the invention are performed by a voice recognition system.

System and method for remotely grouping contents of an action history

In the speech recognition system disclosed herein, an input utterance is submitted to both a large vocabulary isolated word speech recognition module and a small vocabulary continuous speech recognition module. The small vocabulary contains command words which can be combined in sequences to define commands to an application program. The two recognition modules generate respective scores for identified large vocabulary models and for sequences of small vocabulary models. The score provided by the continuous speech recognizer is normalized on the basis of the length of the speech input utterance and an arbitration algorithm selects among the candidates identified by the recognition modules. Without requiring the user to switch modes, text is output if a score from the isolated word recognizer is selected and a command is output if a score from the continuous speech recognizer is selected.

Speech recognition system distinguishing dictation from commands by

The electronic dictionary disclosed herein is organized for expeditious search based on partial spelling by assigning words to blocks having a predetermined maximum size, the blocks being represented by respective partial spelling sequencer. The words are assigned to blocks by progressing through successive possible sequences in order and, for each sequence, determining the number of words in the set of words corresponding to that sequence. If the number of words is less than the maximum, all of the words in the set are assigned to a corresponding terminal block. Otherwise words up to a preselected number are assigned to a non-terminal block and the partial spelling sequence is extended. As a result of the organization only one call to the dictionary needs to be made for each extension of the sequence.

Method for organizing incremental search dictionary

Growing community of inventors

Cambridge, MA, United States of America

John Armstrong, Iii