--- title: "Uncertainty Detection as Approximate Max-Margin Sequence" description: "The paper describes a system for the CoNLL-2010 shared task on uncertainty detection. 86.0 F1. 1 reference, cited by 2 papers here." authors: ["Oscar Täckström", "Sumithra Velupillai", "Martin Hassel", "Gunnar Eriksson", "Hercules Dalianis", "Jussi Karlgren"] year: 2010 venue: "Proceedings of the Fourteenth Conference on Computational Natural Language Learning – Shared Task" source: "https://aclanthology.org/W10-3012/" licence: "CC BY-NC-SA 3.0 (ACL Anthology, before 2016)" licence_url: "https://creativecommons.org/licenses/by-nc-sa/3.0/" summary_licence: "Elamur Cosmic License" canonical: "https://research.elamur.ai/free/en/papers/tackstrom-2010-uncertainty-detection-as-approximate-max/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/tackstrom-2010-uncertainty-detection-as-approximate-max/) [home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2010](https://md.research.elamur.ai/free/en/papers/2010/page/2/) / Uncertainty Detection as Approximate Max-Margin Sequence Labelling # Uncertainty Detection as Approximate Max-Margin Sequence Labelling **Authors:** [Oscar Täckström](https://md.research.elamur.ai/free/en/authors/oscar-tackstrom/), Sumithra Velupillai, Martin Hassel, Gunnar Eriksson, [Hercules Dalianis](https://md.research.elamur.ai/free/en/authors/hercules-dalianis/) and Jussi Karlgren · **Year:** 2010 · **Venue:** [Proceedings of the Fourteenth Conference on Computational Natural Language Learning – Shared Task](https://md.research.elamur.ai/free/en/venues/conll/) ([CoNLL 2010](https://md.research.elamur.ai/free/en/venues/conll/2010/)) · **Publisher:** [Association for Computational Linguistics](https://md.research.elamur.ai/free/en/publishers/association-for-computational-linguistics/) · **Licence:** [CC BY-NC-SA 3.0 (ACL Anthology, before 2016)](https://creativecommons.org/licenses/by-nc-sa/3.0/) **Links:** [Publisher's page](https://aclanthology.org/W10-3012/) · [PDF](https://aclanthology.org/W10-3012.pdf) · [OpenAlex](https://openalex.org/W2098295093) **Citations:** 5 citations (OpenAlex, 2026-10-14) · 2 in our library, of the 141,840 papers whose bibliographies we read ## Summary The paper describes a system for the CoNLL-2010 shared task on uncertainty detection. Task 1 flags whole sentences as uncertain: hedged sentences in biological text and "weasel" sentences in Wikipedia, where a claim rests on a vague, unverifiable authority. Task 2 finds the hedge cue words inside a sentence and marks the span each cue governs. The authors chose fast linear max-margin learners throughout: - **Biology:** a sparse L1-regularised SVM. - **Wikipedia:** an L2-regularised model. - **Cues and scopes:** an approximate L2 max-margin sequence labeller over BIO tags. Features combine surface forms with output from the Connexor FDG dependency parser. Feature templates were chosen by greedy forward search. The corrected system reaches about 86.0 F1 for biology and 58.2 for Wikipedia. On Task 2 it scores 78.5 for cues and 39.6 for full scope resolution. Training takes minutes and prediction takes seconds on an ordinary PC. The work shows that linguistically informed but cheap structured prediction is a workable approach to hedges. It also shows that much of the remaining error comes from tokenisation, format conversion and strict scoring rather than from the model itself. ## Key points - **Models:** The biological sentence classifier uses an L1-regularised hinge-loss SVM from the library by Fan et al. (2008). L1 was preferred because a small set of lexical cues dominates the bio annotation, while the noisier Wikipedia weasel data fared slightly better with L2. - **Class imbalance:** Each class is weighted by the inverse of its share of the training data, as a rough way of optimising F1. - **Feature templates:** SENLEN gives sentences three length-dependent bias terms, with cut points at 18 and 32 tokens. Other templates are DOCPT, TOKEN, LEMMA, QUANT, HEAD, DEPREL, SYN and MORPH, plus Cartesian products of templates. The structural features come from the Connexor FDG parser. - **Results:** The official results were 85.2 (bio), 55.4 (Wikipedia) and 62.5 for cues. The full Task 2 score was only 2.1 because of bugs. After fixes the scores rose to 85.97, 58.25, 78.52 (cues) and 39.64 (scopes). - **Error analysis:** - About 80 scope errors come from misaligned tokens such as parentheses when converting back to the BioScope XML. - Weasels were over-predicted because the parse did not separate subject and non-subject quantified NPs. - Negation was captured only through adjacent bigrams, so longer-range negations were missed. ## Interesting ideas - Feature templates are added greedily, and each candidate set is scored as the cross-validated mean F1 minus one standard deviation, which favours configurations that are stable across folds rather than ones that are lucky on average. - The "certain" class has no explicit markers and is treated as the default, captured by a bias term, while only the marked "uncertain" class receives lexical and syntactic features. - Predicted BIO spans are rebuilt with a stack that forces scopes to be either disjoint or nested and never to begin or end inside a cue, with a whole-sentence fallback when this fails. - The choice between sparse L1 and dense L2 regularisation follows from how the signal is distributed: a few strong lexical cues call for L1, while diffuse, noisy signals suit L2. - The authors argue that exact-match span scoring is too harsh, since shifting a boundary over one unimportant token voids an otherwise sensible analysis, and propose token-level or fuzzy scoring instead. ## For Mova How these ideas could serve Mova, our small open language model — its files, stages and tests: - **I1** (learn): Use the same mean-minus-spread criterion when choosing parser feature sets or self-induced repair rules, so that a gain must be consistent across data splits before it is accepted. - **I2** (frames): Speech-act and epistemic-stance detection in prag could treat plain assertion as the unmarked default and attach explicit evidence only to hedged, reported or doubted statements, which keeps the explanation short and readable. - **I3** (frames): Scopes of hedges, negation and modal operators over frames could be decoded with the same well-formedness stack, and the fallback cases could be logged as explainable low-confidence decisions. - **I4** (tokens): For tagger or lexical-class features dominated by a handful of trigger words, sparse regularisation could give smaller and more inspectable models whose surviving weights read like a lexicon. - **I5** (learn): Evaluation of scopes, constituents and frame arguments could report token-overlap scores alongside exact match, so that boundary noise from tokenisation is separated from real semantic errors. *Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.* ## Institutions - [Uppsala University](https://md.research.elamur.ai/free/en/universities/uppsala-university/) — University, Uppsala, Sweden · 56 works · 13,046 citations - [Stockholm University](https://md.research.elamur.ai/free/en/universities/stockholm-university/) — University, Stockholm, Sweden · 10 works · 1,682 citations - [Swedish Institute of Computer Science](https://md.research.elamur.ai/free/en/ngos/swedish-institute-of-computer-science/) — Nonprofit, Kista, Sweden · 4 works · 587 citations 📚 Shelves (4): [🖥️ Computer Science](https://md.research.elamur.ai/free/en/shelves/computer-science/) · 9,085 works · [🤖 Artificial Intelligence](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · 8,888 works · [🎭 Arts and Humanities](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · 9,296 works · [🗣️ Language and Linguistics](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · 9,206 works ## Cite Cite as: Oscar Täckström, Sumithra Velupillai, Martin Hassel, Gunnar Eriksson, Hercules Dalianis and Jussi Karlgren. 2010. Uncertainty Detection as Approximate Max-Margin Sequence Labelling. Proceedings of the Fourteenth Conference on Computational Natural Language Learning – Shared Task. The paper itself, not this page. BibTeX from the library's record of the work. ```bibtex @inproceedings{tackstrom2010uncertainty, title = {{Uncertainty Detection as Approximate Max-Margin Sequence Labelling}}, author = {Oscar Täckström, Sumithra Velupillai, Martin Hassel, Gunnar Eriksson, Hercules Dalianis and Jussi Karlgren}, booktitle = {Proceedings of the Fourteenth Conference on Computational Natural Language Learning – Shared Task}, year = {2010}, url = {https://aclanthology.org/W10-3012/} } ``` - [← previous Towards a Heuristic Categorization of Prepositional Phrases in English with WordNet](https://md.research.elamur.ai/free/en/papers/rudzicz-2010-towards-heuristic-categorization-prepositional-phrases/) - [next → Weakly Supervised Learning of Presupposition Relations between Verbs](https://md.research.elamur.ai/free/en/papers/tremper-2010-weakly-supervised-learning-presupposition-relations/) - [↑ back to papers of 2010](https://md.research.elamur.ai/free/en/papers/2010/page/2/) ## References 1 references, 0 of them with a card of ours. ↗ leads to the work. 1. Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, Xiang-Rui Wang, and Chih-Jen Lin. 2008. LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research, 9:1871–1874. [↗](https://doi.org/10.5555/1390681.1442794) *Updated 24 October 2026*