Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1093/logcom/exs081 | J. Log. Comput. |
Keywords | DocType | Volume |
context-free grammar,prefix probability,tree adjoining grammar,novel method,previous procedure,synchronous context-free grammar,wider range,linear context-free,natural language processing | Journal | 24 |
Issue | ISSN | Citations |
2 | 0955-792X | 1 |
PageRank | References | Authors |
0.37 | 23 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark-jan Nederhof | 1 | 387 | 53.30 |
| Giorgio Satta | 2 | 902 | 90.85 |