Bartlett et al., ACL-HLT 2008. Automatic Syllabification with Structured SVMs for Letter-to-Phoneme Conversion

Citation

Susan Bartlett, Grzegorz Kondrak and Colin Cherry. 2008. Automatic syllabification with structured SVMs for letter-to-phoneme conversion. In Proceedings of ACL-08: HLT, 2008, pp. 568–576.

Online Version

Automatic syllabification with structured SVMs for letter-to-phoneme conversion.

Summary

This paper describes one of the first successful attempts at integrating automatic syllabification into a letter-to-phoneme conversion system using structured SVMs. The authors obtain substantial improvements in reducing automatic syllabification error rate (measured in WER) against the then state-of-the-art approach. The authors model the problem as an orthographic syllabification task as opposed to phonological syllabification. They treat it as a sequence tagging problem and define new tagging schemes. The method is applied to languages such as German and Dutch, in addition to English.

Method

Structured SVMs

Structured SVMs (Tsochantaridis et al., 2004) is a large-margin training method that is used for predicting structured outputs such as tag sequences. The method described in this paper uses structured SVMs that learn tag sequences from training data and perform structured output prediction by finding the highest scoring tag sequence using the Viterbi algorithm. Hence, the decoding problem in structured SVMs resembles that of an HMM.

Training structured SVMs is viewed as a multi-class classification problem. For a given training instance $x_{i}$, a correct tag sequence $y_{i}$ is drawn from a set of possible tag sequences $Y_{i}$. Each input sequence $x$ has a feature space representation $\Psi (x,y)$ to represent a candidate output sequence $y$.

The training process works in a manner that weights a correctly classified input sequence more than an incorrectly classified input sequence using a weight vector $w$. It tries to the maximize the margin between the correct and incorrect sequence. Mathematically, the relationship can be expressed as:

$\forall _{i}\forall _{y\in Y_{i,y\neq y_{i}}}\left[\Psi (x_{i},y_{i})\cdot w>\Psi (x_{i},y)\cdot w\right]$

The model then predicts the highest scoring sequence as follows,

${\underset {y\in Y_{i}}{\operatorname {argmax} }}\left[\Psi (x_{i},y)\cdot w\right]$

The search for the highest confidence score is performed by using the Viterbi algorithm. The set of negative or incorrect sequences in $Y_{i}$ is potentially exponential with respect to $x_{i}$. Hence, structured SVMs address this problem by limiting the search space for potential output sequences with the help of an iterative online learning approach. This approach is outlined as follows:

1. Find out the least scoring or most damaging incorrect sequence $y$ according to the current weight vector $w$.

2. Add $y$ to an iteratively increasing list of ${\bar {Y}}_{i}$ of incorrect sequences.

3. Update the weight vector $w$ according to the objective function using the partial ${\bar {Y}}_{i}$ sets in place of $Y_{i}$.

4. Go to next training instance and loop from 1 until convergence.