Abstract
A program for associating a given segment of speech with a phoneme group, such as a vowellike segment, fricativelike segment, etc., is described. Some disadvantages of the presently accepted grouping of phonemes into stops, fricatives, vowels, etc., are discussed. Grouping of phonemes used by Sanskrit grammarians seems to be more appropriate for computer speech recognition. A grouping of phonemes into several nonmutually-exclusive sets that combine the concepts of the presently acceptable grouping and those of the Sanskrit grammarians is proposed. This grouping is more suitable in that it permits algorithmic definitions of vowel-like sounds, etc., in terms of easily obtainable acoustic parameters—namely, intensity and zero crossings. Some results obtained using the suggested algorithm are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
