TAILIEUCHUNG - Báo cáo khoa học: "AN AUTOMATIC SPEECH RECOGNITION SYSTEM FOR ITALIAN LANGUAGE"

An automatic speech recognition system for Italian language has been developed at IBM Italy Scientific Center in Rome. It is able to recognize in real time natural language sentences, composed with words from a dictionary of 6500 items, dictated by a speaker with short pauses among them. The system is speaker dependent, before using it the speaker has to perform the training stage reading a predefined text 15-20 minutes long. It runs on an architecture composed by an IBM 3090 mainframe and a PC/AT based workstation with signal processing equipments. . | AN AUTOMATIC SPEECH RECOGNITION SYSTEM FOR HIE ITALIAN LANGUAGE Paolo D Orta Marco Ferretti Alessandro Martclli Stefano Scarci IBM Rome Scientific Center via Giorgione 159 ROME Italy ABSTRACT An automatic speech recognition system for Italian language has been developed at IBM Italy Scientific Center in Rome. It is able to recognize in real time natural language sentences composed with words from a dictionary of 6500 items dictated by a speaker with short pauses among them. The system is speaker dependent before using it the speaker has to perform the training stage reading a predefined text 15-20 minutes long. It runs on an architecture composed by an IBM 3090 mainframe and a PC AT based workstation with signal processing equipments. PROBABILISTIC APPROACH The problem of recognizing human voice is approached in a probabilistic manner. Let w VVỊ be a sequence of n words and let A be the acoustic information extracted from the speech signal from which-the system will try to identify the pronounced words. P w IA _indicates the probability that the the sequence of words has been spoken once we observe the acoustic string A produced at the end of the signal processing stage. The most probable sequence of word given A is that maximizing P w IA . Through Bayes formula A . _ _ - Pl A I W P W P W A max P w IA max y v 2 - - P A PịA I W denotes the probability that__the sequence of words w will produce the acoustic_string_ l P W is the a priori probability of word string w P A is the probability of acoustic string A. To find the word sequence which maximizes the third term in the preceding equation it is sufficient to -find the sequence which maximizes the numerator P A is in fact clearly not dependent on any w. Then the recognition task can be decomposed in these problems 1. perform an acoustic processing able to extract from the speech signal an information A representative of its acoustic features and at the same time adequate for a statistical analysis 2. create an

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.