Name
Abstract | ||
|---|---|---|
We evaluated probabilistic lexicalized tree-insertion grammars (PLTIGs) on a classification task relevant for automatic speech recognition. The baseline is a family of n-gram models tuned with Witten-Bell smoothing. The language models are trained on unannotated corpora, consisting of 10,000 to 50,000 sentences collected from the English section of Wikipedia. For the evaluation, an additional 150 random sentences were selected from the same source, and for each of these, approximately 3,200 variations were generated. Each variant sentence was obtained by replacing an arbitrary word by a similar word, chosen to be at most 2 character edits from the original. The evaluation task consisted of identifying the original sentence among the automatically constructed (and typically inferior) alternatives. In the experiments, the n-gram models outperformed the PLTIG model on the smaller data set, but as the size of data grew, the PLTIG model gave comparable results. While PLTIGs are more demanding to train, they have the advantage that they assign a parse structure to their input sentences. This is valuable for continued algorithmic processing, for example, for summarization or sentiment analysis. |
Year | Venue | Keywords |
|---|---|---|
2017 | JOURNAL OF UNIVERSAL COMPUTER SCIENCE | language modeling,automatic speech recognition,probabilistic lexicalized tree-insertion grammars |
Field | DocType | Volume |
Rule-based machine translation,Computer science,Speech recognition,Probabilistic logic,Language model | Journal | 23 |
Issue | ISSN | Citations |
11 | 0948-695X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johanna Björklund | 1 | 5 | 6.23 |
| Loek G. Cleophas | 2 | 45 | 11.31 |
| My Karlsson | 3 | 0 | 0.34 |