Abstract categorial parsing as linear logic programming
From MaRDI portal
Recommendations
- Cyclic multiplicative proof nets of linear logic with an application to language parsing
- A dynamic programming approach to categorical deduction
- A linear logic treatment of phrase structure grammars for unbounded dependencies
- Cyclic multiplicative-additive proof nets of linear logic with an application to language parsing
- Categorial grammar and type theory
Cited in
(7)- Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming
- A Datalog recognizer for almost affine -CFGs
- A linear logic treatment of phrase structure grammars for unbounded dependencies
- A dynamic programming approach to categorical deduction
- Deductive parsing of visual languages
- Count-invariance including exponentials
- On the membership problem for non-linear abstract categorial grammars
This page was built for publication: Abstract categorial parsing as linear logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599194)