Dependency structure analysis as combinatorial optimization
From MaRDI portal
Recommendations
- Computational complexity of probabilistic disambiguation
- An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
- Dependency structure grammars
- On efficient parallel computations for some dynamic programming problems
- Approximating dependency grammars through intersection of regular languages
Cited in
(2)
This page was built for publication: Dependency structure analysis as combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328543)