Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .
[2] Jan van Leeuwen,et al. A Generalisation of Parikh's Theorem in Formal Language Theory , 1974, ICALP.
[3] Lotfi A. Zadeh,et al. Note on fuzzy languages , 1969, Inf. Sci..
[4] Michael A. Arbib,et al. An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.
[5] Peter Robert Jan Asveld. Iterated Context-Independent Rewriting -- An Algebraic Approach to Families of Languages , 1978 .
[6] Peter R.J. Asveld,et al. A Fuzzy Approach to Erroneous Inputs in Context-Free Language Recognition , 1995, IWPT.
[7] Sheila A. Greibach. Full AFLs and Nested Iterated Substitution , 1970, Inf. Control..
[8] Giangiacomo Gerla,et al. Fuzzy grammars and recursively enumerable fuzzy languages , 1992, Inf. Sci..
[9] Moti Schneider,et al. The recognition of imperfect strings generated by fuzzy context sensitive grammars , 1994 .
[10] Peter R. J. Asveld,et al. An Algebraic Approach to Incomparable Families of Formal Languages , 1992 .
[11] Peter R. J. Asveld. An Alternative Formulation of Cocke-Younger-Kasami's Algorithm , 1994, Bull. EATCS.
[12] Moti Schneider,et al. The utilization of fuzzy sets in the recognition of imperfect strings , 1992 .
[13] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .