Pattern extraction improves automata-based syntax analysis in songbirds

Authors:
Yasuki Kakishita;Kazutoshi Sasahara;Tetsuro Nishino;Miki Takahasi;Kazuo Okanoya
Affiliations:
Department of Information and Communication Engineering, Graduate School of Electro-Communications, The University of Electro-Communications, Chofu-shi, Tokyo, Japan;Laboratory for Biolinguistics, RIKEN Brain Science Institute, Wako-shi, Saitama, Japan;Department of Information and Communication Engineering, Graduate School of Electro-Communications, The University of Electro-Communications, Chofu-shi, Tokyo, Japan;Laboratory for Biolinguistics, RIKEN Brain Science Institute, Wako-shi, Saitama, Japan;Laboratory for Biolinguistics, RIKEN Brain Science Institute, Wako-shi, Saitama, Japan
Venue:
ACAL'07 Proceedings of the 3rd Australian conference on Progress in artificial life
Year:
2007

Citing 4
Cited 1

Inference of Reversible Languages

Journal of the ACM (JACM)
Statistical Language Learning

Statistical Language Learning
Learning Syntax by Automata Induction

Machine Learning
A Reversible Automata Approach to Modeling Birdsongs

CIC '06 Proceedings of the 15th International Conference on Computing

Ethological data mining: an automata-based approach to extract behavioral units and rules

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an automata induction approach to modeling birdsongs on the basis of Angluin's induction algorithm, which ensures that k-reversible languages can be learned from positive samples in polynomial time. There are similarities between Angluin's algorithm and the vocal learning of songbirds; for example, during a critical period, songbirds learn songs from positive samples of conspecific birds. In our previous method, we could not construct song syntaxes for complex songs. In this paper, we introduce a pattern extraction method to improve our previous method and propose a new birdsong modeling method. We estimate the robustness and properness of our method by using artificial song data, and demonstrate that the song syntaxes of the Bengalese finch can be successfully represented as reversible automata. As a result, almost all Bengalese finchs' song syntaxes can be represented with lower k-reversibility; further, one song has 3-reversibility song syntax showing the highest reversibility.