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

24th International Conference on Computational Linguistics - Proceedings of COLING 2012: Technical Papers

Volumn , Issue , 2012, Pages 1275-1290

  Inokuchi, Akihiro ^a   Yamaoka, Ayumu ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

Dependency parsing; Frequent pattern mining; Graph sequence

Indexed keywords

DEPENDENCY ANALYSIS; DEPENDENCY PARSER; DEPENDENCY PARSING; FEATURE TEMPLATE; FREQUENT PATTERN MINING; GRAPH SEQUENCES; NATURAL LANGUAGE PROCESSING; TRANSITION SEQUENCES;

DATA MINING; DATA STRUCTURES; NATURAL LANGUAGE PROCESSING SYSTEMS;

COMPUTATIONAL LINGUISTICS;

EID: 84876812442     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Agrawal, R., and Srikant, R. 1994. Fast Algorithms for Mining Association Rules in Large Databases. Proc. of Int'l Conf. on Very Large Data Bases (VLDB), 487-499.
2. Ahmed, R., and Karypis, G. 2011. Algorithms for Mining the Evolution of Conserved Relational States in Dynamic Networks. Proc. of IEEE Int'l Conf. on Data Mining (ICDM), 1-10.
3. Attardi, G. and Ciaramita, M. 2008. Tree Revision Learning for Dependency Parsing. Proc. of Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, (HLT-NAACL), 388-395.
4. Berlingerio, M., et al., 2009. Mining Graph Evolution Rules. Proc. of Euro. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD), 115-130.
5. Borgwardt, K. M., et al., 2006.Pattern Mining in Frequent Dynamic Subgraphs. Proc. of IEEE Int'l Conf. on Data Mining (ICDM), 818-822.
6. Collins, M., and Roark, B. 2004. Incremental parsing with the perceptron algorithm. Proc. of the 42nd Annual Meeting of the Association for Computational Linguistics(ACL), pp. 111-118.
7. Culotta, A., and Sorensen, J. 2004. Dependency Tree Kernels for Relation Extraction. Proc. of Annual Meeting of Association for Comp. Linguistics (ACL), 423-429.
8. Ding, Y., and Palmer, M. 2004. Automatic Learning of Parallel Dependency Treelet Pairs. Proc. of Int'l Joint Conf. on Natural Language Processing, 233-243.
9. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York.
10. Goldberg, Y. and Elhadad, M. 2010. An efficient algorithm for easy-first non-directional dependency parsing. Proc of Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics (HLT-NAACL), pp. 742-750.
11. Hayashi, K. et al., 2011. The third-order variational reranking on packed-shared dependency forests. Proc. of Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1479-1488.
12. Hayashi, K., et al., 2012. Head-driven Transition-based Parsing with Top-down Prediction. Proc. of the Annual Meeting of the Association for Computational Linguistics(ACL).
13. Huang, L., and Sagae, K. 2010. Dynamic Programming for Linear-Time Incremental Parsing. Proc. of Annual Meeting of the Association for Computational Linguistics (ACL), 1077-1086.
14. Inokuchi, A., and Washio, T. 2008. A Fast Method to Mine Frequent Subsequences from Graph Sequence Data. Proc. of IEEE Int'l Conf. on Data Mining (ICDM), 303-312.
15. Inokuchi, A., et al., 2012. Efficient Graph Sequence Mining Using Reverse Search. IEICE Transactions 95-D(7), 1947-1958.
16. Inokuchi, A., et al., 2012. Mining Rules for Rewriting States in a Transition-Based Dependency Parser. Proc of Pacific Rim International Conference on Artificial Intelligence (PRICAI), 133-145.
17. Iwatate, M., et al., 2008. Japanese Dependency Parsing Using a Tournament Model. Proc. of Int'l Conf. on Comp. Linguistics (COLING), 361-368.
18. Kitagawa, K. and Tanaka-Ishii, K. 2010. Tree-based deterministic dependency parsing - an application to Nivre's method. Proc. of Annual Meeting of the Association for Computational Linguistics (ACL), Short Papers, pp. 189-193.
19. Koo, T. and Collins, M. 2010. Efficient third-order dependency parsers. Proc. of Annual Meeting of the Association for Computational Linguistics (ACL), pp. 1-11.
20. Kubler, S., et al., 2009.Dependency Parsing. Morgan and Claypool Publishers.
21. Kudo, T., and Matsumoto, Y. 2002. Japanese Dependency Analysis using Cascaded Chunking. Proc. of Conf. on Comp. Natural Language Learning (CoNLL), 63-69.
22. Kudo, T. et al. 2005. Boosting-based Parse Reranking with Subtree Features. Proc. of Annual Meeting of the Association for Computational Linguistics (ACL).
23. Makinen, E. 1989. On the Subtree Isomorphism Problem for Ordered Trees. Information Processing Letters 32(5), 271-273.
24. McDonald, R. and Pereira, F. 2006. Online learning of approximate dependency parsing algorithms. Proc. of Conference of European Chapter of the Association for Computational Linguistics (EACL), pp. 81-88.
25. Nivre, J. 2008. Algorithms for Deterministic Incremental Dependency Parsing. Comp. Linguistics 34(4), 513-553.
26. Pei, J., et al., 2001. PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth. Proc. of Int'l Conf. on Data Engineering (ICDE), 2-6.
27. Yamada, H., and Matsumoto, M. 2003. Statistical dependency analysis with support vector machines. Proc. of the International Workshop on Parsing Technologies (IWPT), pp 195-206.
28. Zhang, Y., and Clark, S. 2008. A Tale of Two Parsers: Investigating and Combining Graphbased and Transition-based Dependency Parsing. Proc. of Conf. on Empirical Methods in Natural Language Processing (EMNLP), 562-571.
29. Zhang, Y. and Nivre, J. 2011. Transition-based dependency parsing with rich non-local features. Proc. of Annual Meeting of the Association for Computational Linguistics (ACL), pp. 188- 193.