arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.09607cs.CLcs.AI
收藏

LAGr:用于语义解析中更好系统概括的标记对齐图

LAGr: Label Aligned Graphs for Better Systematic Generalization in Semantic Parsing

Dora Jambor, Dzmitry Bahdanau

摘要:

语义解析是为自然语言句子产生结构化意义表示的任务。最近的研究指出,常用的序列到序列(seq2seq)语义解析器很难系统地概括,即处理需要在新环境中重新组合已知知识的示例。在这项工作中,我们表明,更好的系统化的推广,可以通过生产的意义表示直接作为一个图,而不是作为一个序列。为此,我们提出LAGr(标签对齐图),一个通用的框架,通过独立预测节点和边缘标签的一个完整的多层输入对齐图产生语义解析。强监督LAGr算法需要对齐的图作为输入,而弱监督LAGr使用近似最大后验推理来推断最初未对齐的目标图的对齐。实验表明,LAGr在强监督和弱监督设置下,在基线seq2seq解析器上实现了系统泛化的显着改进。

英文摘要:

Semantic parsing is the task of producing structured meaning representations for natural language sentences. Recent research has pointed out that the commonly-used sequence-to-sequence (seq2seq) semantic parsers struggle to generalize systematically, i.e. to handle examples that require recombining known knowledge in novel settings. In this work, we show that better systematic generalization can be achieved by producing the meaning representation directly as a graph and not as a sequence. To this end we propose LAGr (Label Aligned Graphs), a general framework to produce semantic parses by independently predicting node and edge labels for a complete multi-layer input-aligned graph. The strongly-supervised LAGr algorithm requires aligned graphs as inputs, whereas weakly-supervised LAGr infers alignments for originally unaligned target graphs using approximate maximum-a-posteriori inference. Experiments demonstrate that LAGr achieves significant improvements in systematic generalization upon the baseline seq2seq parsers in both strongly- and weakly-supervised settings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑