Comparing learners for Boolean partitions: implications for morphological paradigms

Authors:
Katya Pertsova
Affiliations:
University of North Carolina, Chapel Hill
Venue:
CLAGI '09 Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference
Year:
2009

Citing 5
Cited 0

A theory of the learnable

Communications of the ACM
Learning Boolean Functions in an Infinite Attribute Space

Machine Learning
On learning visual concepts and DNF formulae

Machine Learning
Unsupervised learning of the morphology of a natural language

Computational Linguistics
Unsupervised learning of morphology using a novel directed search algorithm: taking the first step

MPL '02 Proceedings of the ACL-02 workshop on Morphological and phonological learning - Volume 6

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, I show that a problem of learning a morphological paradigm is similar to a problem of learning a partition of the space of Boolean functions. I describe several learners that solve this problem in different ways, and compare their basic properties.