Is the Stanford Dependency Representation Semantic?

EVENTS@ACL Pub Date : 2014-06-01 DOI:10.3115/v1/W14-2908
Rachel Rudinger, Benjamin Van Durme
{"title":"Is the Stanford Dependency Representation Semantic?","authors":"Rachel Rudinger, Benjamin Van Durme","doi":"10.3115/v1/W14-2908","DOIUrl":null,"url":null,"abstract":"The Stanford Dependencies are a deep syntactic representation that are widely used for semantic tasks, like Recognizing Textual Entailment. But do they capture all of the semantic information a meaning representation ought to convey? This paper explores this question by investigating the feasibility of mapping Stanford dependency parses to Hobbsian Logical Form, a practical, event-theoretic semantic representation, using only a set of deterministic rules. Although we find that such a mapping is possible in a large number of cases, we also find cases for which such a mapping seems to require information beyond what the Stanford Dependencies encode. These cases shed light on the kinds of semantic information that are and are not present in the Stanford Dependencies.","PeriodicalId":392223,"journal":{"name":"EVENTS@ACL","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EVENTS@ACL","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3115/v1/W14-2908","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

The Stanford Dependencies are a deep syntactic representation that are widely used for semantic tasks, like Recognizing Textual Entailment. But do they capture all of the semantic information a meaning representation ought to convey? This paper explores this question by investigating the feasibility of mapping Stanford dependency parses to Hobbsian Logical Form, a practical, event-theoretic semantic representation, using only a set of deterministic rules. Although we find that such a mapping is possible in a large number of cases, we also find cases for which such a mapping seems to require information beyond what the Stanford Dependencies encode. These cases shed light on the kinds of semantic information that are and are not present in the Stanford Dependencies.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
斯坦福依赖表示是语义的吗?
斯坦福依赖关系是一种深度句法表示,广泛用于语义任务,如识别文本蕴涵。但是它们能捕捉到意义表征应该传达的所有语义信息吗?本文通过研究仅使用一组确定性规则将斯坦福依赖解析映射到霍布斯逻辑形式(一种实用的事件理论语义表示)的可行性来探讨这个问题。尽管我们发现这样的映射在很多情况下是可能的,我们也发现这样的映射似乎需要超出斯坦福依赖编码的信息。这些案例阐明了斯坦福依赖关系中存在或不存在的语义信息的种类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Augmenting FrameNet Via PPDB Evaluation for Partial Event Coreference Inter-annotator Agreement for ERE annotation Challenges of Adding Causation to Richer Event Descriptions Unsupervised Techniques for Extracting and Clustering Complex Events in News
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1