Probabilistic Parsing Strategies
| dc.creator | Nederhof, Mark-Jan | |
| dc.creator | Satta, Giorgio | |
| dc.date | 2002-11-14 | |
| dc.date.accessioned | 2026-07-07T03:19:00Z | |
| dc.date.available | 2026-07-07T03:19:00Z | |
| dc.description | We present new results on the relation between purely symbolic context-free parsing strategies and their probabilistic counter-parts. Such parsing strategies are seen as constructions of push-down devices from grammars. We show that preservation of probability distribution is possible under two conditions, viz. the correct-prefix property and the property of strong predictiveness. These results generalize existing results in the literature that were obtained by considering parsing strategies in isolation. From our general results we also derive negative results on so-called generalized LR parsing. | |
| dc.description | 36 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/cs/0211017 | |
| dc.identifier | http://arxiv.org/abs/cs/0211017 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31344 | |
| dc.subject | Computation and Language | |
| dc.subject | F.4.3; I.2.7 | |
| dc.title | Probabilistic Parsing Strategies | |
| dc.type | text |