Abstract
Methods for mining graph sequences have recently attracted considerable interest from researchers in the data-mining field. A graph sequence is one of the data structures that represent changing networks. The objective of graph sequence mining is to enumerate common changing patterns appearing more frequently than a given threshold from graph sequences. Syntactic dependency analysis has been recognized as a basic process in natural language processing. In a transition-based parser for dependency analysis, a transition sequence can be represented by a graph sequence where each graph, vertex, and edge respectively correspond to a state, word, and dependency. In this paper, we propose a method for mining rules for rewriting states reaching incorrect final states to states reaching the correct final state, and propose a dependency parser that uses rewriting rules. The proposed parser is comparable to conventional dependency parsers in terms of computational complexity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
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)
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)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
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)
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)
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)
Kubler, S., et al.: Dependency Parsing. Morgan and Claypool Publishers (2009)
Kudo, T., Matsumoto, Y.: Japanese Dependency Analysis using Cascaded Chunking. In: Proc. of Conf. on Comp. Natural Language Learning (CoNLL), pp. 63–69 (2002)
Makinen, E.: On the Subtree Isomorphism Problem for Ordered Trees. Information Processing Letters 32(5), 271–273 (1989)
Nivre, J.: Algorithms for Deterministic Incremental Dependency Parsing. Comp. Linguistics 34(4), 513–553 (2008)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inokuchi, A. et al. (2012). Mining Rules for Rewriting States in a Transition-Based Dependency Parser. In: Anthony, P., Ishizuka, M., Lukose, D. (eds) PRICAI 2012: Trends in Artificial Intelligence. PRICAI 2012. Lecture Notes in Computer Science(), vol 7458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32695-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-32695-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32694-3
Online ISBN: 978-3-642-32695-0
eBook Packages: Computer ScienceComputer Science (R0)