The end-to-end performance of natural language processing systems for compound tasks, such as question answering and textual entailment, is often hampered by use of a greedy 1-best pipeline architecture, which causes errors to propagate and compound at each stage. We present a novel architecture, which models these pipelines as Bayesian networks, with each low level task corresponding to a variable in the network, and then we perform approximate inference to find the best labeling. Our approach is extremely simple to apply but gains the benefits of sampling the entire distribution over labels at each stage in the pipeline. We apply our method to two tasks -semantic role labeling and recognizing textual entailment -and achieve useful performance gains from the superior pipeline architecture.
Finkel et al. show that modeling a pipeline as a Bayesian network where each component is seen as a random variable and then performing approximate inference to determine the best output can outperform a greedy pipeline architecture where a best decision is made at each node REF .
Solving The Problem Of Cascading Errors: Approximate Bayesian Inference For Linguistic Annotation Pipelines
Conference On Empirical Methods In Natural Language Processing
Computer Science