Work Files Saved Searches
   My Account                                                  Search:   Quick/Number   Boolean   Advanced       Help   


 The Delphion Integrated View

  Buy Now:   Buy PDF- 10pp  PDF  |   File History  |   Other choices   
  Tools:  Citation Link  |  Add to Work File:    
  View:  Expand Details   |  INPADOC   |  Jump to: 
 
 Email this to a friend  Email this to a friend 
       
Title: US6275801: Non-leaf node penalty score assignment system and method for improving acoustic fast match speed in large vocabulary systems
[ Derwent Title ]


Country: US United States of America

View Images High
Resolution

 Low
 Resolution

 
10 pages

 
Inventor: Novak, Miroslav; Mohegan Lake, NY
Picheny, Michael; White Plains, NY

Assignee: International Business Machines Corporation, Armonk, NY
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
 News, Profiles, Stocks and More about this company

Published / Filed: 2001-08-14 / 1998-11-03

Application Number: US1998000184870

IPC Code: Advanced: G10L 15/08;
Core: G10L 15/00;
IPC-7: G10L 15/14;

ECLA Code: G10L15/08;

U.S. Class: Current: 704/252; 704/255; 704/E15.014;
Original: 704/252; 704/255;

Field of Search: 704/252,255

Priority Number:
1998-11-03  US1998000184870

Abstract:     A method for fast match processing, comprising two stages, a pre-processing stage and an on-line stage. The pre-processing stage comprises the steps of computing an a-priori probability of occurrence for each word from an acoustic vocabulary; deriving a penalty score for each word from said acoustic vocabulary based on each words a-priori probability of occurrence in an input text. The on-line stage operates on an input text stream, comprising the steps of, computing a path score for each word from said input text; combining the computed path score with the derived penalty score to form a combined score and testing the combined score against a threshold to determine top ranking candidate words.

Attorney, Agent or Firm: F. Chau & Associates, LLP ;

Primary / Asst. Examiners: Smits, Talivaldis Ivars;

INPADOC Legal Status: Show legal status actions

Family: None

First Claim:
Show all 10 claims
What is claimed is:     1. In a speech recognition system a method for fast match processing comprising the steps of:
  • (a) computing an a-priori probability of occurrence for each word from an acoustic vocabulary;
  • (b) deriving a penalty score for each word from said acoustic vocabulary based on each word's a-priori probability of occurrence in an input spoken text;
  • analyzing said input spoken text for:
  • (c) computing a path score for each word from said input spoken text, wherein step (c) further comprises the step of constructing an asynchronous tree structure comprising a plurality of branches, leaf nodes, and non-leaf nodes, each leaf node representing one of said words from the input spoken text and each non-leaf node representing a single phone of one or more said words from the input spoken text, wherein each of said leaf nodes is assigned a penalty score in accordance with the word associated with the leaf node and non-leaf nodes are assigned penalty scores derived from leaf node penalty scores, the step of assigning penalty scores for non-leaf nodes from leaf node penalty scores further comprising:
    • identifying a non-leaf node in the tree that is a parent node to at least one leaf node;
    • determining whether there is more than one identified child leaf node;
    • based on the determination step, whenever there is more than one identified child leaf node, choosing the penalty score associated with the child leaf node whose penalty score is most positive, otherwise, whenever there is only one child leaf node, selecting that child leaf node's penalty score; and
  • (d) combining the computed path score with the derived penalty score to form a combined score and testing the combined score against a threshold to determine top ranking candidate words.


Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

Forward References: Show 19 U.S. patent(s) that reference this one

       
U.S. References: Go to Result Set: All U.S. references   |  Forward references (19)   |   Backward references (3)   |   Citation Link

Buy
PDF
Patent  Pub.Date  Inventor Assignee   Title
Get PDF - 79pp US4718094  1988-01 Bahl et al.  International Business Machines Corp. Speech recognition system
Get PDF - 17pp US5729656  1998-03 Nahamoo et al.  International Business Machines Corporation Reduction of search space in speech recognition using phone boundaries and phone ranking
Get PDF - 7pp US6058363  2000-05 Ramalingam  Texas Instruments Incorporated Method and system for speaker-independent recognition of user-defined phrases
       
Foreign References: None

Other References:
  • Bahl et al., "A Fast Approximate Acoustic Match for Large Vocabulary Speech Recognition," IEEE Transactions on Speech and Audio Processing, vol. 1, No. 1, Jan. 1993.


  • Inquire Regarding Licensing

    Powered by Verity


    Plaques from Patent Awards      Gallery of Obscure PatentsNominate this for the Gallery...

    Thomson Reuters Copyright © 1997-2014 Thomson Reuters 
    Subscriptions  |  Web Seminars  |  Privacy  |  Terms & Conditions  |  Site Map  |  Contact Us  |  Help