Mining rules for rewriting states in a transition-based dependency parser

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7458 LNAI, Issue , 2012, Pages 133-145

  Inokuchi, Akihiro ^a   Yamaoka, Ayumu ^a   Washio, Takashi ^a   Matsumoto, Yuji ^b   Asahara, Masayuki ^c   Iwatate, Masakazu ^d   Kazawa, Hideto ^e  

^a OSAKA UNIVERSITY   (Japan)

^b NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^c NATIONAL INSTITUTE FOR JAPANESE LANGUAGE AND LINGUISTICS   (Japan)

^d HDE Inc   (Japan)

^e Google Inc   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY ANALYSIS; DEPENDENCY PARSER; FINAL STATE; GRAPH SEQUENCES; NATURAL LANGUAGE PROCESSING; REWRITING RULES; TRANSITION SEQUENCES;

DATA STRUCTURES; NATURAL LANGUAGE PROCESSING SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 84867664761     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32695-0_14     Document Type: Conference Paper

References (16)

1. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proc. of Int'l Conf. on Very Large Data Bases (VLDB), pp. 487-499 (1994)
2. Ahmed, R., Karypis, G.: Algorithms for Mining the Evolution of Conserved Relational States in Dynamic Networks. In: Proc. of IEEE Int'l Conf. on Data Mining (ICDM) (2011)
3. Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining Graph Evolution Rules. In: Buntine, W., Grobelnik, M., Mladenić, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009. LNCS, vol. 5781, pp. 115-130. Springer, Heidelberg (2009)
4. Borgwardt, K.M., et al.: Pattern Mining in Frequent Dynamic Subgraphs. In: Proc. of IEEE Int'l Conf. on Data Mining (ICDM), pp. 818-822 (2006)
5. Culotta, A., Sorensen, J.: Dependency Tree Kernels for Relation Extraction. In: Proc. of Annual Meeting of Association for Comp. Linguistics (ACL), pp. 423-429 (2004)
6. Ding, Y., Palmer, M.: Automatic Learning of Parallel Dependency Treelet Pairs. In: Su, K.-Y., Tsujii, J., Lee, J.-H., Kwong, O.Y. (eds.) IJCNLP 2004. LNCS (LNAI), vol. 3248, pp. 233-243. Springer, Heidelberg (2005)
7. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
8. Huang, L., Sagae, K.: Dynamic Programming for Linear-Time Incremental Parsing. In: Proc. of Annual Meeting of the Association for Computational Linguistics (ACL), pp. 1077-1086 (2010)
9. Inokuchi, A., Washio, T.: A Fast Method to Mine Frequent Subsequences from Graph Sequence Data. In: Proc. of IEEE Int'l Conf. on Data Mining (ICDM), pp. 303-312 (2008)
10. Iwatate, M., et al.: Japanese Dependency Parsing Using a Tournament Model. In: Proc. of Int'l Conf. on Comp. Linguistics (COLING), pp. 361-368 (2008)
11. Kubler, S., et al.: Dependency Parsing. Morgan and Claypool Publishers (2009)
12. Kudo, T., Matsumoto, Y.: Japanese Dependency Analysis using Cascaded Chunking. In: Proc. of Conf. on Comp. Natural Language Learning (CoNLL), pp. 63-69 (2002)
13. Makinen, E.: On the Subtree Isomorphism Problem for Ordered Trees. Information Processing Letters 32(5), 271-273 (1989)
14. Nivre, J.: Algorithms for Deterministic Incremental Dependency Parsing. Comp. Linguistics 34(4), 513-553 (2008)
15. Pei, J., et al.: PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth. In: Proc. of Int'l Conf. on Data Engineering (ICDE), pp. 2-6 (2001)
16. Zhang, Y., Clark, S.: A Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing. In: Proc. of Conf. on Empirical Methods in Natural Language Processing (EMNLP), pp. 562-571 (2008)