{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:57:38Z","timestamp":1725771458619},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_38","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T08:52:25Z","timestamp":1391590345000},"page":"466-477","source":"Crossref","is-referenced-by-count":0,"title":["Top-Down Tree Edit-Distance of Regular Tree Languages"],"prefix":"10.1007","author":[{"given":"Sang-Ki","family":"Ko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Bunke, H.: Edit distance of regular languages. In: Proceedings of the 5th Annual Symposium on Document Analysis and Information Retrieval, pp. 113\u2013124 (1996)"},{"key":"38_CR2","unstructured":"Chawathe, S.S.: Comparing hierarchical data in external memory. In: Proceedings of the 25th International Conference on Very Large Data Bases, pp. 90\u2013101 (1999)"},{"issue":"1","key":"38_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0304-3975(01)00238-9","volume":"286","author":"C. Choffrut","year":"2002","unstructured":"Choffrut, C., Pighizzini, G.: Distances between languages and reflexivity of relations. Theoretical Compututer Science\u00a0286(1), 117\u2013138 (2002)","journal-title":"Theoretical Compututer Science"},{"key":"38_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata\n                    \n                    \n                   (release October 12, 2007)"},{"issue":"1","key":"38_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1644015.1644017","volume":"6","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. ACM Transactions on Algorithms 6(1), 2:1\u20132:19 (2009)","journal-title":"ACM Transactions on Algorithms"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, Vol. 3: Beyond Words, pp. 1\u201368. Springer-Verlag New York, Inc. (1997)","DOI":"10.1007\/978-3-642-59126-6_1"},{"issue":"2","key":"38_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"26","author":"R.W. Hamming","year":"1950","unstructured":"Hamming, R.W.: Error Detecting and Error Correcting Codes. Bell System Technical Journal\u00a026(2), 147\u2013160 (1950)","journal-title":"Bell System Technical Journal"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-31653-1_9","volume-title":"Developments in Language Theory","author":"Y.-S. Han","year":"2012","unstructured":"Han, Y.-S., Ko, S.-K., Salomaa, K.: Computing the edit-distance between a regular language and a context-free language. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol.\u00a07410, pp. 85\u201396. Springer, Heidelberg (2012)"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-642-39274-0_14","volume-title":"CIAA 2013","author":"Y.-S. Han","year":"2013","unstructured":"Han, Y.-S., Ko, S.-K., Salomaa, K.: Approximate matching between a context-free grammar and a finite-state automaton. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol.\u00a07982, pp. 146\u2013157. Springer, Heidelberg (2013)"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Klein, P.N.: Computing the edit-distance between unrooted ordered trees. In: Proceedings of the 6th Annual European Symposium on Algorithms, pp. 91\u2013102 (1998)","DOI":"10.1007\/3-540-68530-8_8"},{"issue":"8","key":"38_CR11","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady\u00a010(8), 707\u2013710 (1966)","journal-title":"Soviet Physics Doklady"},{"issue":"6","key":"38_CR12","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1142\/S0129054103002114","volume":"14","author":"M. Mohri","year":"2003","unstructured":"Mohri, M.: Edit-distance of weighted automata: General definitions and algorithms. International Journal of Foundations of Computer Science\u00a014(6), 957\u2013982 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0020-0190(95)00007-Y","volume":"54","author":"G. Myers","year":"1995","unstructured":"Myers, G.: Approximately matching context-free languages. Information Processing Letters\u00a054, 85\u201392 (1995)","journal-title":"Information Processing Letters"},{"key":"38_CR14","unstructured":"Nierman, A., Jagadish, H.V.: Evaluating structural similarity in XML documents. In: Proceedings of the 5th International Workshop on the Web and Databases, pp. 61\u201366 (2002)"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Reis, D.C., Golgher, P.B., Silva, A.S., Laender, A.F.: Automatic web news extraction using tree edit distance. In: Proceedings of the 13th International Conference on World Wide Web, pp. 502\u2013511 (2004)","DOI":"10.1145\/988672.988740"},{"issue":"6","key":"38_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"S. Selkow","year":"1977","unstructured":"Selkow, S.: The tree-to-tree editing problem. Information Processing Letters\u00a06(6), 184\u2013186 (1977)","journal-title":"Information Processing Letters"},{"issue":"3","key":"38_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K.C. Tai","year":"1979","unstructured":"Tai, K.C.: The tree-to-tree correction problem. Journal of the ACM\u00a026(3), 422\u2013433 (1979)","journal-title":"Journal of the ACM"},{"issue":"3","key":"38_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cosrev.2009.03.001","volume":"3","author":"J. Tekli","year":"2009","unstructured":"Tekli, J., Chbeir, R., Yetongnon, K.: Survey: An overview on XML similarity: Background, current trends and future directions. Computer Science Review\u00a03(3), 151\u2013173 (2009)","journal-title":"Computer Science Review"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/360980.360995","volume":"17","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A.: Order-n correction for regular languages. Communications of the ACM\u00a017, 265\u2013268 (1974)","journal-title":"Communications of the ACM"},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM\u00a021, 168\u2013173 (1974)","journal-title":"Journal of the ACM"},{"key":"38_CR21","unstructured":"Winkler, W.E.: String comparator metrics and enhanced decision rules in the fellegi-sunter model of record linkage. In: Proceedings of the Section on Survey Research, pp. 354\u2013359 (1990)"},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"Yang, R., Kalnis, P., Tung, A.K.H.: Similarity evaluation on tree-structured data. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 754\u2013765 (2005)","DOI":"10.1145\/1066157.1066243"},{"issue":"6","key":"38_CR23","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing\u00a018(6), 1245\u20131262 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR24","unstructured":"Zhang, Z., Cao, R.L.S., Zhu, Y.: Similarity metric for XML documents. In: Proceedings of Workshop on Knowledge and Experience Management (2003)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04921-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T01:54:32Z","timestamp":1558835672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}