|
Parsing with Latent Variable Grammars| old_uid | 9740 |
|---|
| title | Parsing with Latent Variable Grammars |
|---|
| start_date | 2011/03/04 |
|---|
| schedule | 11h-13h |
|---|
| online | no |
|---|
| location_info | plateau E, 3ème étage, salle 3E91 |
|---|
| summary | Treebank parsing can be seen as the search for an optimally refined grammar consistent with a coarse training treebank. We describe a method in which a minimal grammar is augmented with latent variables and hierarchically refined using the EM algorithm. The resulting grammars are highly accurate, but vary widely in their underlying representations, depending on their EM initialization point. We use this to our advantage, combining multiple automatically learned grammars into an unweighted product model, without any learning or tuning of combination weights. Despite its simplicity, the the resulting product model gives significantly improved performance over the state-of-the-art individual grammars, and surpasses even discriminative parsing systems on a variety of languages and domains. |
|---|
| responsibles | Crabbé |
|---|
| |
|