Skip to main content
SpringerLink
Log in

Automatic Determination Algorithm for the Optimum Number of States in NL-HMnet

  • Conference paper
  • First Online:
Discovery Science (DS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1967))

Included in the following conference series:

  • 356 Accesses

Abstract

Hidden Markov Network (HMnet)[1] is a kind of statisticalfinite-state automatons. Discrete-type HMnet and NL-HMnet[2] can be used as a language model in a speech recognition system. NL-HMnet has no self-loop transition. The proposed algorithms for constructing Discrete-type HMnet and NL-HMnet require the pre-defined total number of states in HMnet. The optimum number of states can be changed by various factors such as kind of task, number of training samples, and so on. It is desirable to automatically determine the optimum number of states for each condition.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Takami and S. Sagayama: A Successive State Splitting Algorithm for Efficient Allophone Modeling. Proc. ICASSP’92, Vol. I, pp. 573–576, 1992.

    Google Scholar 

  2. M. Suzuki and S. Makino: An Automatic Acquisition Method of Statistic Finite-State Automaton for Sentence. Proc. ICASSP’99, Vol. II, pp. 737–740, 1999.

    Google Scholar 

  3. F. Jelinek and R. L. Mercer, “Interpolated Estimation of Markov Source Parameters from Sparse Data”, Pattern Recognition in Practice, E. S. Gelsema and L. N. Kanal, North-Holland, pp. 381–397, 1980.

    Google Scholar 

  4. J. Rissanen: Universal Coding, Information, Prediction, and Estimation. IEEE Trans. IT, Vol. 30, No. 4, pp. 629–636, 1984.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Center / Graduate School of Information Sciences, Tohoku Univ, 980-8578, Japan

    Motoyuki Suzuki & Shozo Makino

Authors
  1. Motoyuki Suzuki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shozo Makino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Information Science and Electrical Engineering, Department of Informatics, Kyushu University, 6-10-1 Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Setsuo Arikawa

  2. Faculty of Science Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, 113-0033, Tokyo, Japan

    Shinichi Morishita

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suzuki, M., Makino, S. (2000). Automatic Determination Algorithm for the Optimum Number of States in NL-HMnet. In: Arikawa, S., Morishita, S. (eds) Discovery Science. DS 2000. Lecture Notes in Computer Science(), vol 1967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44418-1_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-44418-1_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41352-3

  • Online ISBN: 978-3-540-44418-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation