Papers by Yanru Qu
Event Time Extraction and Propagation via Graph Attention Networks (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing work on grounding events into a precise timeline has been limited due to the inherent ambiguity of language and the requirement for information propagation over inter-related events. |
| Approach: | They propose a 4-tuple temporal representation for entity slot filling to ground events into a timeline using a graph attention network approach. |
| Outcome: | The proposed approach yields 7.0% match rate over contextualized embedding approaches and 16.3% higher match rate compared to sentence-level manual event time argument annotation. |
Label-Aware Double Transfer Learning for Cross-Specialty Medical Named Entity Recognition (N18-1)
Copied to clipboard
Zhenghui Wang, Yanru Qu, Liheng Chen, Jian Shen, Weinan Zhang, Shaodian Zhang, Yimei Gao, Gen Gu, Ken Chen, Yong Yu
| Challenge: | NER is a fundamental problem for medical text mining because of the difference of specialties and cost of human annotation. |
| Approach: | They propose a label-aware double transfer learning framework for medical NER from electronic medical records. |
| Outcome: | The proposed framework improves accuracy over strong baselines on 12 cross-specialty NER tasks. |
Multi-document Summarization with Maximal Marginal Relevance-guided Reinforcement Learning (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies on single-document summarization (SDS) benefit from advances in neural sequence learning, but they produce unsatisfactory results on multi-document summary (MDS). |
| Approach: | They propose a neural sequence learning method that unifies advanced neural SDS methods and statistical measures used in classical MDS. |
| Outcome: | The proposed method achieves state-of-the-art performance on benchmark MDS datasets. |
Dynamically Fused Graph Network for Multi-hop Reasoning (P19-1)
Copied to clipboard
| Challenge: | Text-based question answering (TBQA) has been studied extensively in recent years. |
| Approach: | They propose a Dynamically Fused Graph Network to answer questions requiring multiple scattered evidence and reasoning over them. |
| Outcome: | The proposed method achieves competitive results on a public TBQA dataset and produces interpretable reasoning chains. |