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

 The Delphion Integrated View

  Buy Now:   Buy PDF- 20pp  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: US4819271: Constructing Markov model word baseforms from multiple utterances by concatenating model sequences for word segments
[ Derwent Title ]

Country: US United States of America

View Images High


20 pages

Inventor: Bahl, Lalit R.; Amawalk, NY
DeSouza, Peter V.; Yorktown Heights, NY
Mercer, Robert L.; Yorktown Heights, NY
Picheny, Michael A.; 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: 1989-04-04 / 1987-12-16

Application Number: US1987000133719

IPC Code: Advanced: G10L 11/00; G10L 15/06; G10L 15/14;
IPC-7: G10L 5/00;

ECLA Code: G10L15/14M1; T05K999/99;

U.S. Class: Current: 704/256; 704/242; 704/243; 704/E15.029;
Original: 381/043;

Field of Search: 381/041--43 364/513.5

Priority Number:
1987-12-16  US1987000133719

Abstract:     The present invention relates to apparatus and method for segmenting multiple utterances of a vocabulary word in a consistent and coherent manner and determining a Markov model sequence for each segment. A fenemic Markov model corresponds to each label.

Attorney, Agent or Firm: Block, Marc A. ;

Primary / Asst. Examiners: Kemeny, Emanuel S.;

Maintenance Status: E3 Expired  Check current status

INPADOC Legal Status: Show legal status actions          Buy Now: Family Legal Status Report

Related Applications:
Application Number Filed Patent Pub. Date  Title
US1985000738933 1985-05-29    1988-07-19  Constructing Markov models of words from multiple utterances

Parent Case:

    The present application is a continuation-in-part application of a co-pending patent application entitled "Constructing Markov Models of Words from Multiple Utterances", invented by the same inventors herein and also owned by the IBM Corporation, U.S. Ser. No. 738,933, filed on May 29, 1985 now U.S. Pat. No. 4,759,068, issued July 19, l988.

Family: Show 10 known family members

First Claim:
Show all 18 claims
We claim:     1. In a Markov model speech recognition system having an acoustic processor which generates a string of labels in response to an uttered input where each label is one of an alphabet of labels, a computerized method of constructing Markov model word baseforms comprising the steps of:
  • (a) for each of a set of Markov models in which each Markov model corresponds to a respective label and in which each Markov model has (i) a plurality of states and (ii) a plurality of arcs wherein each arc extends from a state to a state, computing and storing in computer memory arc probabilities and label output probabilities wherein each label output probability represents the likelihood of a given label being produced at a given arc;
  • (b) generating, with the acoustic processor, n respective strings of labels in response to each of n utterances of a subject word selected from a vocabulary of words;
  • (c) selecting the string of labels having a length which is closest to the average length of all strings generated in step (b);
  • (d) concatenating in sequence the Markov models which correspond to the successive labels in the selected string and storing the concatenated sequence;
  • (e) for a string other than the selected string, aligning successive substrings of zero or more labels against successive Markov models in the concatenated sequence, based on the stored probabilities;
  • (f) repeating step (e) for each generated string of step (b) other than the selected string, each string generated in step (b) having a respective substring corresponding to each Markov model in the concatenated sequence of step (d);
  • (g) partitioning the generated strings of step (b) into successive common segments, the ith common segment of each string corresponding to the i th substring thereof; and
  • (h) constructing a sequence of one or more Markov models for each ith common segment based on the ith label of the prototype string and the ith substrings of the other strings.

Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

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

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

Patent  Pub.Date  Inventor Assignee   Title
Get PDF - 20pp US4587670  1986-05 Levinson  AT&T Bell Laboratories Hidden Markov model speech recognition arrangement
Foreign References: None

Other Abstract Info: DERABS G88-220129

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