通过折叠从树到图的转换

IF 0.8 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 2023-10-21 DOI:10.1016/j.ic.2023.105111

Martin Berglund , Henrik Björklund , Johanna Björklund , Adrien Boiret

{"title":"通过折叠从树到图的转换","authors":"Martin Berglund , Henrik Björklund , Johanna Björklund , Adrien Boiret","doi":"10.1016/j.ic.2023.105111","DOIUrl":null,"url":null,"abstract":"<div><p>We introduce a fold operation that realises a tree-to-graph transduction by merging selected nodes in the input tree to form a possibly cyclic output graph. The work is motivated by the increasing use of graph-based representations in semantic parsing. We show that a suitable class of graphs languages can be generated by applying the fold operation to regular unranked tree languages. We investigate two versions of the fold operation, one that preserves a depth-first ordering between the edges, and one that does not. Finally, we demonstrate that the time complexity for the associated non-uniform membership problem is solvable in polynomial time for the order-preserving version, and NP-complete for the order-cancelling one.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"295 ","pages":"Article 105111"},"PeriodicalIF":0.8000,"publicationDate":"2023-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0890540123001141/pdfft?md5=167ecdf3a6847b5285a2c38d7cd109b1&pid=1-s2.0-S0890540123001141-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Transduction from trees to graphs through folding\",\"authors\":\"Martin Berglund , Henrik Björklund , Johanna Björklund , Adrien Boiret\",\"doi\":\"10.1016/j.ic.2023.105111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We introduce a fold operation that realises a tree-to-graph transduction by merging selected nodes in the input tree to form a possibly cyclic output graph. The work is motivated by the increasing use of graph-based representations in semantic parsing. We show that a suitable class of graphs languages can be generated by applying the fold operation to regular unranked tree languages. We investigate two versions of the fold operation, one that preserves a depth-first ordering between the edges, and one that does not. Finally, we demonstrate that the time complexity for the associated non-uniform membership problem is solvable in polynomial time for the order-preserving version, and NP-complete for the order-cancelling one.</p></div>\",\"PeriodicalId\":54985,\"journal\":{\"name\":\"Information and Computation\",\"volume\":\"295 \",\"pages\":\"Article 105111\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2023-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0890540123001141/pdfft?md5=167ecdf3a6847b5285a2c38d7cd109b1&pid=1-s2.0-S0890540123001141-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information and Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0890540123001141\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0890540123001141","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

我们引入了一个折叠操作，通过合并输入树中的选定节点来形成一个可能循环的输出图，从而实现树到图的转换。这项工作的动机是在语义分析中越来越多地使用基于图的表示。我们证明了将折叠操作应用于规则的无排序树语言可以生成合适的一类图语言。我们研究了两种版本的折叠操作，一种保留了边之间的深度优先顺序，另一种没有。最后，我们证明了相关的非一致隶属度问题的时间复杂度在多项式时间内是可解的，对于保阶版本，时间复杂度是np完全的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Transduction from trees to graphs through folding

We introduce a fold operation that realises a tree-to-graph transduction by merging selected nodes in the input tree to form a possibly cyclic output graph. The work is motivated by the increasing use of graph-based representations in semantic parsing. We show that a suitable class of graphs languages can be generated by applying the fold operation to regular unranked tree languages. We investigate two versions of the fold operation, one that preserves a depth-first ordering between the edges, and one that does not. Finally, we demonstrate that the time complexity for the associated non-uniform membership problem is solvable in polynomial time for the order-preserving version, and NP-complete for the order-cancelling one.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Information and Computation 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking