Pith. sign in

REVIEW 1 cited by

A Survey on Explainability in Machine Reading Comprehension

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 2010.00389 v1 pith:6L75IV5J submitted 2020-10-01 cs.CL cs.AI

Mokanarangan Thayaparan , Marco Valentino , André Freitas This is my paper · ORCID
classification cs.CLcs.AI
keywords challengescomprehensionexplainabilitymachinereadingadditionapproachesassess
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper presents a systematic review of benchmarks and approaches for explainability in Machine Reading Comprehension (MRC). We present how the representation and inference challenges evolved and the steps which were taken to tackle these challenges. We also present the evaluation methodologies to assess the performance of explainable systems. In addition, we identify persisting open research questions and highlight critical directions for future work.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations

    cs.CL 2025-05 conditional novelty 5.0 of 10

    The proposed Faithful-Refiner, combining syntactic parsing, quantifier and consistency checks, logical-relation guidance, and detailed proof feedback, raises explanation refinement rates on three NLI benchmarks by lar...

Pith tools