Learnable classes of categorial grammars
著者
書誌事項
Learnable classes of categorial grammars
（Studies in logic, language and information）
CSLI Publications : FoLLI, c1998
- : pbk.
大学図書館所蔵 件 / 全25件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Abstract of thesis (doctoral)--Stanford University, 1994
Includes bibliographical references (p. 169-174) and indexes
内容説明・目次
内容説明
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.
目次
- 1. Introduction
- 2. Learnability theorem
- 3. A theorem of finite elasticity
- 4. Classical categorial grammar
- 5. Basic theory of rigid grammars
- 6. Learning from structures I: rigid, k-valued, and least-valued grammar
- 7. Learning from structures II: Subclasses of the optimal grammars
- 8. Learning from strings
- 9. Variations
- 10. Conclusions
- Appendix.
「Nielsen BookData」 より
