paper-with-me

홈 › Papers

May I Check Again? — A simple but efficient way to generate and use contextual dictionaries for Named Entity Recognition. Application to French Legal Texts.

2019-09-01 · WS (NoDaLiDa) 2019 9 · Valentin Barriere, Amaury Fouret

In this paper we present a new method to learn a model robust to typos for a Named Entity Recognition task. Our improvement over existing methods helps the model to take into account the context of the sentence inside a justice decision in order to recognize an entity with a typo. We used state-of-the-art models and enriched the last layer of the neural network with high-level information linked with the potential of the word to be a certain type of entity. More precisely, we utilized the similarities between the word and the potential entity candidates the tagged sentence context. The experiments on a dataset of french justice decisions show a reduction of the relative F1-score error of 32%, upgrading the score obtained with the most competitive fine-tuned state-of-the-art system from 94.85% to 96.52%.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

named-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)Sentence

Similar Papers 제목 키워드 기반

May I Check Again? -- A simple but efficient way to generate and use contextual dictionaries for Named Entity Recognition. Application to French Legal Texts

2019-09-08 · Valentin Barriere, Amaury Fouret

In this paper we present a new method to learn a model robust to typos for a Named Entity Recognition task. Our improvement over existing methods helps the model to take into account the context of the sentence inside a …

named-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)Sentence

Parallel Spell-Checking Algorithm Based on Yahoo! N-Grams Dataset

2012-04-01 · Youssef Bassil

Spell-checking is the process of detecting and sometimes providing suggestions for incorrectly spelled words in a text. Basically, the larger the dictionary of a spell-checker is, the higher is the error detection rate; …

Articles

Claim Extraction for Fact-Checking: Data, Models, and Automated Metrics

2025-02-07 · Herbert Ullrich, Tomáš Mlynář, Jan Drchal

In this paper, we explore the problem of Claim Extraction using one-to-many text generation methods, comparing LLMs, small summarization models finetuned for the task, and a previous NER-centric baseline QACG. As the cur…

4kFact CheckingNERText Generation

Polarity Consistency Checking for Sentiment Dictionaries

2012-07-01 · ACL 2012 7 · Eduard Dragut, Hong Wang, Clement Yu, Prasad Sistla 외
Opinion MiningSentiment Analysis

Towards Principled Evaluations of Sparse Autoencoders for Interpretability and Control

2024-05-14 · Aleksandar Makelov, George Lange, Neel Nanda

Disentangling model activations into meaningful features is a central problem in interpretability. However, the absence of ground-truth for these features in realistic scenarios makes validating recent approaches, such a…

Dictionary Learning