Identification in the limit of categorial grammars

DOI10.1007/BF00173697zbMath0855.03016OpenAlexW2061389333MaRDI QIDQ1923828

Makoto Kanazawa

Publication date: 13 October 1996

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

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

zbMATH Keywords

learning algorithmfinite elasticityinductive inferenceidentification in the limit from positive datalearnabilityclassical categorial grammarsfunctor-argument structures

Mathematics Subject Classification ID

Logic of natural languages (03B65) Memory and learning in psychology (91E40) Linguistics (91F20)

Related Items (6)

On learnability of restricted classes of categorial grammars ⋮ Algebraic structures in categorial grammar ⋮ Learning categorial grammar by unification with negative constraints ⋮ Learning Tree Languages ⋮ Learning Left-to-Right and Right-to-Left Iterative Languages ⋮ Identification of birfsa languages.

This page was built for publication: Identification in the limit of categorial grammars