Error Mining on Dependency Trees - Archive ouverte HAL
Communication Dans Un Congrès Année : 2012

Error Mining on Dependency Trees

Résumé

In recent years, error mining approaches were developed to help identify the most likely sources of parsing failures in parsing systems using handcrafted grammars and lexicons. However the techniques they use to enumerate and count n-grams builds on the sequential nature of a text corpus and do not easily extend to structured data. In this paper, we propose an algorithm for mining trees and apply it to detect the most likely sources of generation failure. We show that this tree mining algorithm permits identifying not only errors in the generation system (grammar, lexicon) but also mismatches between the structures contained in the input and the input structures expected by our generator as well as a few idiosyncrasies/error in the input data.
Fichier principal
Vignette du fichier
acl12-errormining.pdf (97.9 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-00768204 , version 1

Citer

Claire Gardent, Shashi Narayan. Error Mining on Dependency Trees. 50th Annual Meeting of the Association for Computational Linguistics, Jul 2012, Jeju Island, South Korea. pp.592-600. ⟨hal-00768204⟩
142 Consultations
95 Téléchargements

Partager

More