The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A skip-chain conditional random field for ranking meeting utterances by importance
Open accessAbstract
We describe a probabilistic approach to content selection for meeting summarization. We use skipchain 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743 · cited 3×
“State sequence Markov models such as hidden Markov models (Rabiner, 1989) have been highly successful in many speech and natural language processing applications, including summarization.”
BackgroundMethodSCHEGLOFF, E. A., & SACKS, H. (1973) · Semiotica · doi:10.1515/semi.1973.8.4.289 · Cited by 4,589
Evaluating Content Selection in Summarization: The Pyramid Method
Nenkova, A., & Passonneau, R. (2004) · Columbia University · doi:10.7916/d80r9xvd · Cited by 527
Cited by
A Survey of Text Summarization Techniques
Nenkova, A., & McKeown, K. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_3 · Cited by 590
Nenkova, A. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601984715 · Cited by 429
Position-Aware Tagging for Aspect Sentiment Triplet Extraction
Xu, L., Li, H., Lu, W., & Bing, L. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.183 · Cited by 273
Identifying scientific artefacts in biomedical literature: The Evidence Based Medicine use case.
Hassanzadeh, H., Groza, T., & Hunter, J. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.02.006 · Cited by 62
Metadata
- Authors
- Galley, M.
- Venue
- Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing - EMNLP '06
- Published
- 2006
- Pages
- 364
- OpenAlex
- W2017187090
- Cited by
- 168
- References
- 3
- FWCI
- 8.16
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A skip-chain conditional random field for ranking meeting utterances by importance. https://app.cochat.ai/papers/10.3115/1610075.1610126
- The paper
- Galley, M. (2006). A skip-chain conditional random field for ranking meeting utterances by importance. Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing - EMNLP '06. https://doi.org/10.3115/1610075.1610126
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.