Skip-chain Conditional Random Field for ranking meeting utterances by importance

Abstract

We describe a probabilistic approach to content selection or meeting summarization. We use skip-chain Conditional Random Fields (CRF) to model non-local pragmatic dependencies between paired utterances such as QUESTION-ANSWER that typically appear together in summaries, and show that these models outperform linear-chain CRFs and Bayesian models in the task. We also discuss different approaches for ranking all utterances in a sequence using CRFs. Our best performing system achieves 91.3% of human performance when evaluated with the Pyramid evaluation metric, which represents a 3.9% absolute increase compared to our most competitive non-sequential classifier. © 2006 Association for Computational Linguistics.