Cascaded Grammatical Relation-Driven Parsing Using Support Vector Machines
暂无分享,去创建一个
[1] Jae-Hoon Kim,et al. An Efficient Parsing of Korean Sentences Using Restricted Phrase Structure Grammar , 1997 .
[2] Shlomo Argamon,et al. A Memory-Based Approach to Learning Shallow Natural Language Patterns , 1998, ACL.
[3] Thorsten Joachims,et al. Text Categorization with Support Vector Machines: Learning with Many Relevant Features , 1998, ECML.
[4] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.
[5] Morton Kanefsky. Detection of weak signals with polarity coincidence arrays , 1966, IEEE Trans. Inf. Theory.
[6] Songwook Lee. A Statistical Model for Identifying Grammatical Relations in Korean Sentences , 2004, IEICE Trans. Inf. Syst..
[7] Ted Briscoe,et al. High Precision Extraction of Grammatical Relations , 2001, COLING.
[8] Jungyun Seo,et al. Grammatical Relations Identification of Korean Parsed Texts Using Support Vector Machines , 2004, TSD.
[9] Wojciech Skut,et al. Tagging Grammatical Functions , 1997, EMNLP.
[10] Eugene Charniak,et al. Assigning Function Tags to Parsed Text , 2000, ANLP.
[11] Jungyun Seo,et al. Analysis of the grammatical functions between adnoun and noun phrases in Korean using Support Vector Machines , 2003, Nat. Lang. Eng..
[12] Vladimir N. Vapnik,et al. The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.