论文信息 - Inference for Transition Network Grammars - 字舞流文

Inference for Transition Network Grammars

This paper gives a brief introduction to transition networks and proposes an approach to the inference of transition network grammars.

King-Sun Fu | S. M. Chou | K. Fu

[1] Su May Chou. Transition networks for pattern recognition. , 1975 .

[2] Ray J. Solomonoff,et al. A new method for discovering the grammars of phrase structure languages , 1959, IFIP Congress.

[3] S. Reder,et al. Grammatical complexity and inference , 1969 .

[4] Taylor L. Booth,et al. Grammatical Inference: Introduction and Survey - Part I , 1975, IEEE Trans. Syst. Man Cybern..

[5] Stefano Crespi-Reghizzi,et al. The use of grammatical inference for designing programming languages , 1973, Commun. ACM.

[6] William A. Woods,et al. Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .

[7] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[8] King-Sun Fu,et al. Syntactic Methods in Pattern Recognition , 1974, IEEE Transactions on Systems, Man, and Cybernetics.

[9] Jerome A. Feldman,et al. ON THE SYNTHESIS OF FINITE-STATE ACCEPTORS , 1970 .

[10] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[11] Daniel G. Bobrow,et al. An Augmented State Transition Network Analysis Procedure , 1969, IJCAI.

[12] Janusz A. Brzozowski,et al. Derivatives of Regular Expressions , 1964, JACM.

[13] Stefano Crespi-Reghizzi,et al. Reduction of Enumeration in Grammar Acquisition , 1971, International Joint Conference on Artificial Intelligence.