.png){kind=icon}
返回
Ordered Tree Decomposition for HRG Rule Extraction
.png){kind=icon}
OA
AI
DOI：10.1162/coli_a_00350.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present algorithms for extracting Hyperedge Replacement Grammar (HRG) rules from a graph along with a vertex order. Our algorithms are based on finding a tree decomposition of smallest width, relative to the vertex order, and then extracting one rule for each node in this structure. The assumption of a fixed order for the vertices of the input graph makes it possible to solve the problem in polynomial time, in contrast to the fact that the problem of finding optimal tree decompositions for a graph is NP-hard. We also present polynomial-time algorithms for parsing based on our HRGs, where the input is a vertex sequence and the output is a graph structure. The intended application of our algorithms is grammar extraction and parsing for semantic representation of natural language. We apply our algorithms to data annotated with Abstract Meaning Representations and report on the characteristics of the resulting grammars.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.3
论文数:
837
被引数:
2.7K
机构
引用论文
.png){kind=icon}
Poor results after resection for Haglund's heel: Analysis of 35 heels in 23 patients after 3 yearsOAAI
OAAI分享收藏SUSTAINED EFFICACY AND SAFETY 3 YEARS FOLLOWING INFUSION WITH ETRANACOGENE DEZAPARVOVEC IN ADULTS WITH SEVERE OR MODERATELY SEVERE HEMOPHILIA B IN THE PHASE 3 HOPE-B CLINICAL TRIAL在HOPE-B III期临床试验中，重度或中度重度B型血友病患者接受Etranacogene Dezaparvovec输注后3年的持续有效性和安全性
PREAI
分享收藏
查看更多内容