使用堆栈- lstm的基于转换的DRS解析

Proceedings of the IWCS Shared Task on Semantic Parsing Pub Date : 2019-05-01 DOI:10.18653/v1/W19-1202

Kilian Evang

{"title":"使用堆栈- lstm的基于转换的DRS解析","authors":"Kilian Evang","doi":"10.18653/v1/W19-1202","DOIUrl":null,"url":null,"abstract":"We present our submission to the IWCS 2019 shared task on semantic parsing, a transition-based parser that uses explicit word-meaning pairings, but no explicit representation of syntax. Parsing decisions are made based on vector representations of parser states, encoded via stack-LSTMs (Ballesteros et al., 2017), as well as some heuristic rules. Our system reaches 70.88% f-score in the competition.","PeriodicalId":173384,"journal":{"name":"Proceedings of the IWCS Shared Task on Semantic Parsing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Transition-based DRS Parsing Using Stack-LSTMs\",\"authors\":\"Kilian Evang\",\"doi\":\"10.18653/v1/W19-1202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present our submission to the IWCS 2019 shared task on semantic parsing, a transition-based parser that uses explicit word-meaning pairings, but no explicit representation of syntax. Parsing decisions are made based on vector representations of parser states, encoded via stack-LSTMs (Ballesteros et al., 2017), as well as some heuristic rules. Our system reaches 70.88% f-score in the competition.\",\"PeriodicalId\":173384,\"journal\":{\"name\":\"Proceedings of the IWCS Shared Task on Semantic Parsing\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the IWCS Shared Task on Semantic Parsing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18653/v1/W19-1202\",\"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 IWCS Shared Task on Semantic Parsing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/W19-1202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 18

摘要

我们向IWCS 2019提交了关于语义解析的共享任务，这是一个基于转换的解析器，使用显式的词义配对，但没有显式的语法表示。解析决策是基于解析器状态的向量表示，通过堆栈lstm (Ballesteros et al.， 2017)以及一些启发式规则进行编码。我们的系统在比赛中达到70.88%的f分。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Transition-based DRS Parsing Using Stack-LSTMs

We present our submission to the IWCS 2019 shared task on semantic parsing, a transition-based parser that uses explicit word-meaning pairings, but no explicit representation of syntax. Parsing decisions are made based on vector representations of parser states, encoded via stack-LSTMs (Ballesteros et al., 2017), as well as some heuristic rules. Our system reaches 70.88% f-score in the competition.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the IWCS Shared Task on Semantic Parsing

自引率

0.00%

发文量