1 |
Calculating the optimal step of arc-eager parsing for non-projective trees
|
|
|
|
BASE
|
|
Show details
|
|
2 |
Calculating the optimal step in shift-reduce dependency parsing : from cubic to linear time
|
|
|
|
BASE
|
|
Show details
|
|
5 |
Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Transition-based dependency parsing as latent-variable constituent parsing
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Count-based state merging for probabilistic regular tree grammars
|
|
|
|
BASE
|
|
Show details
|
|
11 |
Computation of infix probabilities for probabilistic context-free grammars
|
|
|
|
BASE
|
|
Show details
|
|
12 |
Splittability of bilexical context-free grammars is undecidable
|
|
|
|
BASE
|
|
Show details
|
|
13 |
Prefix probabilities for linear context-free rewriting systems
|
|
|
|
BASE
|
|
Show details
|
|
15 |
Parsing of partially bracketed structures for parse selection
|
|
|
|
BASE
|
|
Show details
|
|
16 |
Automatic creation of interlinear text for philological purposes
|
|
|
|
BASE
|
|
Show details
|
|
|
|