Elamur Research⌕
☰
home / papers / 2002 / Combining Unsupervised and Supervised Methods for PP Attachment Disambiguation

Combining Unsupervised and Supervised Methods for PP Attachment Disambiguation

What it is about

The paper asks what to do when only a small treebank exists for prepositional phrase (PP) attachment. The data are German: 10,000 NEGRA sentences give the supervised examples, and about 5.5 million words of a computer magazine give raw co-occurrence counts. A cascade of count rules, with a noun factor of 5.47 or 5.97 to balance verb and noun counts, reaches 81.67% on the decidable cases (90.13% coverage) of a 4469-item test set. A back-off model trained on the small treebank reaches 73.98%. Ordering the two sources by reliability gives 80.98% on all 4469 items. With the roles swapped, the combination gives 71.95% against 68.29% for back-off alone.

For Mova

The chapters are languages/en/22-phrases.md and 23-complementation.md (verb or noun choice for a PP complement). The code is en/src/parse.rs, with en/src/explain.rs for the per-level reason. The German figures do not carry over to English; the first English number must come from EWT test, with the two-fold check for decisions. Count tables are built from EWT train, which is CC BY-SA and may be used for training.

 Institutions

Cite

Cite as Martin Volk. 2002. Combining Unsupervised and Supervised Methods for PP Attachment Disambiguation. COLING 2002: The 19th International Conference on Computational Linguistics.

The paper itself, not this card. BibTeX from the library's record of the work. DOI 10.3115/1072228.1072232

@inproceedings{volk2002combining,
  title = {{Combining Unsupervised and Supervised Methods for PP Attachment Disambiguation}},
  author = {Martin Volk},
  booktitle = {COLING 2002: The 19th International Conference on Computational Linguistics},
  year = {2002},
  doi = {10.3115/1072228.1072232},
  url = {https://doi.org/10.3115/1072228.1072232}
}

References

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

  1. E. Brill and P. Resnik. 1994. A rule-based approach to prepositional phrase attachment disambiguation. In Proceedings of COLING, pages 1198–1204, Kyoto. ACL. find
  2. M. Collins and J. Brooks. 1995. Prepositional phrase attachment through a backed-off model. In Proc. of the Third Workshop on Very Large Corpora. our card
  3. D. Hindle and M. Rooth. 1993. Structural ambiguity and lexical relations. Computational Linguistics, 19(1):103–120. correct incorrect accuracy 2400 469 83.65% 1219 381 76.19% 3619 850 80.98% 4469 (of 4469) coverage: 100% threshold 0.020 0.109 number 97 6 269 845 2677 71 81 202 210 11 4469 coverage 2… our card
  4. Adwait Ratnaparkhi. 1998. Statistical models for unsupervised prepositional phrase attachment. In Proceedings of COLING-ACL-98, Montreal. find
  5. W. Skut, T. Brants, B. Krenn, and H. Uszkoreit. 1998. A linguistically interpreted corpus of German newspaper text. In Proc. of ESSLLI-98 Workshop on Recent Advances in Corpus Annotation, Saarbrücken. find
  6. J. Stetina and M. Nagao. 1997. Corpus based PP attachment ambiguity resolution with a semantic dictionary. In J. Zhou and K. Church, editors, Proc. of the 5th Workshop on Very Large Corpora, Beijing and Hongkong. our card
  7. Martin Volk. 2001. Exploiting the WWW as a corpus to resolve PP attachment ambiguities. In Proc. of Corpus Linguistics 2001, Lancaster, March. find

This page in Markdown → https://md.research.elamur.ai/free/en/papers/volk-2002-combining-unsupervised-supervised-methods-pp/