A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus

DOI10.1007/978-3-642-14322-9_4zbMath1286.68229OpenAlexW1507944685MaRDI QIDQ3584995

Timothy A. D. Fowler

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14322-9_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Natural language processing (68T50) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

This page was built for publication: A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus