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

 The Delphion Integrated View

  Buy Now:   Buy PDF- 53pp  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: US4833712: Automatic generation of simple Markov model stunted baseforms for words in a vocabulary
[ Derwent Title ]

Country: US United States of America

View Images High


53 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-05-23 / 1985-05-29

Application Number: US1985000738934

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

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

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

Field of Search: 381/043 364/513.5

Priority Number:
1985-05-29  US1985000738934

Abstract:     In a system that (i) defines each word in a vocabulary by a fenemic baseform of fenemic phones, (ii) defines an alphabet of composite phones each of which corresponds to at least one fenemic phone, and (iii) generates a string of fenemes in response to speech input, the method provides for converting a word baseform comprised of fenemic phones into a stunted word baseform of composite phones by (a) replacing each fenemic phone in the fenemic phone word baseform by the composite phone corresponding thereto; and (b) merging together at least one pair of adjacent composite phones by a single composite phone where the adverse effect of the merging is below a predefined threshold.

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

Primary / Asst. Examiners: Harkcom, Gary V.; Lynt, Christopher H.

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

Family: Show 2 known family members

First Claim:
Show all 24 claims
We claim:     1. In a system that (i) generates in an acoustic processor a string of fenemes in response to speech input, (ii) defines each word in a vocabulary by a respective fenemic baseform comprising a sequence of Markov model fenemic phones each of which relate to a feneme generatable by the acoustic processor, and (iii) defines an alphabet of composite Markov model phonetic phones each of which relates to a phonetic element and each of which correlates to at least one fenemic phone, a method of selecting Markov model phones for inclusion in a stunted baseform constructed of a sequence of phonetic phones, the method comprising the steps of:
  • (a) generating a respective string of fenemes in response to an utterance of a selected word;
  • (b) selecting the fenemic baseform having the highest probability of producing the string of fenemes and aligning the selected fenemic baseform against the generated string of fenemes;
  • (c) replacing each fenemic phone in the fenemic baseform by a composite phone corresponding thereto, thereby forming a composite phone baseform;
  • (d) selecting a pair of adjacent composite phones in the composite phone baseform;
  • (e) determining a substring of fenemes aligned against the selected pair of adjacent phones;
  • (f) computing, for each composite phone in the composite phone alphabet, a respective probability of producing the determined substring of fenemes;
  • (g) selecting the composite phone having the highest probability of having produced the determined substring;
  • (h) repeating steps (d) through (g) for each pair of adjacent phones in the composite phone baseform; and
  • (j) replacing at least one pair of adjacent composite phones by the selected composite phone corresponding thereto.

Background / Summary: Show background / summary

Drawing Descriptions: Show drawing descriptions

Description: Show description

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

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

Patent  Pub.Date  Inventor Assignee   Title
Get PDF - 28pp US4412098  1983-10 An  Interstate Electronics Corporation Audio signal recognition computer
Get PDF - 27pp US4481593  1984-11 Bahler  Exxon Corporation Continuous speech recognition
Get PDF - 25pp US4555796  1985-11 Sakoe  Nippon Electric Co., Ltd. DP Matching system for recognizing a string of words connected according to a regular grammar
Get PDF - 20pp US4587670  1986-05 Levinson et al.  AT&T Bell Laboratories Hidden Markov model speech recognition arrangement
Get PDF - 79pp US4718094  1988-01 Bahl et al.  International Business Machines Corp. Speech recognition system
Foreign References: None

Other Abstract Info: DERABS G88-205710

Other References:
  • W. Mendenhall "Introduction to Probability and Statistics", 5th Edition, Duxbury Press, Massachusetts, 1979, pp. 294-297.
  • F. Jelinek "Continuous Speech Recognition by Statistical Methods", Proceedings of the IEEE, vol. 64, No. 4, Apr. 1976.
  • L. R. Bahl, F. Jelinek and R. L. Mercer "Faster Acoustic Match Computation", IBM Technical Disclosure Bulletin, vol. 23, pp. 1718-1719, Sep. 1980.
  • L. R. Bahl, F. Jelinek and R. L. Mercer "A Maximum Likelihood Approach to Continuous Speech Recognition", Reprinted from IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-5, No. 2, Mar. 1983.
  • "Composite Fenemic Phones", Research Disclosure, No. 265, Aug. 1985, p. 418, Emsworth, Hampshire, GB, disclosed anonymously.

  • 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