Papers by Wenjuan Han
Towards Holistic and Automatic Evaluation of Open-Domain Dialogue Generation (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods of open-domain dialogue evaluation are labor-intensive and inefficient. |
| Approach: | They propose to use open-domain dialogues to evaluate different aspects of dialogues using holistic evaluation metrics. |
| Outcome: | The proposed metrics show strong correlations with human judgments. |
CollabKG: A Learnable Human-Machine-Cooperative Information Extraction Toolkit for (Event) Knowledge Graph Construction (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing IE tools lack multi-task support and automatic updates for KG and EKG construction. |
| Approach: | They propose a human-machine-cooperative IE toolkit for KG and EKG construction that unifies different IE subtasks and integrates LLMs as the assistant machine. |
| Outcome: | The proposed tool improves annotation quality, efficiency, and stability simultaneously. |
SHARP: Search-Based Adversarial Attack for Structured Prediction (2022.findings-naacl)
Copied to clipboard
| Challenge: | SHARP is a new attack method for structured prediction models that solves several challenges. |
| Approach: | They propose a black-box adversarial attack method that uses a search-based optimization problem to attack adversarials. |
| Outcome: | The proposed method performs more potent attack than pioneer arts on two structured prediction tasks. |
On the Robustness of Question Rewriting Systems to Questions of Varying Hardness (2022.acl-long)
Copied to clipboard
| Challenge: | entailment : absence of questions classified based on their rewriting hardness or difficulty . enactment of QR system to rewrite context-dependent questions in CQA requires context knowledge . |
| Approach: | They propose a heuristic method to automatically classify questions into subsets of varying hardness . they then conduct a human evaluation to annotate the rewriting hardness of questions . |
| Outcome: | The proposed learning framework improves the overall performance compared to baselines. |
Second-Order Unsupervised Neural Dependency Parsing (2020.coling-main)
Copied to clipboard
| Challenge: | supervised dependency parsers can reach a very high accuracy, but they require treebanks for training. |
| Approach: | They propose a second-order extension of unsupervised neural dependency models that incorporate grandparent-child or sibling information. |
| Outcome: | The proposed model achieves 10% improvement over the previous state-of-the-art model on the full WSJ dataset. |
Towards Understanding and Improving Knowledge Distillation for Neural Machine Translation (2023.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge distillation techniques for neural machine translation lack special treatment on the top-1 information, which is limiting the potential of KD. |
| Approach: | They propose a method to distill knowledge from top-1 predictions of teachers and a technique to infuse more additional knowledge by distilling on the data without ground-truth targets. |
| Outcome: | The proposed method outperforms the vanilla word-level KD and outperfies the existing methods on three different students with different capacity gaps. |
A Holistic Approach to Reference-Free Evaluation of Machine Translation (2023.acl-short)
Copied to clipboard
| Challenge: | Traditional machine translation evaluation relies on reference written by humans . reference-free evaluation gets rid of labor-intensive annotations, which can pivot easily to new domains . |
| Approach: | They propose a reference-free evaluation approach that characterizes evaluation as two aspects: fluency and faithfulness. |
| Outcome: | The proposed approach outperforms SOTA reference-fee metrics on machine translation datasets. |
PersLEARN: Research Training through the Lens of Perspective Cultivation (2023.acl-demo)
Copied to clipboard
Yu-Zhe Shi, Shiqian Li, Xinyi Niu, Qiao Xu, Jiawen Liu, Yifan Xu, Shiyu Gu, Bingru He, Xinyang Li, Xinyu Zhao, Zijian Zhao, Yidong Lyu, Zhen Li, Sijia Liu, Lin Qiu, Jinhao Ji, Lecheng Ruan, Yuxi Ma, Wenjuan Han, Yixin Zhu
| Challenge: | PersLEARN is a tool designed to facilitate the cultivation of scientific perspectives . junior researchers struggle to identify the perspectives reflected in the literature and struggle to develop their own viewpoints. |
| Approach: | They propose a tool to facilitate the cultivation of scientific perspectives by interacting with a prompt-based model and allowing students to develop their own perspectives explicitly. |
| Outcome: | The proposed tool outperforms baseline approaches across multiple domains of literature from different perspectives. |
A Quality-based Syntactic Template Retriever for Syntactically-Controlled Paraphrase Generation (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing syntactically-controlled paraphrase generation models perform well with human-annotated or well-chosen syntaktic templates. |
| Approach: | They propose a quality-based Syntactic Template Retriever to retrieve templates based on the quality of the to-be-generated paraphrases. |
| Outcome: | The proposed algorithm can generate high-quality paraphrases without sacrificing quality. |
Modeling Instance Interactions for Joint Information Extraction with Neural High-Order Conditional Random Field (2023.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to joint Information Extraction (IE) neglect cross-instance or cross-task dependencies. |
| Approach: | They propose a joint IE framework that formulates joint 'conditional random field' to model cross-instance interactions . they incorporate a high-order neural decoder that is unfolded from a mean-field variational inference method . |
| Outcome: | The proposed approach improves on three IE tasks compared with baseline and prior work. |
Multilingual Grammar Induction with Continuous Language Identification (D19-1)
Copied to clipboard
| Challenge: | Existing methods to induce grammars of multiple languages do not consider language similarity measures. |
| Approach: | They propose a universal grammar induction approach that captures similarity between languages . they use vector representations to capture similarity and softly tie grammar parameters . |
| Outcome: | The proposed approach performs well over monolingual and multilingual datasets. |
A Regularization-based Framework for Bilingual Grammar Induction (D19-1)
Copied to clipboard
| Challenge: | Existing multilingual grammar induction methods require external resources such as parallel corpora, word alignments or linguistic phylogenetic trees. |
| Approach: | They propose a framework in which the learning process of the grammar model of one language is influenced by knowledge from the model of another language. |
| Outcome: | The proposed method outperforms baselines on transfer grammar induction and bilingual grammar inducing on multiple languages. |
Spa: On the Sparsity of Virtual Adversarial Training for Dependency Parsing (2022.findings-aacl)
Copied to clipboard
| Challenge: | Virtual adversarial training (VAT) is a powerful approach to improving robustness and performance, leveraging both labeled and unlabeled data to compensate for the scarcity of labeles. |
| Approach: | They propose a Sparse Parse Adjustment algorithm which combines VAT and a graph-based dependency parsing model in an exact computational manner and enhances the dependency parsed with controllable and adjustable sparsity. |
| Outcome: | Empirical results show that the proposed algorithm outperforms other methods without sparsity regularization. |
ToHRE: A Top-Down Classification Strategy with Hierarchical Bag Representation for Distantly Supervised Relation Extraction (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods to find relational facts from texts lack hierarchical information of relations. |
| Approach: | They propose a hierarchical classification framework which extracts relation in a top-down manner. |
| Outcome: | The proposed method significantly outperforms state-of-the-art methods on NYT dataset . the proposed method generates large amounts of training data by aligning KBs with unlabeled corpora . |
A Law Reasoning Benchmark for LLM with Tree-Organized Structures including Factum Probandum, Evidence and Experiences (2025.findings-acl)
Copied to clipboard
Jiaxin Shen, Jinan Xu, Huiqi Hu, Luyi Lin, Guoyang Ma, Fei Zheng, Fandong Meng, Jie Zhou, Wenjuan Han
| Challenge: | a recent study focuses on generating impartial and interpretable judicial judgments based on established criminal fact. |
| Approach: | They propose a law reasoning schema enriched with hierarchical factum probandum, evidence, and implicit experience that enables public scrutiny and preventing bias. |
| Outcome: | The proposed schema enables public scrutiny and prevents bias in the "Intelligent Court" it employs a suite of legal analysis tools to address the challenge task. |
Unsupervised Natural Language Parsing (Introductory Tutorial) (2021.eacl-tutorials)
Copied to clipboard
| Challenge: | Unsupervised parsing learns a syntactic parser from training sentences without parse tree annotations. |
| Approach: | This tutorial will introduce what unsupervised parsing does and how it can be useful for and beyond syntactic parse. |
| Outcome: | This paper will provide an overview of major approaches to unsupervised parsing and analyze their strengths and weaknesses. |
Enhancing Unsupervised Generative Dependency Parser with Contextual Information (P19-1)
Copied to clipboard
| Challenge: | Existing approaches to unsupervised dependency parsing are based on probabilistic generative models that learn the joint distribution of the given sentence and its parse. |
| Approach: | They propose a probabilistic model that generates a sentence and its parse from a latent representation, which encodes global contextual information of the generated sentence. |
| Outcome: | The proposed model achieves competitive accuracy compared with state-of-the-art models. |
Robust Transfer Learning with Pretrained Language Models through Adapters (2021.acl-short)
Copied to clipboard
| Challenge: | Existing approaches to transfer learning with pretrained transformer-based language models are not robust and can be adversarial. |
| Approach: | They propose a simple yet effective adapter-based approach to fine-tune language models on downstream tasks. |
| Outcome: | The proposed approach improves stability and adversarial robustness in transfer learning to various downstream tasks. |
Adapting Unsupervised Syntactic Parsing Methodology for Discourse Dependency Parsing (2021.acl-long)
Copied to clipboard
| Challenge: | Discourse dependency parsing is a task that requires a large amount of training data, but there is little research on it. |
| Approach: | They propose to adapt unsupervised syntactic dependency parsing methods for unsupervised discourse dependency parses using unlabeled training data. |
| Outcome: | The proposed methods outperform existing methods in semi-supervised and supervised settings and outperformed existing methods. |
A Survey of Unsupervised Dependency Parsing (2020.coling-main)
Copied to clipboard
| Challenge: | Syntactic dependency parsing is an important task in natural language processing . unsupervised learning of dependency parses requires training sentences to be manually annotated with their correct parse trees. |
| Approach: | They propose to survey existing approaches to unsupervised dependency parsing . they identify two major classes of approaches and discuss recent trends . |
| Outcome: | The proposed methods can be used in semantic parsing, machine translation, relation extraction, and many other tasks. |
Adversarial Attack and Defense of Structured Prediction Models (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to building effective adversarial attackers focus on classification problems. |
| Approach: | They propose a framework that learns to attack a structured prediction model with feedbacks from multiple reference models. |
| Outcome: | The proposed framework is able to attack state-of-the-art models and boost them with training . it is based on a sequence-to-sequence model with feedbacks from multiple reference models . |