Basic simple type theory
Learnable classes of categorial grammars
Learnable classes of categorial grammars
Learning language in logic
Formulas-as-types for a Hierarchy of Sublogics of Intuitionistic Propositional Logic
Proceedings of the International Workshop on Nonclassical Logics and Information Processing
Residuation, Structural Rules and Context Freeness
Journal of Logic, Language and Information
Rough Sets and Learning by Unification
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Grammar Induction by Unification of Type-logical Lexicons
Journal of Logic, Language and Information
Rough Sets and Learning by Unification
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
| Hi-index | 0.01 |
A two-stage procedure is described which induces type-logical grammar lexicons from sentences annotated with skeletal terms of the simply typed lambda calculus. First, a generalized formulae-as-types correspondence is exploited to obtain all the type-logical proofs of the sample sentences from their lambda terms. The resulting lexicons are then optimally unified. The first stage constitutes the semantic bootstrapping (Pinker, Language Learnability and Language Development, Harvard University Press, 1984), while the unification procedure of Buszkowski and Penn represents a first attempt at structure-dependent distributional learning of the syntactic and semantic categories. This effort extends earlier induction procedures (Buszkowski and Penn, 1990, Studia Logica 49, 431--454; Kanazawa, 1998, CSLI Publications and the European Association for Logic, Language and Information) for classical categorial grammar to at first the non-associative Lambek calculus, and then to a large class of type logics enriched by modal operators and structural rules.