Phoneme discrimination using $KS$-algebra II
Ondrej Such, Lenka Mackovicova

TL;DR
This paper explores the use of $KS$-algebra-based classifiers for phoneme discrimination, demonstrating their ability to capture vowel formant features with low complexity.
Contribution
It introduces five $Z$-classifiers based on $KS$-algebra for phoneme classification, highlighting their effectiveness and simplicity.
Findings
Classifiers reflect known vowel formant characteristics
Achieve low Kolmogoroff complexity
Effective in binary phoneme discrimination
Abstract
-algebra consists of expressions constructed with four kinds operations, the minimum, maximum, difference and additively homogeneous generalized means. Five families of -classifiers are investigated on binary classification tasks between English phonemes. It is shown that the classifiers are able to reflect well known formant characteristics of vowels, while having very small Kolmogoroff's complexity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Blind Source Separation Techniques · Fuzzy Logic and Control Systems
