Pith. sign in

REVIEW 13 cited by

Introduction to the CoNLL-2003 Shared Task: Language-Independent Named Entity Recognition

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cs/0306050 v1 pith:BQL7ASMD submitted 2003-06-12 cs.CL

Erik F. Tjong Kim Sang , Fien De Meulder This is my paper · ORCID
classification cs.CL
keywords taskconll-2003entitylanguage-independentnamedrecognitionsharedbackground
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We describe the CoNLL-2003 shared task: language-independent named entity recognition. We give background information on the data sets (English and German) and the evaluation method, present a general overview of the systems that have taken part in the task and discuss their performance.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 13 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Soft Head Selection for Injecting ICL-Derived Task Embeddings

    cs.CL 2025-07 conditional novelty 7.0 of 10

    SITE applies soft gradient-based head selection to inject ICL-derived task embeddings, outperforming prior embedding adaptation and few-shot ICL across generation, reasoning, and NLU tasks on 12 LLMs from 4B to 70B pa...

  2. LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention

    cs.CV 2023-03 conditional novelty 7.0 of 10

    LLaMA-Adapter turns frozen LLaMA 7B into a capable instruction follower using only 1.2M new parameters and zero-init attention, matching Alpaca while extending to image-conditioned reasoning on ScienceQA and COCO.

  3. BCL: Bayesian In-Context Learning Framework for Information Extraction

    cs.CL 2026-06 unverdicted novelty 6.0 of 10

    BCL introduces a particle-filtering Bayesian update framework to systematically refine label representations in in-context learning for information extraction, claiming consistent gains over prior methods.

  4. A Tale of LLMs and Induced Small Proxies: Scalable Small Language Models for Knowledge Mining

    cs.AI 2025-10 conditional novelty 6.0 of 10

    LLM-written pipelines and LLM-generated labels are distilled into one small instruction-following model that performs classification and span extraction cheaply at corpus scale.

  5. Dissecting Bias in LLMs: A Mechanistic Interpretability Perspective

    cs.CL 2025-06 conditional novelty 6.0 of 10

    Bias in GPT-2 and Llama-2 is localized to a small set of edges, and ablation of those edges reduces bias while impairing unrelated NLP tasks.

  6. MPL: Multiple Programming Languages with Large Language Models for Information Extraction

    cs.CL 2025-05 conditional novelty 6.0 of 10

    Using multiple programming languages as code-style prompts during fine-tuning improves LLM information extraction accuracy over single-language prompting.

  7. LIMO: Less is More for Reasoning

    cs.CL 2025-02 unverdicted novelty 6.0 of 10

    LIMO achieves 63.3% on AIME24 and 95.6% on MATH500 via supervised fine-tuning on roughly 1% of the data used by prior models, supporting the claim that minimal strategic examples suffice when pre-training has already ...

  8. DICOM De-Identification via Hybrid AI and Rule-Based Framework for Scalable, Uncertainty-Aware Redaction

    stat.ML 2025-07 reject novelty 5.0 of 10

    A rule-based and AI hybrid with uncertainty-aware detection reports 99.88% de-identification pass rate on its own DICOM, HIPAA, and TCIA checks.

  9. DIRECT: Direct Decoding for Efficient and Aligned Sequence Labeling with Large Language Models

    cs.CL 2026-07 conditional novelty 4.0 of 10

    DPO after SFT plus constrained template-filling decoding improves LLM sequence-labeling accuracy and cuts inference time by reusing KV cache for non-label tokens.

  10. Extracting Structured Requirements from Unstructured Building Technical Specifications for Building Information Modeling

    cs.CL 2025-08 unverdicted novelty 4.0 of 10

    A study showing that CamemBERT and Fr_core_news_lg achieve over 90% F1 for named entity recognition and Random Forest achieves over 80% F1 for relation extraction on French building technical specifications.

  11. PRvL: Quantifying the Capabilities and Risks of Large Language Models for PII Redaction

    cs.CR 2025-08 conditional novelty 4.0 of 10

    Instruction-tuned open-source LLMs, especially DeepSeek-Q1, outperform fine-tuned, RAG, and NER baselines on PII redaction accuracy and leakage in this benchmark.

  12. The Science of Evaluating Foundation Models

    cs.CL 2025-02 conditional novelty 3.0 of 10

    A survey-and-checklist proposal that organizes LLM evaluation into an ABCD framework (Algorithm, Big Data, Computation, Domain Expertise) for context-aware, documented assessment.

  13. To Tune or Not To Tune? How About the Best of Both Worlds?

    cs.CL 2019-07 unverdicted novelty 3.0 of 10

    A sequential fine-tuning strategy for pre-trained language models reports modest accuracy gains of 4.7%, 0.99%, and 0.72% on semantic similarity, sequence labeling, and text classification tasks.

Pith tools