About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICASSP 1996
Conference paper
Fast stochastic parser for determining phrase boundaries for text-to-speech synthesis
Abstract
A stochastic parser is described which creates a phrase structure for a tagged sentence on the basis of statistical information inferred from a manually-bracketed training corpus. The information employed consists of measured probabilities for tag unigrams, symbol bigrams, bracket enclosures, bracket opening and closing, and length distribution. For experimental purposes a trees-search algorithm is used to find the highest-scoring bracketing, and a tree metric is used to measure the accuracy of the results for a test corpus. Finally, a fast algorithm for implementation is based on a finite-state approximation to the tree-search algorithm. Using these procedures, a gross level of syntactic structure is found quickly, with the main aim being that of pause insertion in real-time text-to-speech systems.