A default first order family weight determination procedure for WPDV models

Authors:
Hans van Halteren
Affiliations:
University of Nijmegen, HD Nijmegen, The Netherlands
Venue:
ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
Year:
2000

Citing 3
Cited 4

Forgetting Exceptions is Harmful in Language Learning

Machine Learning - Special issue on natural language learning
Induction of Decision Trees

Machine Learning
Improving accuracy in word class tagging through the combination of machine learning systems

Computational Linguistics

New Feature Sets for Summarization by Sentence Extraction

IEEE Intelligent Systems
Improving accuracy in word class tagging through the combination of machine learning systems

Computational Linguistics
Chunking with WPDV models

ConLL '00 Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - Volume 7
Dealing with orthographic variation in a tagger-lemmatizer for fourteenth century Dutch charters

Language Resources and Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weighted Probability Distribution Voting (WPDV) is a newly designed machine learning algorithm, for which research is currently aimed at the determination of good weighting schemes. This paper describes a simple yet effective weight determination procedure, which leads to models that can produce competitive results for a number of NLP classification tasks.