On the complexity of consistent identification of some classes of structure languages

被引：0
|
作者：
Florêncio, CC [1 ]
机构：
[1] Univ Utrecht, UiL OTS, NL-3512 JK Utrecht, Netherlands
来源：
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS | 2000年 / 1891卷
关键词：
identification in the limit; inductive inference; consistent learning; complexity of learning; classical categorial grammar;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In [5,7] 'discovery procedures' for CCGs were defined that accept a sequence of structures as input and yield a set of grammars. In [11] it was shown that some of the classes based on these procedures are learnable. The complexity of learning them was still left open. In this paper it is shown that learning some of these classes is NP-hard under certain restrictions.
引用
收藏
页码：89 / 102
页数：14
相关论文
共 50 条
12345