Supersense Tagging of Unknown Nouns in WordNet

What it is about

The paper extends named-entity classification to common nouns. Each unknown noun is assigned one of 26 supersenses, the lexicographer classes that WordNet uses to organise its noun entries (person, location, event, quantity and so on). The classifier is an averaged multiclass perceptron over features from the context and the syntax, trained on about 787,000 noun instances from a 40-million-word parsed corpus. Nouns with more than one supersense were removed from training. Because the WordNet glosses and examples add about 66,800 training instances, the authors can test whether dictionary text helps. It does: the model trained on the glosses beats the same model without them on both test sets, and the paper also reports that a most-frequent-label baseline ("person") scores in the low twenties. The paper also argues for an evaluation on new nouns, not cross-validation.

Ideas

• I1. onto/src/wsd.rs or the onto lookup: when a noun has no WordNet entry, give a supersense from a rule-plus-perceptron step over the head noun and its suffix, and print the rule in the explanation. Measure supersense accuracy on the unknown nouns of EWT against the "person" baseline.
• I2. Gloss instances for en/src/ptag.rs-style training: turn WordNet glosses into labelled noun instances and add them to the averaged-perceptron training of a noun-class model, and measure accuracy on a held-out split of the open treebanks, with two identical runs.
• I3. Ambiguity filter: count how many EWT noun tokens have more than one WordNet supersense (the paper's figure is 72% of tokens for its corpus) and train only on unambiguous nouns. Report the size of the training set before and after the filter.

For Mova

The touch points are onto (WordNet lexicographer files), en/src/ptag.rs (averaged perceptron, the same learner family) and en/src/tok.rs for tokens. The chapter is 11. Nouns. The paper's corpus and WordNet test sets are NC-tagged, so only the method and tests use them; the build can use WordNet itself (open) and EWT (CC BY-SA). Measure first the "person" baseline and the perceptron on the EWT unknown nouns.

Cite

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

@inproceedings{ciaramita2003supersense,
  title = {{Supersense Tagging of Unknown Nouns in WordNet}},
  author = {Ciaramita, Massimiliano and Johnson, Mark},
  booktitle = {Proceedings of the 2003 Conference on Empirical Methods in Natural Language Processing},
  year = {2003},
  doi = {10.3115/1119355.1119377},
  url = {https://doi.org/10.3115/1119355.1119377}
}

References

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

1. BLLIP. 2000. 1987-1989 WSJ Corpus Release 1. Linguistic Data Consortium. find
2. E. Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics. find
3. M. Ciaramita. 2002. Boosting Automatic Lexical Acquisition with Morphological Information. In Proceedings of the Workshop on Unsupervised Lexical Acquisition, ACL-02. find
4. M. Collins and Y. 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. find
5. 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. find our card
6. K. Crammer and Y. Singer. 2002. Ultraconservative Online Algorithms for Multiclass Problems. Technical Report [2001-18], School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel. find
7. C. Fellbaum. 1998. WordNet: An Electronic Lexical Database. MIT Press, Cambridge, MA. find
8. Y. Freund and R. Schapire. 1999. Large Margin Classification Using the Perceptron Algorithm. Machine Learning, 37. find
9. 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 Intelligence. find
10. M. Hearst. 1992. Automatic Acquisition of Hyponyms from Large Text Corpora. In Proceedings of the 14th International Conference on Computational Linguistics. find
11. M. Pasca and S.H. Harabagiu. 2001. The Informative Role of WordNet in Open-Domain Question Answering. In NAACL 2001 Workshop on WordNet and Other Lexical Resources: Applications, Extensions and Customizations. find
12. J. Pustejovsky, A. Rumshisky, and J. Casta È Ç o. 2002. Rerendering Semantic Ontologies: Automatic Extensions to UMLS through Corpus Analytics. In In Proceedings of REC 2002 Workshop on Ontologies and Lexical Knowledge Bases. find
13. E. Riloff and R. Jones. 1999. Learning Dictionaries for Information Extraction by Multi-Level Bootstrapping. In Proceedings of the Sixteenth National Conference on Artificial Intelligence. find
14. B. Roark and E. Charniak. 1998. Noun-Phrase Co-Occurrence Statistics for Semi-Automatic Semantic Lexicon Construction. In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics. find
15. U. Zernik. 1991. Introduction. In U. Zernik, editor, Lexical Acquisition: Exploiting On-line Resources to Build a Lexicon. Lawrence Erlbaum Associates. find

This page in Markdown → https://md.mova.elamur.ai/free/en/docs/papers/aclbulk-2003-ciaramita-supersense-tagging-unknown-nouns-wordnet/