A machine learning approach to relational noun mining in German

Authors:
Berthold Crysmann
Affiliations:
Arbeitsbereich Sprache und Kommunikation Universität Bonn
Venue:
MWE '11 Proceedings of the Workshop on Multiword Expressions: from Parsing and Generation to the Real World
Year:
2011

Citing 12
Cited 0

Word association norms, mutual information, and lexicography

Computational Linguistics
Bagging predictors

Machine Learning
Fast training of support vector machines using sequential minimal optimization

Advances in kernel methods
Foundations of statistical natural language processing

Foundations of statistical natural language processing
Introduction to the special issue on computational linguistics using large corpora

Computational Linguistics - Special issue on using large corpora: I
Accurate methods for the statistics of surprise and coincidence

Computational Linguistics - Special issue on using large corpora: I
Retrieving collocations from text: Xtract

Computational Linguistics - Special issue on using large corpora: I
Methods for the qualitative evaluation of lexical association measures

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Error mining for wide-coverage grammar engineering

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Large linguistically-processed web corpora for multiple languages

EACL '06 Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations
Towards domain-independent deep linguistic processing: ensuring portability and re-usability of lexicalised grammars

GEAF '08 Proceedings of the Workshop on Grammar Engineering Across Frameworks
The WEKA data mining software: an update

ACM SIGKDD Explorations Newsletter

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper I argue in favour of a collocation extraction approach to the acquisition of relational nouns in German. We annotated frequency-based best lists of noun-preposition bigrams and subsequently trained different classifiers using (combinations of) association metrics, achieving a maximum F-measure of 69.7 on a support vector machine (Platt, 1998). Trading precision for recall, we could achieve over 90% recall for relational noun extraction, while still halving the annotation effort.