Grapheme-to-phoneme (g2p) conversion, used to estimate the pronunciations of out-of-vocabulary (OOV) words, is a highly important part of recognition systems, as well as text-to-speech systems. The current state-of-the-art approach in g2p conversion is structured learning based on the Margin Infused Relaxed Algorithm (MIRA), which is an online discriminative training method for multiclass class...

A nonconvex optimal control problem is considered, for systems governed by a parabolic partial differential equation, nonlinear in the state and control variables, with control and state constraints. Since this problem may have no classical solutions, it is reformulated in the relaxed form. The relaxed problem is discretized by using a finite element method in space and an implicit theta-scheme...

In this paper, by introducing a class of relaxed filtered Krylov subspaces, we propose the subspace method for computing eigenvalues with largest real parts and corresponding eigenvectors non-symmetric matrices. As by-products, generalizations Chebyshev–Davidson solving eigenvalue problems are also presented. We give convergence analysis complex Chebyshev polynomial, which plays significant rol...

The hm admissible heuristics for (sequential and temporal) regression planning are defined by a parameterized relaxation of the optimal cost function in the regression search space, where the parameter m offers a trade-off between the accuracy and computational cost of the heuristic. Existing methods for computing the hm heuristic require time exponential in m, limiting them to small values (m ...