From Judgement's Premises Towards Key Points

• URL: http://arxiv.org/abs/2212.12238v1
• Date: Fri, 23 Dec 2022 10:20:58 GMT
• Title: From Judgement's Premises Towards Key Points
• Authors: Oren Sultan, Rayen Dhahri, Yauheni Mardan, Tobias Eder, Georg Groh
• Abstract summary: Key Point Analysis is a relatively new task in NLP that combines summarization and classification. We focus on the legal domain and develop methods that identify and extract KPs from premises derived from texts of judgments.
• Score: 1.648438955311779
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Key Point Analysis(KPA) is a relatively new task in NLP that combines summarization and classification by extracting argumentative key points (KPs) for a topic from a collection of texts and categorizing their closeness to the different arguments. In our work, we focus on the legal domain and develop methods that identify and extract KPs from premises derived from texts of judgments. The first method is an adaptation to an existing state-of-the-art method, and the two others are new methods that we developed from scratch. We present our methods and examples of their outputs, as well a comparison between them. The full evaluation of our results is done in the matching task -- match between the generated KPs to arguments (premises).

Related papers

• Adversarial Pruning: A Survey and Benchmark of Pruning Methods for Adversarial Robustness [16.623648447423438]
  Recent work has proposed neural network pruning techniques to reduce the size of a network while preserving robustness against adversarial examples. These methods involve complex and articulated designs, making it difficult to analyze the differences and establish a fair and accurate comparison. We propose a novel taxonomy to categorize them based on two main dimensions: the pipeline, defining when to prune; and the specifics, defining how to prune.
  arXiv  Detail & Related papers  (2024-09-02T13:34:01Z)
• Enhancing Argument Summarization: Prioritizing Exhaustiveness in Key Point Generation and Introducing an Automatic Coverage Evaluation Metric [3.0754290232284562]
  Key Point Analysis (KPA) task formulates argument summarization as representing the summary of a large collection of arguments. A sub-task of KPA, called Key Point Generation (KPG), focuses on generating these key points given the arguments. This paper introduces a novel extractive approach for key point generation, that outperforms previous state-of-the-art methods for the task.
  arXiv  Detail & Related papers  (2024-04-17T23:00:29Z)
• Exploring Key Point Analysis with Pairwise Generation and Graph Partitioning [61.73411954056032]
  Key Point Analysis (KPA) continues to be a significant and unresolved issue within the field of argument mining. We propose a novel approach for KPA with pairwise generation and graph partitioning.
  arXiv  Detail & Related papers  (2024-04-17T13:44:29Z)
• Semantic Similarity Matching for Patent Documents Using Ensemble BERT-related Model and Novel Text Processing Method [4.313626569907121]
  This paper introduces an ensemble approach that incorporates four BERT-related models, enhancing semantic similarity accuracy through weighted averaging. Secondly, a novel text preprocessing method tailored for patent documents is introduced, featuring a distinctive input structure with token scoring that aids capturing semantic relationships during CPC context training.
  arXiv  Detail & Related papers  (2024-01-06T02:35:49Z)
• Do You Hear The People Sing? Key Point Analysis via Iterative Clustering and Abstractive Summarisation [12.548947151123555]
  Argument summarisation is a promising but currently under-explored field. One of the main challenges in Key Point Analysis is finding high-quality key point candidates. evaluating key points is crucial in ensuring that the automatically generated summaries are useful.
  arXiv  Detail & Related papers  (2023-05-25T12:43:29Z)
• Comparing Methods for Extractive Summarization of Call Centre Dialogue [77.34726150561087]
  We experimentally compare several such methods by using them to produce summaries of calls, and evaluating these summaries objectively. We found that TopicSum and Lead-N outperform the other summarisation methods, whilst BERTSum received comparatively lower scores in both subjective and objective evaluations.
  arXiv  Detail & Related papers  (2022-09-06T13:16:02Z)
• Supporting Vision-Language Model Inference with Confounder-pruning Knowledge Prompt [71.77504700496004]
  Vision-language models are pre-trained by aligning image-text pairs in a common space to deal with open-set visual concepts. To boost the transferability of the pre-trained models, recent works adopt fixed or learnable prompts. However, how and what prompts can improve inference performance remains unclear.
  arXiv  Detail & Related papers  (2022-05-23T07:51:15Z)
• Distant finetuning with discourse relations for stance classification [55.131676584455306]
  We propose a new method to extract data with silver labels from raw text to finetune a model for stance classification. We also propose a 3-stage training framework where the noisy level in the data used for finetuning decreases over different stages. Our approach ranks 1st among 26 competing teams in the stance classification track of the NLPCC 2021 shared task Argumentative Text Understanding for AI Debater.
  arXiv  Detail & Related papers  (2022-04-27T04:24:35Z)
• Comprehensive Studies for Arbitrary-shape Scene Text Detection [78.50639779134944]
  We propose a unified framework for the bottom-up based scene text detection methods. Under the unified framework, we ensure the consistent settings for non-core modules. With the comprehensive investigations and elaborate analyses, it reveals the advantages and disadvantages of previous models.
  arXiv  Detail & Related papers  (2021-07-25T13:18:55Z)
• Weakly-Supervised Aspect-Based Sentiment Analysis via Joint Aspect-Sentiment Topic Embedding [71.2260967797055]
  We propose a weakly-supervised approach for aspect-based sentiment analysis. We learn sentiment, aspect> joint topic embeddings in the word embedding space. We then use neural models to generalize the word-level discriminative information.
  arXiv  Detail & Related papers  (2020-10-13T21:33:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.