Abstract
We present a novel method for the computation of prefix probabilities for linear
context-free rewriting systems. Our approach streamlines previous procedures to
compute prefix probabilities for context-free grammars, synchronous context-free grammars and tree adjoining grammars. In addition, the methodology is general enough to be used for a wider range of problems involving, for example, several prefixes.
context-free rewriting systems. Our approach streamlines previous procedures to
compute prefix probabilities for context-free grammars, synchronous context-free grammars and tree adjoining grammars. In addition, the methodology is general enough to be used for a wider range of problems involving, for example, several prefixes.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011) |
| Place of Publication | Stroudsburg, PA |
| Publisher | Association for Computational Linguistics |
| Pages | 151–162 |
| Number of pages | 12 |
| ISBN (Print) | 978-1-932432-04-6 |
| Publication status | Published - 5 Oct 2011 |
| Event | 12th International Conference on Parsing Technologies - Dublin, Ireland Duration: 5 Oct 2010 → 7 Oct 2010 |
Conference
| Conference | 12th International Conference on Parsing Technologies |
|---|---|
| Country/Territory | Ireland |
| City | Dublin |
| Period | 5/10/10 → 7/10/10 |
Keywords
- Parsing algorithms
- Natural language processing