DEPENDENCIES ON THE OTHER SIDE OF THE CURTAIN
暂无分享,去创建一个
[1] David G. Hays,et al. The use of machines in the construction of a grammar and computer program for structural analysis , 1959, IFIP Congress.
[2] William Frawley,et al. Elements of mathematical linguistics , 1983 .
[3] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.
[4] Jane J. Robinson. Dependency Structures and Transformational Rules , 1970 .
[5] Jacqueline Vauzeilles,et al. Tree Adjoining Grammars in a Fragment of the Lambek Calculus , 1999, Comput. Linguistics.
[6] Alexandre Ja. Dikovsky,et al. On Three Types of Unambiguity of Context-Free Languages , 1977, ICALP.
[7] James W. Thatcher,et al. Generalized Sequential Machine Maps , 1970, J. Comput. Syst. Sci..
[8] Aravind K. Joshi,et al. Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..
[9] S. Leśniewski. Grundzüge eines neuen Systems der Grundlagen der Mathematik , 1929 .
[10] Lucien Tesnière. Éléments de syntaxe structurale , 1959 .
[11] C. Retoré. Calcul de Lambek et logique linéaire , 1996 .
[12] Larisa S. Modina. On Some Formal Grammars Generating Dependency Trees , 1975, MFCS.
[13] I. Mel. Meaning-Text Models: A Recent Trend in Soviet Linguistics , 1981 .
[14] Peter Neuhaus,et al. The Complexity of Recognition of Linguistically Adequate Dependency Grammars , 1997, ACL.
[15] Igor Mel’čuk,et al. Surface syntax of English , 1986 .
[16] G. A. Miller. THE PSYCHOLOGICAL REVIEW THE MAGICAL NUMBER SEVEN, PLUS OR MINUS TWO: SOME LIMITS ON OUR CAPACITY FOR PROCESSING INFORMATION 1 , 1956 .
[17] Asa Kasher,et al. MEASURES OF SYNTACTIC COMPLEXITY , 1963 .
[18] Y. Bar-Hillel. A Quasi-Arithmetical Notation for Syntactic Description , 1953 .