Extending Logic Explained Networks to Text Classification
Recently, Logic Explained Networks (LENs) have been proposed as explainable-by-design neural models providing logic explanations for their predictions. However, these models have only been applied to vision and tabular data, and they mostly favour the generation of global explanations, while local ones tend to be noisy and verbose. For these reasons, we propose LENp, improving local explanations by perturbing input words, and we test it on text classification. Our results show that (i) LENp provides better local explanations than LIME in terms of sensitivity and faithfulness, and (ii) logic explanations are more useful and user-friendly than feature scoring provided by LIME as attested by a human survey.
Code (2)
Tasks
ClassificationSensitivitytext-classificationText ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Modeling Hierarchical Syntactic Structures in Morphological Processing
Sentences are represented as hierarchical syntactic structures, which have been successfully modeled in sentence processing. In contrast, despite the theoretical agreement on hierarchical syntactic structures within word…
SentenceModelling the Diachronic Emergence of Phoneme Frequency Distributions
Phoneme frequency distributions exhibit robust statistical regularities across languages, including exponential-tailed rank-frequency patterns and a negative relationship between phonemic inventory size and the relative …
Text Complexity Classification Based on Linguistic Information: Application to Intelligent Tutoring of ESL
The goal of this work is to build a classifier that can identify text complexity within the context of teaching reading to English as a Second Language (ESL) learners. To present language learners with texts that are sui…
General ClassificationExtending Minimal Pairs with Ordinal Surprisal Curves and Entropy Across Applied Domains
The minimal pairs paradigm of comparing model probabilities for contrasting completions has proven useful for evaluating linguistic knowledge in language models, yet its application has largely been confined to binary gr…
Text GenerationPersistent topology of protein space
Protein fold classification is a classic problem in structural biology and bioinformatics. We approach this problem using persistent homology. In particular, we use alpha shape filtrations to compare a topological repres…