The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
As the basic prosodic unit, the prosodic word play an important role for the naturalness and the intelligibility for the Chinese TTS system. Although many research work have been on this research direction, the precision of the prosodic word prediction is still not satisfying. In this paper, Conditional random fields is introduced to model the prosodic predicting process. In this model, more efficient...
The prosodic phrasing is a classic problem in nature language process, which is not only useful for text-to-speech(TTS), but for speech recognition, statistic machine learning etc.. This paper introduces and discusses the source-channel model for Chinese prosodic phrasing. Based on the basic idea, the hidden Markov model (HMM) and the improved source-channel model are both used to describe the phrasing...
The Query-by-Humming (QBH) system allows users to retrieve songs by singing/humming. In this paper we propose a phrase-level piecewise linear scaling algorithm for melody match. Musical phrase boundaries are predicted for the query to split it to phrases. The boundaries of melody fragment corresponding to each phrase are allowed for adjusting in a limited scope. The algorithm employs Dynamic Programming...
To achieve a good balance between matching accuracy and computation efficiency is a key challenge for query-by-humming (QBH) system. In this paper, we propose an approach of n-gram based fast match. Our n-gram method uses a robust statistical note transcription as well as error compensation method based on the analysis of frequent transcription errors. The effectiveness of our approach has been evaluated...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.