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 k-valued grammars, for k = 1,2,3, ..., is shown to be learnable both from structures and from strings, while the class of least-valued grammars and the class of least-cardinality 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 functor-argument structures.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 7,68 expédition depuis Etats-Unis vers France
Destinations, frais et délaisVendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 200. N° de réf. du vendeur 26271701
Quantité disponible : 1 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. pp. 200. N° de réf. du vendeur 18271711
Quantité disponible : 1 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. 200. N° de réf. du vendeur 7576202
Quantité disponible : 1 disponible(s)