依存句法分析中非交叉图族的通有公理化
Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing
摘要：
我们提出了一个简单的编码未标记的非交叉图，并显示其潜在的对应物如何帮助我们代表几个家庭的有向和无向图中使用的语法和语义解析的自然语言作为上下文无关的语言。在潜在编码中，纯粹基于禁止模式来分离这些族，从而消除了在推理算法中区分非交叉图族的需要：当搜索空间可以在解析器输入中控制时，一个算法适用于所有族。
英文摘要：
We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages. The families are separated purely on the basis of forbidden patterns in latent encoding, eliminating the need to differentiate the families of non-crossing graphs in inference algorithms: one algorithm works for all when the search space can be controlled in parser input.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
