2003 SupersenseTaggingOfUnknownNounsInWordNet

From GM-RKB
Jump to navigation Jump to search

Subject Headings: Entity Recognition Task, Multiclass Perceptron Classifier.

Notes

Cited By

2008

  • (Picca et al., 2008) ⇒ Davide Picca, Alfio Massimiliano Gliozzo, and Massimiliano Ciaramita. (2008). “Supersense Tagger for Italian.” In: Proceedings of LREC Conference (LREC 2008)
    • … To this aim, (Ciaramita and Johnson, 2003) developed a SuperSense Tagging (SST) technology for English, demonstrating that reasonably high accuracy in tagging can be obtained even in open domain contexts. This technology has been also adopted for Ontology Learning (Picca et al., May 2007), as the top level WordNet SuperSenses cover almost any high level ontological type of interest in ontology design. Section 2. describes the main features of the English SST.

Quotes

Abstract

We present a new framework for classifying common nouns that extends namedentity classification. We used a fixed set of 26 semantic labels, which we called supersenses. These are the labels used by lexicographers developing WordNet. This framework has a number of practical advantages. We show how information contained in the dictionary can be used as additional training data that improves accuracy in learning new nouns. We also define a more realistic evaluation procedure than cross-validation.


References

  • BLLIP. (2000). 1987-1989 WSJ Corpus Release 1. Linguistic Data Consortium.
  • Eugene Charniak. (2000). A maximum-entropy-inspired parser. In: Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics.
  • M. Ciaramita. (2002). Boosting Automatic Lexical Acquisition with Morphological Information. In: Proceedings of the Workshop on Unsupervised Lexical Acquisition, ACL-02.
  • M. Collins and Yoram Singer. (1999). Unsupervised Models for Named Entity Classification. In: Proceedings of the Joint SIGDAT Conference on Empirical Methods in Natural Language Processing and Very Large Corpora.
  • M. Collins. (2002). Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP-02), pages 1–8.
  • K. Crammer and Yoram Singer. (2002). Ultraconservative Online Algorithms for Multiclass Problems. Technical Report [2001-18], School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel.
  • C. Fellbaum. (1998). WordNet: An Electronic Lexical Database. MIT Press, Cambridge, MA.
  • Y. Freund and R. Schapire. (1999). Large Margin Classification Using the Perceptron Algorithm. Machine Learning, 37. R. Granger. 1977. FOUL-UP: A Program that Figures Out
  • Meanings of Words from Context. In: Proceedings of the Fifth International Joint Conference on Artificial,


 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2003 SupersenseTaggingOfUnknownNounsInWordNetMassimiliano Ciaramita
Mark Johnson
Supersense Tagging of Unknown Nouns in WordNetProceedings of the Conference on Empirical Methods in Natural Language Processinghttp://acl.ldc.upenn.edu/W/W03/W03-1022.pdf10.3115/1119355.11193772003