Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Galiano, I. ; Dept. Sistemas Inf. y Computacion, Univ. Politecnica de Valencia, Spain ; Segarra, E.

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

Published in:
Grammatical Inference: Theory, Applications and Alternatives, IEE Colloquium on

Date of Conference: 22-23 Apr 1993

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.