{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:25:19Z","timestamp":1725701119181},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326943"},{"type":"electronic","value":"9783642326950"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32695-0_14","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T16:46:00Z","timestamp":1345913160000},"page":"133-145","source":"Crossref","is-referenced-by-count":0,"title":["Mining Rules for Rewriting States in a Transition-Based Dependency Parser"],"prefix":"10.1007","author":[{"given":"Akihiro","family":"Inokuchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayumu","family":"Yamaoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Washio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuji","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masayuki","family":"Asahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masakazu","family":"Iwatate","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideto","family":"Kazawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proc. of Int\u2019l Conf. on Very Large Data Bases (VLDB), pp. 487\u2013499 (1994)","key":"14_CR1"},{"doi-asserted-by":"crossref","unstructured":"Ahmed, R., Karypis, G.: Algorithms for Mining the Evolution of Conserved Relational States in Dynamic Networks. In: Proc. of IEEE Int\u2019l Conf. on Data Mining (ICDM) (2011)","key":"14_CR2","DOI":"10.1109\/ICDM.2011.20"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-04180-8_25","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M. Berlingerio","year":"2009","unstructured":"Berlingerio, M., Bonchi, F., Bringmann, B., Gionis, A.: Mining Graph Evolution Rules. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009. LNCS, vol.\u00a05781, pp. 115\u2013130. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Borgwardt, K.M., et al.: Pattern Mining in Frequent Dynamic Subgraphs. In: Proc. of IEEE Int\u2019l Conf. on Data Mining (ICDM), pp. 818\u2013822 (2006)","key":"14_CR4","DOI":"10.1109\/ICDM.2006.124"},{"doi-asserted-by":"crossref","unstructured":"Culotta, A., Sorensen, J.: Dependency Tree Kernels for Relation Extraction. In: Proc. of Annual Meeting of Association for Comp. Linguistics (ACL), pp. 423\u2013429 (2004)","key":"14_CR5","DOI":"10.3115\/1218955.1219009"},{"key":"14_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-30211-7_25","volume-title":"Natural Language Processing \u2013 IJCNLP 2004","author":"Y. Ding","year":"2005","unstructured":"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.\u00a03248, pp. 233\u2013243. Springer, Heidelberg (2005)"},{"key":"14_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.\u00a0H.\u00a0Freeman and Company, New York (1979)"},{"unstructured":"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\u20131086 (2010)","key":"14_CR8"},{"doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T.: A Fast Method to Mine Frequent Subsequences from Graph Sequence Data. In: Proc. of IEEE Int\u2019l Conf. on Data Mining (ICDM), pp. 303\u2013312 (2008)","key":"14_CR9","DOI":"10.1109\/ICDM.2008.106"},{"doi-asserted-by":"crossref","unstructured":"Iwatate, M., et al.: Japanese Dependency Parsing Using a Tournament Model. In: Proc. of Int\u2019l Conf. on Comp. Linguistics (COLING), pp. 361\u2013368 (2008)","key":"14_CR10","DOI":"10.3115\/1599081.1599127"},{"doi-asserted-by":"crossref","unstructured":"Kubler, S., et al.: Dependency Parsing. Morgan and Claypool Publishers (2009)","key":"14_CR11","DOI":"10.1007\/978-3-031-02131-2_2"},{"doi-asserted-by":"crossref","unstructured":"Kudo, T., Matsumoto, Y.: Japanese Dependency Analysis using Cascaded Chunking. In: Proc. of Conf. on Comp. Natural Language Learning (CoNLL), pp. 63\u201369 (2002)","key":"14_CR12","DOI":"10.3115\/1118853.1118869"},{"issue":"5","key":"14_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(89)90056-2","volume":"32","author":"E. Makinen","year":"1989","unstructured":"Makinen, E.: On the Subtree Isomorphism Problem for Ordered Trees. Information Processing Letters\u00a032(5), 271\u2013273 (1989)","journal-title":"Information Processing Letters"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1162\/coli.07-056-R1-07-027","volume":"34","author":"J. Nivre","year":"2008","unstructured":"Nivre, J.: Algorithms for Deterministic Incremental Dependency Parsing. Comp. Linguistics\u00a034(4), 513\u2013553 (2008)","journal-title":"Comp. Linguistics"},{"unstructured":"Pei, J., et al.: PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth. In: Proc. of Int\u2019l Conf. on Data Engineering (ICDE), pp. 2\u20136 (2001)","key":"14_CR15"},{"doi-asserted-by":"crossref","unstructured":"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\u2013571 (2008)","key":"14_CR16","DOI":"10.3115\/1613715.1613784"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2012: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32695-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T12:41:05Z","timestamp":1687696865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32695-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326943","9783642326950"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32695-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}