Is "My Favorite New Movie" My Favorite Movie? Probing the Understanding of Recursive Noun Phrases

被引:0
作者
Lyu, Qing [1 ]
Hua, Zheng [2 ]
Li, Daoxin [3 ]
Zhang, Li [1 ]
Apidianaki, Marianna [1 ]
Callison-Burch, Chris [1 ]
机构
[1] Univ Penn, Dept Comp & Informat Sci, 200 S 33Rd St, Philadelphia, PA 19104 USA
[2] Peking Univ, Key Lab Computat Linguist MOE, Beijing, Peoples R China
[3] Univ Penn, Dept Linguist, Philadelphia, PA 19104 USA
来源
NAACL 2022: THE 2022 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES | 2022年
关键词
ACQUISITION;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recursive noun phrases (NPs) have interesting semantic properties. For example, my favorite new movie is not necessarily my favorite movie, whereas my new favorite movie is. This is common sense to humans, yet it is unknown whether language models have such knowledge. We introduce the Recursive Noun Phrase Challenge (RNPC), a dataset of three textual inference tasks involving textual entailment and event plausibility comparison, precisely targeting the understanding of recursive NPs. When evaluated on RNPC, state-of-the-art Transformer models only perform around chance. Still, we show that such knowledge is learnable with appropriate data. We further probe the models for relevant linguistic features that can be learned from our tasks, including modifier semantic category and modifier scope. Finally, models trained on RNPC achieve strong zero-shot performance on an extrinsic Harm Detection evaluation task, showing the usefulness of the understanding of recursive NPs in downstream applications.(1)
引用
收藏
页码:5286 / 5302
页数:17
相关论文
共 49 条
  • [1] Abdullah N, 2005, LECT NOTES COMPUT SC, V3501, P330
  • [2] Apidianaki Marianna., 2021, P 4 BLACKBOXNLP WORK, P79, DOI [DOI 10.18653/V1/2021.BLACKBOXNLP-1.7, 10.18653/v1/2021.blackboxnlp-1.7]
  • [3] Banko M, 2020, Proceedings of the fourth workshop on online abuse and harms, P125, DOI [DOI 10.18653/V1/2020.ALW-1.16, 10.18653/v1/2020.alw-1.16]
  • [4] Baroni Marco, 2010, P 2010 C EMPIRICAL M, P1183
  • [5] Belinkov Yonatan, 2020, P 58 ANN M ASS COMPU, P1, DOI 10.18653/v1/2020.acl-tutorials.1
  • [6] Boleda Gemma, 2012, Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, P1223
  • [7] Boleda Gemma., 2013, P 10 INT C COMPUTATI, P35
  • [8] Bouillon Pierrette, 1999, P DESCRIPTION ADJECT, P20
  • [9] Bowman Samuel R., 2015, P 2015 C EMPIRICAL M, V334, P632, DOI DOI 10.18653/V1/D15
  • [10] Brown Tom B., 2020, ADV NEURAL INFORM PR