图语法高效解析的最新进展综述

F. Drewes
{"title":"图语法高效解析的最新进展综述","authors":"F. Drewes","doi":"10.18653/v1/W19-3102","DOIUrl":null,"url":null,"abstract":"Context-free graph grammars, in particular hyperedge replacement graph grammars, look back on over 30 years of history. They share many of the good properties of contextfree string languages. Unfortunately, the complexity of parsing is the big exception: early results in the field showed that even for fixed grammars, the membership problem can be NP-complete. Moreover, the known results about polynomial parsing that were obtained afterwards, while constituting nice theoretical work, seemed to be of limited practical value. This is because they were either based on very ”impractical” restrictions, or the degree of the polynomial running time depended on the grammar and could thus become large. In the current decade, the question received renewed interest because hyperedge replacement is one of the candidate formalisms for specifying semantic graphs in natural language processing. Using graph grammars in this area requires parsing algorithms that are not only polynomial in theory, but efficient in practice. Preferably, the degree of the polynomial bounding their running time should be a (small) constant independent of the grammar, or else it should depend on parameters not likely to be large. The talk will present an overview of results towards this goal, discussing their requirements, advantages, and disadvantages as well as a few possible directions for future work. Speaker’s homepage: https://www.umu.se/en/staff/frank-drewes/","PeriodicalId":246818,"journal":{"name":"Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Survey of Recent Advances in Efficient Parsing for Graph Grammars\",\"authors\":\"F. Drewes\",\"doi\":\"10.18653/v1/W19-3102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Context-free graph grammars, in particular hyperedge replacement graph grammars, look back on over 30 years of history. They share many of the good properties of contextfree string languages. Unfortunately, the complexity of parsing is the big exception: early results in the field showed that even for fixed grammars, the membership problem can be NP-complete. Moreover, the known results about polynomial parsing that were obtained afterwards, while constituting nice theoretical work, seemed to be of limited practical value. This is because they were either based on very ”impractical” restrictions, or the degree of the polynomial running time depended on the grammar and could thus become large. In the current decade, the question received renewed interest because hyperedge replacement is one of the candidate formalisms for specifying semantic graphs in natural language processing. Using graph grammars in this area requires parsing algorithms that are not only polynomial in theory, but efficient in practice. Preferably, the degree of the polynomial bounding their running time should be a (small) constant independent of the grammar, or else it should depend on parameters not likely to be large. The talk will present an overview of results towards this goal, discussing their requirements, advantages, and disadvantages as well as a few possible directions for future work. Speaker’s homepage: https://www.umu.se/en/staff/frank-drewes/\",\"PeriodicalId\":246818,\"journal\":{\"name\":\"Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18653/v1/W19-3102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/W19-3102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

上下文无关的图语法,特别是超边缘替换图语法,回顾了30多年的历史。它们共享上下文无关字符串语言的许多良好属性。不幸的是,解析的复杂性是一个很大的例外:该领域的早期结果表明,即使对于固定语法,成员问题也可能是np完全的。此外,后来得到的关于多项式解析的已知结果,虽然构成了很好的理论工作,但似乎没有多少实用价值。这是因为它们要么基于非常“不切实际”的限制,要么多项式运行时间的程度取决于语法,因此可能会变得很大。在最近十年中,这个问题重新引起了人们的兴趣,因为超级边缘替换是指定自然语言处理中语义图的候选形式之一。在这个领域使用图语法需要的解析算法不仅在理论上是多项式的,而且在实践中是高效的。最好,限定它们运行时间的多项式的程度应该是一个(小的)常数,与语法无关,否则它应该依赖于不大可能很大的参数。讲座将概述实现这一目标的结果,讨论它们的要求、优点和缺点,以及未来工作的一些可能方向。演讲者的主页:https://www.umu.se/en/staff/frank-drewes/
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Survey of Recent Advances in Efficient Parsing for Graph Grammars
Context-free graph grammars, in particular hyperedge replacement graph grammars, look back on over 30 years of history. They share many of the good properties of contextfree string languages. Unfortunately, the complexity of parsing is the big exception: early results in the field showed that even for fixed grammars, the membership problem can be NP-complete. Moreover, the known results about polynomial parsing that were obtained afterwards, while constituting nice theoretical work, seemed to be of limited practical value. This is because they were either based on very ”impractical” restrictions, or the degree of the polynomial running time depended on the grammar and could thus become large. In the current decade, the question received renewed interest because hyperedge replacement is one of the candidate formalisms for specifying semantic graphs in natural language processing. Using graph grammars in this area requires parsing algorithms that are not only polynomial in theory, but efficient in practice. Preferably, the degree of the polynomial bounding their running time should be a (small) constant independent of the grammar, or else it should depend on parameters not likely to be large. The talk will present an overview of results towards this goal, discussing their requirements, advantages, and disadvantages as well as a few possible directions for future work. Speaker’s homepage: https://www.umu.se/en/staff/frank-drewes/
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信