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

 The Delphion Integrated View

  Buy Now:   Buy PDF- 12pp  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: US6385579: Methods and apparatus for forming compound words for use in a continuous speech recognition system
[ Derwent Title ]

Country: US United States of America

View Images High


12 pages

Inventor: Padmanabhan, Mukund; White Plains, NY
Saon, George Andrei; Putnam Valley, 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: 2002-05-07 / 1999-04-29

Application Number: US1999000302032

IPC Code: Advanced: G10L 15/06; G10L 15/18;
IPC-7: G10L 15/06; G10L 15/14;

ECLA Code: G10L15/063; S10L15/197;

U.S. Class: Current: 704/243; 704/E15.008;
Original: 704/243; 704/256;

Field of Search: 704/243-245,235,255-257

Government Interest:     The invention was made at least in part with Government support under grant contract no. MDA972-97-C-0012 awarded by the Defense Advanced Research Project Agency (DARPA) of the U.S. Department of Defense. The Government has certain rights in the invention.

Priority Number:
1999-04-29  US1999000302032

Abstract:     A method of forming an augmented textual training corpus with compound words for use with an associated with a speech recognition system includes computing a measure for a consecutive word pair in the training corpus. The measure is then compared to a threshold value. The consecutive word pair is replaced in the training corpus with a corresponding compound word depending on the result of the comparison between the measure and the threshold value. One or more measures may be employed. A first measure is an average of a direct bigram probability value and a reverse bigram probability value. A second measure is based on mutual information between the words in the pair. A third measure is based on a comparison of the number of times a co-articulated baseform for the pair is preferred over a concatenation of non-co-articulated individual baseforms of the words forming the pair. A fourth measure is based on a difference between an average phone recognition score for a particular compound word and a sum of respective average phone recognition scores of the words of the pair.

Attorney, Agent or Firm: Ryan, Mason & Lewis, LLP ; Otterstedt, Paul J. ;

Primary / Asst. Examiners: Knepper, David D.;

Maintenance Status: E2 Expired  Check current status

INPADOC Legal Status: Show legal status actions

Family: None

First Claim:
Show all 41 claims
What is claimed is:     1. A method of forming an augmented textual corpus associated with a speech recognition system, the method comprising the steps of:
  • computing a measure for an element set in a textual corpus for comparison to a threshold value, the measure being an average of a direct n-gram probability value and a reverse n-gram probability value; and
  • replacing the element set in the textual corpus with a compound element depending on a result of the comparison between the measure and the threshold value.

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 (6)   |   Citation Link

Patent  Pub.Date  Inventor Assignee   Title
Get PDF - 13pp US5502791  1996-03 Nishimura et al.  International Business Machines Corporation Speech recognition by concatenating fenonic allophone hidden Markov models in parallel among subwords
Get PDF - 15pp US5761687  1998-06 Hon et al.  Apple Computer, Inc. Character-based correction arrangement with correction propagation
Get PDF - 14pp US5835888  1998-11 Kanevsky et al.  International Business Machines Corporation Statistical language model for inflected languages
Get PDF - 11pp US5839106  1998-11 Bellegarda  Apple Computer, Inc. Large-vocabulary speech recognition using an integrated syntactic and semantic statistical language model
Get PDF - 20pp US6009392  1999-12 Kanevsky et al.  International Business Machines Corporation Training speech recognition by matching audio segment frequency of occurrence with frequency of words and letter combinations in a corpus
Get PDF - 12pp US6154722  2000-11 Bellegarda  Apple Computer, Inc. Method and apparatus for a speech recognition system language model that integrates a finite state grammar probability and an N-gram probability
Foreign References: None

Other References:
  • M. Finke et al., "Flexible Transcription Alignment," IEEE Workshop on Speech Recognition and Understanding, pp. 1-7, Santa Barbara, CA, 1997.
  • M. Finke et al., "Speaking Mode Dependent Pronunciation Modeling in Large Vocabulary Conversational Speech Recognition," Proceedings of Eurospeech' 97, pp. 1-4, Rhodos, Greece, 1997.
  • E.P. Giachin et al., "Word Juncture Modeling Using Phonological Rules for HMM-based Continuous Speech Recognition," Computer, Speech and Language, 5:155-168, 1991.

  • 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