Modelling (sub)string-length based constraints through a grammatical inference method
暂无分享,去创建一个
[1] Stephen Y. Itoga. A New Heuristic for Inferring Regular Grammars , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] R. Moore,et al. Explicit modelling of state occupancy in hidden Markov models for automatic speech recognition , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.
[3] Marc Richetin,et al. Efficient regular grammatical inference for pattern recognition , 1984, Pattern Recognit..
[4] King-Sun Fu,et al. Syntactic Pattern Recognition And Applications , 1968 .
[5] Laurent Miclet. Regular Inference with a Tail-Clustering Method , 1980, IEEE Transactions on Systems, Man, and Cybernetics.
[6] Jr. G. Forney,et al. The viterbi algorithm , 1973 .
[7] Jerome A. Feldman,et al. Some Decidability Results on Grammatical Inference and Complexity , 1972, Inf. Control..
[8] C. Chirathamjaree,et al. A method for the inference of non-recursive context-free grammars , 1980 .
[9] Teuvo Kohonen,et al. Median strings , 1985, Pattern Recognit. Lett..
[10] Francisco Casacuberta,et al. A general fuzzy-parsing scheme for speech recognition , 1987 .
[11] Biing-Hwang Juang,et al. Recent developments in the application of hidden Markov models to speaker-independent isolated word recognition , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.