Elamur Research⌕
☰
home / papers / 2004 / Mining the Web for Discourse Markers

Mining the Web for Discourse Markers

Paper · 2004 · Ben Hutchinson

Summary

Empirical work on discourse markers, and NLP systems that learn from them, need many example sentences. Even the 100-million-word BNC has very few instances of rarer connectives. Hutchinson proposes harvesting such sentences from the web through a five-stage pipeline:

  • query a search engine for each marker's surface form;
  • extract and sentence-split the page text;
  • remove duplicate sentences;
  • parse each sentence with Charniak's parser and keep only true connective uses;
  • store the survivors in a database indexed by marker.

The pipeline was run for 116 structural connectives, with 8,000 pages per marker. On rare markers the web yielded far more examples than the BNC; for example, assuming that gave 4,695 sentences against 395. On a hand-checked sample, precision was 84.4–91.4%, while the agreement between the two judges suggests a human ceiling of 93%. Co-occurrence statistics of connectives with adverbial markers correlated strongly with BNC statistics. This suggests the web data reflects typical discourse contexts, making the web a practical way around data sparseness for discourse research.

Key points

  • The setup used AltaVista, CPAN's HTML::Parser and Charniak's (2000) parser. It covered 116 structural connectives (e.g. and, after, as long as, given that, to the extent that), analysing 8,000 pages per marker.

  • A syntactic test decides whether a candidate is a connective: it counts only if, in the parse tree, an S node comes immediately after it. The test tolerates some parser errors, such as an odd PP → IN S expansion.

  • On five test markers, a random sample of 100 per marker was checked by two judges. System precision was 84.4–91.4%. The judges disagreed on 7% of cases, with overall kappa 0.671, but kappa was low for as long as. Marcu (1998) reported 89.5% on a similar task.

  • Web vs BNC sentence counts:

    • as long as: 6,244 vs 2,357;
    • every time: 5,124 vs 660;
    • assuming that: 4,695 vs 395.

    Extrapolation via AlltheWeb page counts suggests millions to billions of tokens are available on the web, and these figures are lower bounds.

  • Pearson correlation of connective–adverbial bigram counts between web and BNC was 0.80–0.96 for after, and, before, but and or. These values are higher than Keller and Lapata's web/BNC correlations for content-word bigrams.

Interesting ideas

  • I1. Search engines cap the number of results per query, so the author splits each query into complementary halves ("X AND 1" / "X AND NOT 1"). This gets past the cap while assuming the extra term is roughly independent of X.
  • I2. Exact duplicate sentences are dropped before analysis, so mirrored, syndicated or quoted text counts as one utterance. This saves compute and stops a single viral sentence from skewing distributional statistics.
  • I3. Whether a word is a discourse use is decided from parse structure (the marker must sit right before a clause node) rather than from surface patterns. Recall is deliberately sacrificed for precision because the data source is effectively unlimited.
  • I4. Representativeness of a new corpus is checked by correlating co-occurrence counts with a trusted balanced corpus. Here the counts were connective plus adverbial marker bigrams, which serve as a cheap proxy for discourse context.
  • I5. Inter-judge disagreement is used as an explicit upper bound for system accuracy, and per-marker significance tests reveal which connectives are inherently hard (e.g. assuming that, as long as).

For Mova

How these ideas could serve Mova, our small open language model — its files, stages and tests:

  • I1 (learn): when harvesting silver sentences for a rare construction from any capped search API, partitioning queries this way multiplies the yield without bias-heavy reformulation.
  • I2 (learn): deduplicating web-mined silver data before witness-parser agreement prevents one repeated sentence from looking like strong consensus evidence.
  • I3 (tree): a UD-level rule such as "mark/cc attached to a clausal head (advcl, conj of a verb)" can separate connective uses of and, after or given that from phrasal ones, giving clean examples per marker.
  • I4 (learn): the same correlation check against a reference treebank or corpus could validate any harvested silver set before training, acting as a distribution-level sanity control.
  • I5 (frames): evaluating discourse-relation detection per connective, against a human-agreement ceiling, would show where prag's relation frames fail because of the system and where the ambiguity is inherent.

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

 Fields, topics and concepts

📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Computer Science · 16,667 worksArtificial Intelligence · 16,194 worksArts and Humanities · 16,039 worksLanguage and Linguistics · 15,891 works

🧭 Topics 1Research subjects and languages the work is about.Discourse analysis · 466 works

Cite

Cite as Ben Hutchinson. 2004. Mining the Web for Discourse Markers. Proceedings of the Fourth International Conference on Language Resources and Evaluation (LREC'04).

The paper itself, not this page. BibTeX from the library's record of the work.

@inproceedings{hutchinson2004mining,
  title = {{Mining the Web for Discourse Markers}},
  author = {Ben Hutchinson},
  booktitle = {Proceedings of the Fourth International Conference on Language Resources and Evaluation (LREC'04)},
  year = {2004},
  doi = {10.63317/3b5c7yah6g4r},
  url = {https://doi.org/10.63317/3b5c7yah6g4r}
}

References

15 references, 6 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. Bestgen, Yves, Liesbeth Degand, and Wilbert Spooren, 2003. On the use of automatic techniques to determine the semantics of connectives in large newspaper corpora: An exploratory study. In Proceedings of the MAD’03 workshop on Multidisciplinary Approaches to Discourse. find
  2. Burnard, Lou (ed.), 1995. Users Reference Guide for the British National Corpus. Oxford University Computing Service. find
  3. Carletta, Jean, 1996. Assessing agreement on classification tasks: The kappa statistic. Computational Linguistics, 22(2):249– 254. ↗
  4. Di Eugenio, Barbara, Johanna D. Moore, and Massimo Paolucci, 1997. Learning features that predict cue usage. In Proceedings of the 35th Conference of the Association for Computational Linguistics (ACL97). Madrid, Spain. ↗
  5. Hutchinson, Ben, 2003. Automatic classification of discourse markers by their co-occurrences. In Proceedings of the ESS-LLI 2003 workshop on Discourse Particles: Meaning and Implementation. find
  6. Keller, Frank and Maria Lapata, 2003. Using the web to obtain frequencies for unseen bigrams. Computational Linguistics, 29(3):459–484. ↗
  7. Kilgarriff, Adam and Gregory Grefenstette, 2003. Introduction to the special issue of the web as corpus. Computational Linguistics, 29(3):333–348. find
  8. Knott, Alistair, 1996. A data-driven methodology for motivating a set of coherence relations. Ph.D. thesis, University of Edinburgh. find
  9. Lapata, Mirella and Alex Lascarides, 2004. Inferring sentence-internal temporal relations. In In Proceedings of the Human Language Technology Conference and the North American Chapter of the Association for Computational Linguistics Annual Meeting. Boston, MA.
  10. Litman, Diane J., 1996. Cue phrase classification using machine learning. Journal of Artificial Intelligence Research, 5:53–94. ↗
  11. Marcu, Daniel, 1998. A surface based approach to identifying discourse markers and elementary textual units in unrestricted texts. In Proceedings of the COLING/ACL workshop on Discourse Relations and Discourse Markers.
  12. Marcu, Daniel and Abdessamad Echihabi, 2002. An unsupervised approach to recognizing discourse relations. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL-2002). Philadelphia, PA.
  13. Resnik, Philip and Aaron Elkiss, 2004. The linguist’s search engine: Getting started guide. Technical Report LAMP-TR-108/CS-TR-4541/UMIACS-TR-2003-109, University of Maryland, College Park. Update of January 20, 2004. find
  14. Siegel, Eric V. and Kathleen McKeown, 1994. Emergent linguistic rules from inducing decision trees: Disambiguating discourse clue words. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94). ↗
  15. Webber, Bonnie, Matthew Stone, Aravind Joshi, and Alistair Knott, 2003. Anaphora and discourse structure. Computational Linguistics. ↗

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/hutchinson-2004-mining-web-discourse-markers/