




Learnable Classes of Categorial Grammars
CSLI, 1998 Paper: 9781575860961  Cloth: 9781575860978  eISBN: 9781575869964 Library of Congress Classification P161.K28 1998 Dewey Decimal Classification 415
ABOUT THIS BOOK  TOC
ABOUT THIS BOOK
This book investigates the learnability of various classes of classical categorial grammars within the Gold paradigm of identification in the limit from positive data. Learning from structure and learning from flat strings are considered. The class of kvalued grammars, for k = 1,2,3,..., is shown to be learnable both from structures and from strings, while the class of leastvalued grammars and the class of leastcardinality grammars are shown to be learnable from structures. In proving these learnable results, crucial use is made of a theorem on the concept known as finite elasticity. The learning algorithms used in this work build on Buszkowski and Penn's algorithm for finding categorial grammars from input consisting of functorargument structures. See other books on: Categorial grammar  Grammar & Punctuation  Kanazawa, Makoto  Learning ability  Mathematical linguistics See other titles from CSLI 
Nearby on shelf for Philology. Linguistics / Language. Linguistic theory. Comparative grammar:
 