Brandeis Institutional Repository - The Best Binary Split Algorithm: A deterministic method for dividing vowel inventories into contrastive distinctive features

Brandeis Institutional Repository

Browse by

My Account

Information

The Best Binary Split Algorithm: A deterministic method for dividing vowel inventories into contrastive distinctive features

Show full item record

Title The Best Binary Split Algorithm: A deterministic method for dividing vowel inventories into contrastive distinctive features
Author: Shwayder, Kobey
Abstract: The task of finding the distinctive features to best describe a vowel inventory seems nondeterministic. The set of features must describe the inventory in as few features as possible, while providing feature contrasts between vowels to satisfy the active phonological processes in the language. Several previous algorithms have been able to define contrastive vowels for a vowel inventory with a pre-specified set of distinctive features, but these algorithms fail without prior knowledge of the feature set. In this thesis, I have created and implemented the Best Binary Split algorithm, a deterministic algorithm which is able to find the set of distinctive features and the set of contrastive vowel pairs for a language using only the vowel inventory of that language, a global feature hierarchy, and a deterministic process for reranking that hierarchy for each language based on the patterning of natural classes of vowels in that language.
URI: http://hdl.handle.net/10192/23254
Date: 2009-05-15

Files in this item

Files Size Format View
Shwayder-BestBinarySplit.pdf 355.1Kb PDF Thumbnail Thesis
BestBinarySplitGlobal.py 12.92Kb Unknown View/Open
BestBinarySplitPatterns.py 16.42Kb Unknown View/Open

This item appears in the following Collection(s)

Show full item record