Abstract | ||
---|---|---|
We present a method for the computation of prefix probabilities for synchronous context-free grammars. Our framework is fairly general and relies on the combination of a simple, novel grammar transformation and standard techniques to bring grammars into normal forms. |
Year | Venue | Keywords |
---|---|---|
2011 | ACL | prefix probability,standard technique,probabilistic synchronous context-free grammar,synchronous context-free grammar,normal form,novel grammar transformation,context free grammar |
Field | DocType | Volume |
Context-sensitive grammar,Context-free grammar,Computer science,Indexed grammar,Theoretical computer science,Synchronous context-free grammar,Artificial intelligence,Natural language processing,Prefix grammar,Tree-adjoining grammar,L-attributed grammar,Phrase structure grammar,Algorithm | Conference | P11-1 |
Citations | PageRank | References |
3 | 0.41 | 17 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mark-jan Nederhof | 1 | 387 | 53.30 |
Giorgio Satta | 2 | 902 | 90.85 |