Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 12, Issue 9, 1990, Pages 920-925

  Garcia, Pedro ^a   Vidal, Enrique ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Learning; locally testable languages; regular grammar inference; syntactic pattern recognition

Indexed keywords

AUTOMATA THEORY--FINITE AUTOMATA; PATTERN RECOGNITION;

INDUCTIVE INFERENCE; K-TESTABLE LANGUAGES; SYNTACTIC PATTERN RECOGNITION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0025484018     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.57687     Document Type: Article

References (37)

1. N. Abramson, Information Theory and Coding. New York: McGraw-Hill, 1966.
2. A. V. Aho, J. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
3. D. Angluin, “On the complexity of minimum inference of regular sets,” Inform. Contr., vol. 39, pp. 337–350, 1978.
4. ——, “Inductive inference of formal languages from positive data,” Inform. Contr., vol. 45, pp. 117–135, 1980.
5. ——, “Inference of reversible languages,” J. Ass. Comput. Mach., vol. 29, no. 3, pp. 741–765, 1982.
6. D. Angluin and C. H. Smith, “Inductive inference: Theory and methods,” Comput. Surveys, vol. 15, no. 3, pp. 237–269, 1983.
7. L. R. Bahl, F. Jelinek, and L. R. Mercer, “A maximum likelihood approach to continuous speech recognition,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-5, pp. 179–190, Mar. 1983.
8. A. W. Biermann and J. A. Feldman, “On the synthesis of finite-state machines from samples of their behavior,” IEEE Trans. Comput., vol. C-21, pp. 592–597, 1972.
9. A. M. Derouault and B. Merialdo, “Natural language modeling for phoneme to text transcription,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-8, pp. 742–749, 1986.
10. K. S. Fu and T. L. Booth, “Grammatical inference: Introduction and survey, Parts 1 and 2,” IEEE Trans. Syst., Man, Cybern, vol. SMC-5, pp. 95–111, 409–423, 1975.
11. K. S. Fu, Syntactic Pattern Recognition and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
12. P. Garcia, E. Vidal, and F. Casacuberta, “Local languages, The successor method, and a step towards a general methodology for the inference of regular grammars,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-9, pp. 841–845, Nov. 1987.
13. P. Garcia, “Explorabilidad local en inferencia inductiva de lenguajes regulares y aplicaciones,” Doctoral dissertation, Departamento de Sistemas Informatícos y Computacion, Universidad Politecnica de Valencia, Valencia, Spain, 1988.
14. E. M. Gold, “Language identification in the limit,” Inform. Contr., vol. 10, pp. 447–474, 1967.
15. ——, “Complexity of automaton identification from given data,” Inform. Contr., vol. 37, pp. 302–320, 1978.
16. R. C. Gonzalez and M. G. Thomason, Syntactic Pattern Recognition, An Introduction. Reading, MA: Addison-Wesley, 1978.
17. S. Y. Itoga, “A new heuristic for inferring regular grammars,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, pp. 191–197, Mar. 1981.
18. O. Venta, “A very fast sentence reconstruction method for the postprocessing of computer-recognized continuous speech,” in Proc. IEEE ICPR ’84, 1984, pp. 1240–1243.
19. M. Kudo and M. Shimbo, “Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships,” Pattern Recognition, vol. 21, no. 4, pp. 401–409, 1988.
20. B. Levine, “Derivatives of tree Sets with applications to grammatical inference,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-3, May 1981.
21. R. McNaughton, “Algebraic decision procedures for local testability,” Math. Syst. Theory, vol. 8, no. 1, pp. 60–76, 1974.
22. L. Miclet, “Regular inference with a tail-clustering method,” IEEE Trans. Syst., Man, Cybern. vol. SMC-10, pp. 737–747, 1980.
23. J.L. Peterson, Computer Programs for Spelling Correction. New York: Springer-Verlag, 1980.
24. V. Radhakrishnan and G.Nagaraja, “Inference of regular grammars via skeletons,” IEEE Trans. Syst., Man, Cybern., vol. SMC-17, no. 6, 1987.
25. ——, “Inference of even linear grammars and its application to picture description languages,” Pattern Recognition, vol. 21, no. 1, pp. 55–62, 1988.
26. M. Richetin and F. Vernadat, “Efficient regular grammatical inference for pattern recognition,” Pattern Recognition, vol. 17, no. 2, pp. 245–250, 1984.
27. H. Rulot and E. Vidal, “Modelling (sub)string-length-based constraints through a grammatical inference method,” in Pattern Recognition Theory and Applications, P. A. Devijver and J. Kittler, Eds. New York: Springer-Verlag, 1987, pp. 451–459.
28. A. Salomaa, Jewels of Formal Language Theory. Rockville, MD: Computer Science Press, 1981.
29. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 390–397, 1948.
30. ——, “Prediction and entropy of printed English,” Bell Syst. Tech. J., vol. 30, no. 1, pp. 50–64, 1951.
31. A. R. Smith, J. N. Denemberg, T. B. Slack, C. C. Tan, and R. E. Wohlford, “Application of a sequential pattern learning system to connected speech recognition,” in Proc. IEEE ICASSP ’85, 1985, pp. 31.2.1–31.2.4.
32. O. Venta and T. Kohonen, “A non-stochastic method for the correction of sentences,” in Proc. IEEE ICPR ’86, 1986, pp. 1214–1217.
33. F. Vernadat and M. Richetin, “Regular inference for syntactic pattern recognition: A case study,” in Proc. IEEE ICPR ’84, 1984, 1370–1372.
34. E. Vidal, F. Casacuberta, E. Sanchis, and J. M. Benedi, “A general fuzzy parsing scheme for speech recognition,” in NATO-ASI New Systems and Architectures for Automatic Speech Recognition and Synthesis, R. De Mori and C. Y. Suen, Eds. New York: Springer-Verlag, 1985, pp. 427–446.
35. Y. Zalcstein, “Locally testable languages,” J. Comput. Syst. Sci., vol. 6, pp. 151–167, 1972.
36. F. J. Maryanski and T. L. Booth, “Inference of finite state probabilistic grammars,” IEEE Trans. Comput., vol. C-26, pp. 531–536, 1977.
37. R. Chaudhuri and A. N. V. Rao, “Approximating grammar probabilities: Solution of a conjecture,” J. Ass. Comput. Mach., vol. 33, no. 4, pp. 702–705, 1986.