DE eng

Search in the Catalogues and Directories

Hits 1 – 8 of 8

1
Computation of infix probabilities for probabilistic context-free grammars
Satta, Giorgio; Nederhof, Mark Jan. - : Association for Computational Linguistics, 2012
BASE
Show details
2
Splittability of bilexical context-free grammars is undecidable
BASE
Show details
3
Prefix probabilities for linear context-free rewriting systems
Nederhof, Mark Jan; Satta, Giorgio. - : Association for Computational Linguistics, 2012
BASE
Show details
4
Computing Partition Functions of PCFGs
In: Research on language and computation. - London : King's College 7 (2009) 2, 233
OLC Linguistik
Show details
5
Computing partition functions of PCFGs
In: Research on language and computation. - London : King's College 6 (2008) 2, 139-162
BLLDB
OLC Linguistik
Show details
6
The language intersection problem for non-recursive context-free grammars
In: Information and computation. - Amsterdam : Elsevier 192 (2004) 2, 172-184
BLLDB
Show details
7
Partially ordered multiset context-free grammars and ID/LP parsing
Shieber, Stuart; Nederhof, Mark-Jan; Satta, Giorgio. - : Association for Computational Linguistics, 2003
BASE
Show details
8
A Variant of Earley Parsing ...
BASE
Show details

Catalogues
0
0
2
0
0
0
0
Bibliographies
2
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
5
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern