Span-Based LCFRS-2 Parsing

M. Stanojevic, Mark Steedman
{"title":"Span-Based LCFRS-2 Parsing","authors":"M. Stanojevic, Mark Steedman","doi":"10.18653/v1/2020.iwpt-1.12","DOIUrl":null,"url":null,"abstract":"The earliest models for discontinuous constituency parsers used mildly context-sensitive grammars, but the fashion has changed in recent years to grammar-less transition-based parsers that use strong neural probabilistic models to greedily predict transitions. We argue that grammar-based approaches still have something to contribute on top of what is offered by transition-based parsers. Concretely, by using a grammar formalism to restrict the space of possible trees we can use dynamic programming parsing algorithms for exact search for the most probable tree. Previous chart-based parsers for discontinuous formalisms used probabilistically weak generative models. We instead use a span-based discriminative neural model that preserves the dynamic programming properties of the chart parsers. Our parser does not use an explicit grammar, but it does use explicit grammar formalism constraints: we generate only trees that are within the LCFRS-2 formalism. These properties allow us to construct a new parsing algorithm that runs in lower worst-case time complexity of O(l nˆ4 +nˆ6), where n is the sentence length and l is the number of unique non-terminal labels. This parser is efficient in practice, provides best results among chart-based parsers, and is competitive with the best transition based parsers. We also show that the main bottleneck for further improvement in performance is in the restriction of fan-out to degree 2. We show that well-nestedness is helpful in speeding up parsing, but lowers accuracy.","PeriodicalId":315529,"journal":{"name":"International Workshop/Conference on Parsing Technologies","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop/Conference on Parsing Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/2020.iwpt-1.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

The earliest models for discontinuous constituency parsers used mildly context-sensitive grammars, but the fashion has changed in recent years to grammar-less transition-based parsers that use strong neural probabilistic models to greedily predict transitions. We argue that grammar-based approaches still have something to contribute on top of what is offered by transition-based parsers. Concretely, by using a grammar formalism to restrict the space of possible trees we can use dynamic programming parsing algorithms for exact search for the most probable tree. Previous chart-based parsers for discontinuous formalisms used probabilistically weak generative models. We instead use a span-based discriminative neural model that preserves the dynamic programming properties of the chart parsers. Our parser does not use an explicit grammar, but it does use explicit grammar formalism constraints: we generate only trees that are within the LCFRS-2 formalism. These properties allow us to construct a new parsing algorithm that runs in lower worst-case time complexity of O(l nˆ4 +nˆ6), where n is the sentence length and l is the number of unique non-terminal labels. This parser is efficient in practice, provides best results among chart-based parsers, and is competitive with the best transition based parsers. We also show that the main bottleneck for further improvement in performance is in the restriction of fan-out to degree 2. We show that well-nestedness is helpful in speeding up parsing, but lowers accuracy.
基于跨的LCFRS-2解析
不连续选区解析器的最早模型使用轻度上下文敏感的语法,但近年来的流行趋势已经转变为使用强神经概率模型来贪婪地预测转换的无语法转换解析器。我们认为,基于语法的方法在基于转换的解析器所提供的功能之上仍然有一些贡献。具体地说,通过使用语法形式来限制可能树的空间,我们可以使用动态规划解析算法来精确搜索最可能树。以前基于图表的不连续形式解析器使用概率弱生成模型。相反,我们使用基于跨度的判别神经模型,它保留了图表解析器的动态规划属性。我们的解析器不使用显式语法,但它使用显式语法形式约束:我们只生成LCFRS-2形式中的树。这些属性使我们能够构建一个新的解析算法,该算法运行在较低的最坏情况时间复杂度为O(l n- 4 +n - 6),其中n是句子长度,l是唯一非终结标签的数量。这个解析器在实践中是高效的,在基于图表的解析器中提供了最好的结果,并且与基于转换的最佳解析器相竞争。我们还表明,进一步提高性能的主要瓶颈是将扇出限制在2度。我们证明了良好嵌套性有助于加快解析速度,但降低了准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书