Show simple item record

dc.contributor.advisorUssishkin, Adamen
dc.contributor.authorWainwright, Elizabeth Lorraine*
dc.creatorWainwright, Elizabeth Lorraineen
dc.date.accessioned2017-08-10T18:59:56Z
dc.date.available2017-08-10T18:59:56Z
dc.date.issued2017
dc.identifier.urihttp://hdl.handle.net/10150/625234
dc.description.abstractThis thesis is project-oriented, with the goal of the research being to create a computer program that will take a set of words in a language written in the International Phonetic Alphabet (IPA) and two sets of phonemes where one undergoes a phonological change to the other and return a phonological rule describing this data. The program was written in Python. It included several functions as well as a new class termed "Phoneme" to facilitate the storage of phonemic features. A reference was made of Phoneme objects for the program to refer to for feature information while analyzing a data set. The program's parameters were that it be able to return a rule given that the data that it was analyzing contained only phonemes found in the reference and that the change be caused by a phoneme directly adjacent to the phoneme undergoing the change. Five datasets were passed through the program and, with the exception of one, were found to return a passable phonological rule. The most notable improvement to be made is the elimination of feature redundancies within the rule.
dc.language.isoen_USen
dc.publisherThe University of Arizona.en
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en
dc.titleMachine Recognition of Rule-Based Phonological Patternsen_US
dc.typetexten
dc.typeElectronic Thesisen
thesis.degree.grantorUniversity of Arizonaen
thesis.degree.levelbachelorsen
thesis.degree.disciplineHonors Collegeen
thesis.degree.disciplineLinguisticsen
thesis.degree.nameB.A.en
refterms.dateFOA2018-06-27T08:32:52Z
html.description.abstractThis thesis is project-oriented, with the goal of the research being to create a computer program that will take a set of words in a language written in the International Phonetic Alphabet (IPA) and two sets of phonemes where one undergoes a phonological change to the other and return a phonological rule describing this data. The program was written in Python. It included several functions as well as a new class termed "Phoneme" to facilitate the storage of phonemic features. A reference was made of Phoneme objects for the program to refer to for feature information while analyzing a data set. The program's parameters were that it be able to return a rule given that the data that it was analyzing contained only phonemes found in the reference and that the change be caused by a phoneme directly adjacent to the phoneme undergoing the change. Five datasets were passed through the program and, with the exception of one, were found to return a passable phonological rule. The most notable improvement to be made is the elimination of feature redundancies within the rule.


Files in this item

Thumbnail
Name:
azu_etd_hr_2017_0222_sip1_m.pdf
Size:
568.9Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record