Categorial grammars determined from linguistic data by unification

DOI10.1007/BF00370157zbMath0718.03020OpenAlexW2012920920MaRDI QIDQ2639050

Gerald Penn, Wojciech Buszkowski

Publication date: 1990

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00370157

zbMATH Keywords

unificationalgorithm for determining a categorial grammar from linguistic dataoptimal unifier

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50)

Related Items (15)

\(k\)-valued non-associative Lambek grammars are learnable from generalized functor-argument structures ⋮ On learnability of restricted classes of categorial grammars ⋮ Algebraic structures in categorial grammar ⋮ CCGbank: A Corpus of CCG Derivations and Dependency Structures Extracted from the Penn Treebank ⋮ Learning categorial grammar by unification with negative constraints ⋮ Learning discrete categorial grammars from structures ⋮ Grammar induction by unification of type-logical lexicons ⋮ Learnability of pregroup grammars ⋮ Good Types Are Useful for Learning ⋮ Learning Lambek Grammars from Proof Frames ⋮ Head or tail? de morgan on the bounds of traditional logic ⋮ Learnability of type-logical grammars ⋮ k-Valued Non-Associative Lambek Grammars are Learnable from Function-Argument Structures ⋮ On families of categorial grammars of bounded value, their learnability and related complexity questions ⋮ Semantic bootstrapping of type-logical grammar

Cites Work

• Essays in logical semantics
• The Mathematics of Sentence Structure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Categorial grammars determined from linguistic data by unification