2026-09-20T03:28:57Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/174922022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Kenneth N. Stevens.
Maldonado, Aaron (Aaron Theodore), 1976-
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2005-06-02T15:27:23Z
2005-06-02T15:27:23Z
1999
http://hdl.handle.net/1721.1/17492
47094879
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, June 1999.
"May 1999."
Includes bibliographical references (leaf 56).
The goal of this thesis is to incorporate a feature tree geometry into an existing matcher for a lexical access system. Proposed by Professors Kenneth N. Stevens and Samuel Jay Keyser in their paper Feature Geometry and the Vocal Tract, the feature tree geometry is a hierarchical structure for representing the features of a phoneme. The four components involved in incorporating the feature tree geometry into the lexical access system are examined individually: the development of a computational model, the invocation of rules to account for assimilation in running speech, the production of morphemic stems, in particular, plurals, and the process of word retrieval. The last component is not implemented with the feature tree, but the implications of a tree-based matcher are explored. Initially, a brief overview of the lexical access system is presented for the reader's background. Each component is discussed first from a theoretical standpoint and then its implementation is presented and discussed. This paper concludes with a comparison of the original matcher's performance to the performance of the matcher based on the feature tree geometry. Performance results indicate that the computation time of the matcher fitted with the feature tree geometry decreased to 40% of the original matcher's execution time. Overall, this paper represents an initial probe into using alternative lexical representations in a lexical access system to obtain a desired level of performance.
by Aaron Maldonado.
M.Eng.
56 leaves, [52] leaves in various foliations
4054955 bytes
4054762 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Incorporating a feature tree geometry into a matcher for a speech recognizer
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="b671cead-99c9-4a4d-8608-33b5bb14c013">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Incorporating a feature tree geometry into a matcher for a speech recognizer</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>1999</PublicationDate>
<Authors>
<Author>
<DisplayName>Maldonado, Aaron (Aaron Theodore), 1976-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>The goal of this thesis is to incorporate a feature tree geometry into an existing matcher for a lexical access system. Proposed by Professors Kenneth N. Stevens and Samuel Jay Keyser in their paper Feature Geometry and the Vocal Tract, the feature tree geometry is a hierarchical structure for representing the features of a phoneme. The four components involved in incorporating the feature tree geometry into the lexical access system are examined individually: the development of a computational model, the invocation of rules to account for assimilation in running speech, the production of morphemic stems, in particular, plurals, and the process of word retrieval. The last component is not implemented with the feature tree, but the implications of a tree-based matcher are explored. Initially, a brief overview of the lexical access system is presented for the reader's background. Each component is discussed first from a theoretical standpoint and then its implementation is presented and discussed. This paper concludes with a comparison of the original matcher's performance to the performance of the matcher based on the feature tree geometry. Performance results indicate that the computation time of the matcher fitted with the feature tree geometry decreased to 40% of the original matcher's execution time. Overall, this paper represents an initial probe into using alternative lexical representations in a lexical access system to obtain a desired level of performance.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>