Aural Pattern Recognition Experiments and the Subregular Hierarchy
- 156 Downloads
We explore the formal foundations of recent studies comparing aural pattern recognition capabilities of populations of human and non-human animals. To date, these experiments have focused on the boundary between the Regular and Context-Free stringsets. We argue that experiments directed at distinguishing capabilities with respect to the Subregular Hierarchy, which subdivides the class of Regular stringsets, are likely to provide better evidence about the distinctions between the cognitive mechanisms of humans and those of other species. Moreover, the classes of the Subregular Hierarchy have the advantage of fully abstract descriptive (model-theoretic) characterizations in addition to characterizations in more familiar grammar- and automata-theoretic terms. Because the descriptive characterizations make no assumptions about implementation, they provide a sound basis for drawing conclusions about potential cognitive mechanisms from the experimental results. We review the Subregular Hierarchy and provide a concrete set of principles for the design and interpretation of these experiments.
KeywordsSub-regular languages Local languages Artificial grammar learning Cognitive complexity Aural pattern recognition Mathematics of language
Unable to display preview. Download preview PDF.
- Benedikt, M., & Segoufin, L. (2005). Regular tree languages definable in FO. In V. Diekert & B. Durand (Eds.), 22nd annual symposium on theoretical aspects of computer science (STACS 2005), lecture notes in computer science (Vol. 3404, pp. 327–339).Google Scholar
- Bresnan J. W. (1978) Evidence for a theory of unbounded transformations. Linguistic Analysis 2: 353–393Google Scholar
- Chomsky, N. (1962). Context-free grammars and pushdown storage. Quarterly Progress Report 65, MIT Res. Lab. Elect.Google Scholar
- Heinz, J. (2007). Inductive learning of phonotactic patterns. PhD thesis, Department of Linguistics, UCLAGoogle Scholar
- Huybregts R. (1984) The weak inadequacy of context-free phrase structure grammars. In: Haan G. J., de Trommelen M., Zonneveld W. (eds) Van Periferie Naar Kern. Foris Publications, Dordrecht, pp 81–99Google Scholar
- Lautemann C., Schwentick T., Théien D. (1994) Logics for context-free languages. In: Pacholski L., Tiuryn J. (eds) Computer science logic. Kazimierz, Poland, pp 203–216Google Scholar
- McNaughton R., Papert S. (1971) Counter-free automata. MIT Press, CambridgeGoogle Scholar
- Medvedev Y. T. (1964) On the class of events representable in a finite automaton. In: Moore E. F. (eds) Computer science logic. Sequential Machines—Selected Papers, Addison-Wesley, pp 215–227 originally in Russian in Avtomaty (1956), pp. 385–401Google Scholar