The application of k-testable languages in the strict sense to phone recognition in automatic speech recognition

The aim of the work is to show the feasibility and the appeal of characterizable methods of grammatical inference in establishing the required structural models for particular syntactic pattern recognition problems, so as to allow a satisfactory performance to be achieved. In particular, the authors have chosen the application area of automatic speech recognition. They describe two applications in Spanish phone recognition of the use of k=2 and k=3 testable languages in the strict sense (k-TLSS) inductively learned via the k-TSS inference algorithm.<
>