Error Mining with Suspicion Trees: Seeing the Forest for the Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Error Mining with Suspicion Trees: Seeing the Forest for the Trees

Résumé

In recent years, error mining approaches have been proposed to identify the most likely sources of errors in symbolic parsers and generators. However the techniques used generate a flat list of suspicious forms ranked by decreasing order of suspicion. We introduce a novel algorithm that structures the output of error mining into a tree (called, suspicion tree) highlighting the relationships between suspicious forms. We illustrate the impact of our approach by applying it to detect and analyse the most likely sources of failure in surface realisation; and we show how the suspicion tree built by our algorithm helps presenting the errors identified by error mining in a linguistically meaningful way thus providing better support for error analysis. The right frontier of the tree highlights the relative importance of the main error cases while the subtrees of a node indicate how a given error case divides into smaller more specific cases
Fichier principal
Vignette du fichier
nargar_coling12_error_mining_final.pdf (146.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00768227 , version 1 (21-12-2012)

Identifiants

  • HAL Id : hal-00768227 , version 1

Citer

Shashi Narayan, Claire Gardent. Error Mining with Suspicion Trees: Seeing the Forest for the Trees. 24th International Conference on Computational Linguistics, Dec 2012, Mumbai, India. pp.60-73. ⟨hal-00768227⟩
415 Consultations
76 Téléchargements

Partager

Gmail Facebook X LinkedIn More