Locating perceptual category centers in multi-dimensional stimulus spaces

Main Article Content

Eric Oglesbee
Kenneth de Jong

Abstract

Examining phonetic categorization in multi-dimensional stimulus spaces poses a number of practical problems. The traditional method of forced identification of an entire stimulus space becomes prohibitive when the number and size of stimulus dimensions becomes increasingly large. In response to this, Iverson and Evans (2003) proposed an adaptive tracking algorithm for finding best exemplars of vowels in a multi-dimensional space. Their algorithm converged on best exemplars in a relatively small number of trials; however, the search method took advantage of special properties of the vowel space in order to achieve rapid convergence. In this paper, a more general multi-dimensional search algorithm is proposed and analyzed for inherent biases. Results showed that there are no long-term biases in the search method, and that multiple types of useful data are generated. The proposed search method appears to be a viable approach for generating a first approximation of phonetic categorization in multi-dimensional stimulus spaces.

Downloads

Download data is not yet available.

Article Details

Section
Articles