In this paper, we propose using deep neural networks to extract important information from Vietnamese legal questions, a fundamental task towards building a question answering system in the legal domain. Given a legal question in natural language, the goal is to extract all the segments that contain the needed information to answer the question. We introduce a deep model that solves the task in three stages. First, our model leverages recent advanced autoencoding language models to produce contextual word embeddings, which are then combined with character-level and POS-tag information to form word representations. Next, bidirectional long short-term memory networks are employed to capture the relations among words and generate sentence-level representations. At the third stage, borrowing ideas from graph-based dependency parsing methods which provide a global view on the input sentence, we use biaffine classifiers to estimate the probability of each pair of start-end words to be an important segment. Experimental results on a public Vietnamese legal dataset show that our model outperforms the previous work by a large margin, achieving 94.79% in the F1 score. The results also prove the effectiveness of using contextual features extracted from pre-trained language models combined with other types of features such as character-level and POS-tag features when training on a limited dataset.
Improving Vietnamese Legal Question--Answering System based on Automatic Data Enrichment
VNU University of Engineering and Technology(越南国立大学工程技术大学);National Institute of Informatics(国立信息学研究所);Japan Advanced Institute of Science and Technology(日本北陆先端科学技术大学院大学)
VLQA: The First Comprehensive, Large, and High-Quality Vietnamese Dataset for Legal Question Answering
Japan Advanced Institute of Science and Technology(日本先进科学研究院);VNU University of Engineering and Technology(VNU工程大学);VNU University of Law(VNU法律大学);National Institute of Informatics(国立信息学研究所)
针对越南语法律 NLP 缺乏高质量标注语料的问题,本文构建并统计分析了全面的 VLQA 数据集,并基于法律信息检索与问答任务用 SOTA 模型评估其有效性。
VLSP 2023 -- LTER: A Summary of the Challenge on Legal Textual Entailment Recognition
Vietnam Judicial Academy(越南司法学院);Hanoi Law University(河内法律大学);Hung Yen University of Technology and Education(兴安工业大学);Ho Chi Minh City University of Science(胡志明市科学大学);Japan Advanced Institute of Science and Technology(日本先进科学技术学院);The Institute of Statistical Mathematics(统计数学研究所);National Institute of Informatics(情报学研究所)
ViHERMES: A Graph-Grounded Multihop Question Answering Benchmark and System for Vietnamese Healthcare Regulations
URA Research Group, Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology (HCMUT), VNU-HCM, Vietnam(URA研究组,计算机科学与工程学院,胡志明市技术大学(HCMUT),VNU-HCM,越南)
Optimizing Legal Document Retrieval in Vietnamese with Semi-Hard Negative Mining
Faculty of Computer Science, University of Information Technology, Ho Chi Minh City, Vietnam(信息科技学院计算机科学系,胡志明市,越南);Faculty of Information Science and Engineering, University of Information Technology, Ho Chi Minh City, Vietnam(信息科技学院信息科学与工程系,胡志明市,越南);Laboratory of Multimedia Communications, University of Information Technology, Ho Chi Minh City, Vietnam(信息科技学院多媒体通信实验室,胡志明市,越南);Vietnam National University, Ho Chi Minh City, Vietnam(越南国家大学,胡志明市,越南)
Attentive Deep Neural Networks for Legal Document Retrieval
Japan Advanced Institute of Science and Technology(日本北陆先端科学技术大学院大学);National Institute of Informatics(日本国立信息学研究所);Posts and Telecommunications Institute of Technology(邮电技术学院)
CABACE: Injecting Character Sequence Information and Domain Knowledge for Enhanced Acronym and Long-Form Extraction
Indian Institute of Technology Kharagpur(印度理工学院卡拉格普尔分校)
首字母缩略词和长形式在研究文件中很常见,在科学和法律领域的文件中更是如此。这些文档中使用的许多首字母缩略词都是特定于领域的,很少在普通文本语料库中找到。因此,基于transformer的NLP模型通常会检测首字母缩略词标记的OOV(Out of Vocabulary),特别是对于非英语语言,并且在提取过程中将首字母缩略词链接到其长形式时,其性能会受到影响。此外,像BERT这样的预训练的Transformer模型并不专门处理科学和法律文档。这些要点是这项工作背后的首要动机,我们提出了一个新的框架CABACE:字母缩写词提取的字符感知BERT,它考虑到文本中的字符序列,并适应于科学和法律领域的掩蔽语言建模。我们进一步使用具有增强的损失函数的目标,将最大损失和掩码损失项添加到用于训练CABACE的标准交叉熵损失。我们进一步利用伪标签和对抗性数据生成来提高框架的通用性。实验结果证明了所提出的框架相比,各种基线的优越性。此外,我们表明,所提出的框架比基线模型更适合zero-shot推广到非英语语言,从而加强了我们的方法的有效性。我们的团队BacKGProp在SDU AAAI-22的首字母缩略词提取(AE)共享任务的全球排行榜上获得了法语数据集的最高分,丹麦语和越南语的第二高分,以及英语法律数据集的第三高分。