An Efficient Algorithm for the Inference of Circuit-Free Automata

  • H. Rulot
  • E. Vidal
Part of the NATO ASI Series book series (volume 45)


In this paper, a recently introduced grammatical inference method is reviewed. In this method, a non left(right)-recursive regular grammar is built in an incremental way: as each training sample is presented, it is parsed by the current (error-correcting extended) grammar, minimizing explicitly, by dynamic programming, the number of error-rules needed. These error-rules are then added to the grammar. This procedure has proved to be well suited for capturing the relevant information associated with the lengths of the substructures of the patterns to be analized, and with their concatenation. A stochastic extension of the method is presented, and some alternative approaches for estimating the probabilities of both the error and non-error rules are discussed. Finally, the results of some experiments with speech samples, which show the capabilities of the proposed method, are summarized.


Automatic Speech Recognition Attribute Grammar Grammatical Inference Error Rule Regular Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. (DeMori, 8l).
    R. De Mori: “Computer Models of Speech using Fuzzy Algorithms”, Plenum Press, New York, 1981.Google Scholar
  2. (Feldman, 72).
    J. Feldman: “Some decidability results on grammatical inference and complexity”. Information and Control, Vol.20, pp. 244–262, 1972.MathSciNetMATHCrossRefGoogle Scholar
  3. (Forney, 73).
    G.D. Forney: “The Viterbi algorithm”. IEEE Proc. 3, pp. 268–278. 1973.MathSciNetCrossRefGoogle Scholar
  4. (Fu, 82).
    K.S. Fu: “Syntactic Pattern Recognition and Applications”. Ed. Prentice-Hall. 1982.Google Scholar
  5. (Fu, 83).
    K.S. Fu: “A Step Towards Unification on Syntactic and Statistical Pattern Recognition”. IEEE Trans. Pattern Analysis and Machine Intelligence. Vol.PAMI-5, N.2, pp.200–205. 1983.MATHGoogle Scholar
  6. (Hunt, 75).
    E.B. Hunt: “Artificial Intelligence”. Academic Press, New York. 1975.MATHGoogle Scholar
  7. (Itoga, 8l).
    S.Y. Itoga: “A New Heuristic for Inferring Regular Grammars”. IEEE-Trans, on Pattern Analysis ana Machine Intelligence, Vol. PAMI-3, N.2, 1981.Google Scholar
  8. (Jelinek, 76).
    F. Jelinek: “Continous Speech Recognition by Statistical Methods”. Proc. IEEE; Vol. 64, N.4, pp. 532–556, 1976.CrossRefGoogle Scholar
  9. (Juang, 85).
    B.H.Juang, L.R. Rabiner, S.E. Levinson, M.M. Sondhi: “Recent developments in the application of Hidden Markov Models to Speaker-Independent Isolated Word Recognition”. IEEE-ICASSP; pp. 9–12, 1985.Google Scholar
  10. (Miclet, 80).
    L. Miclet: “Regular Inference with a Tail-Clustering Method”.IEEE Trans, on Syst. Man and Cybernetics, SMC-10, pp. 737–747, 1980.MathSciNetCrossRefGoogle Scholar
  11. (Richetin, 84).
    M. Richetin, F. Vernadad: “Efficient Regular Grammatical Inference for Pattern Recognition”. Patt. Recognition, Vol. 17, N.2, pp.245–250, 1984.MATHCrossRefGoogle Scholar
  12. (Rulot, 86).
    H.Rulot, E.Vidal: “Modelling (sub)string-length-based constraints through a Grammatical Inference method”. NATO-ASI on Pattern Recognition and applications. Spa (Belgium). June, 1986.Google Scholar
  13. (Rusell, 85).
    M.J.Rusell, R.K.Moore: “Explicit modelling of state occupancy in Hidden Markov Models for automatic speech recognition”. IEEE-ICASSP, pp. 5–8, 1985.Google Scholar
  14. (Thomason, 86).
    M.G. Thomason, E. Granum, R.E. Blake: “Experiments in dynamic programming inference of Markov networks with strings representing speech data”. Pattern Recognition, Vol.19, N.5, pp. 343–352, 1986.CrossRefGoogle Scholar
  15. (Vernadat, 84).
    F. Vernadat, M. Richetin: “Regular Inference for syntactic pattern recognition: a case study”. IEEE-ICPR, pp. 1370–1372, 1984.Google Scholar
  16. (Vidal, 85).
    E.Vidal, F.Casacuberta, E.Sanchís, J.Benedí: “A General Fuzzy-Parsing Scheme for Speech Recognition”. NATO-ASI New Systems and Architectures for Automatic Speech Recognition and Synthesis. R.DeMori, C.Y.Suen (eds.). Springer-Verlag. pp. 427–446, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • H. Rulot
    • 1
  • E. Vidal
    • 2
  1. 1.Centro de Informatica Dr. Moliner s/nBurjasot, ValenciaSpain
  2. 2.Facultad de Informatica Dept. Sistemas y ComputacionValenciaSpain

Personalised recommendations