Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. De Mori: “Computer Models of Speech using Fuzzy Algorithms”, Plenum Press, New York, 1981.
J. Feldman: “Some decidability results on grammatical inference and complexity”. Information and Control, Vol.20, pp. 244–262, 1972.
G.D. Forney: “The Viterbi algorithm”. IEEE Proc. 3, pp. 268–278. 1973.
K.S. Fu: “Syntactic Pattern Recognition and Applications”. Ed. Prentice-Hall. 1982.
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.
E.B. Hunt: “Artificial Intelligence”. Academic Press, New York. 1975.
S.Y. Itoga: “A New Heuristic for Inferring Regular Grammars”. IEEE-Trans, on Pattern Analysis ana Machine Intelligence, Vol. PAMI-3, N.2, 1981.
F. Jelinek: “Continous Speech Recognition by Statistical Methods”. Proc. IEEE; Vol. 64, N.4, pp. 532–556, 1976.
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.
L. Miclet: “Regular Inference with a Tail-Clustering Method”.IEEE Trans, on Syst. Man and Cybernetics, SMC-10, pp. 737–747, 1980.
M. Richetin, F. Vernadad: “Efficient Regular Grammatical Inference for Pattern Recognition”. Patt. Recognition, Vol. 17, N.2, pp.245–250, 1984.
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.
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.
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.
F. Vernadat, M. Richetin: “Regular Inference for syntactic pattern recognition: a case study”. IEEE-ICPR, pp. 1370–1372, 1984.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rulot, H., Vidal, E. (1988). An Efficient Algorithm for the Inference of Circuit-Free Automata. In: Ferraté, G., Pavlidis, T., Sanfeliu, A., Bunke, H. (eds) Syntactic and Structural Pattern Recognition. NATO ASI Series, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83462-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-83462-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83464-6
Online ISBN: 978-3-642-83462-2
eBook Packages: Springer Book Archive