Learning deterministic DEC grammars is learning rational numbers

被引：0
|
作者：
Adriaans, Pieter [1 ]
机构：
[1] Univ Amsterdam, Dept Comp Sci, NL-1098 VA Amsterdam, Netherlands
来源：
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS | 2006年 / 4201卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Below I show that the class of strings that can be learned by a deterministic DEC grammar is exactly the class of rational numbers between 0 and 1. I call this the class of semi-periodic or rational strings. Dynamically Expanding Context (Dec) grammars were introduced by Kohonen in order to model speech signals ([8]). They can be learned in quadratic time in the size of the grammar. They have been used successfully in the automatic generation and analysis of music ([7], [5], [6]).
引用
收藏
页码：320 / 326
页数：7
相关论文
共 50 条
  • [31] Learning Optimality-Theoretic grammars
    Tesar, BB
    Smolensky, P
    LINGUA, 1998, 106 (1-4) : 161 - 196
  • [32] Design with shape grammars and reinforcement learning
    Ruiz-Montiel, Manuela
    Boned, Javier
    Gavilanes, Juan
    Jimenez, Eduardo
    Mandow, Lawrence
    Perez-de-la-Cruz, Jose-Luis
    ADVANCED ENGINEERING INFORMATICS, 2013, 27 (02) : 230 - 245
  • [33] Learning OT Grammars of Syllable Structure
    Wayment, Adam T.
    PROCEEDINGS OF THE TWENTY-SIXTH ANNUAL CONFERENCE OF THE COGNITIVE SCIENCE SOCIETY, 2004, : 1653 - 1653
  • [34] Covariance in Unsupervised Learning of Probabilistic Grammars
    Cohen, Shay B.
    Smith, Noah A.
    JOURNAL OF MACHINE LEARNING RESEARCH, 2010, 11 : 3017 - 3051
  • [35] Learning grammars with a modified classifier system
    Cyre, W
    CEC'02: PROCEEDINGS OF THE 2002 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2002, : 1366 - 1371
  • [36] Connectionist learning of regular graph grammars
    Fletcher, P
    CONNECTION SCIENCE, 2001, 13 (02) : 127 - 188
  • [37] Distributional Learning of Abstract Categorial Grammars
    Yoshinaka, Ryo
    Kanazawa, Makoto
    LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, LACL 2011, 2011, 6736 : 251 - 266
  • [38] Implicit learning of two artificial grammars
    C. Guillemin
    B. Tillmann
    Cognitive Processing, 2021, 22 : 141 - 150
  • [39] LEARNING OF STRUCTURALLY UNAMBIGUOUS PROBABILISTIC GRAMMARS
    Fisman, Dana
    Nitay, Dolav
    Ziv-ukelson, Michal
    LOGICAL METHODS IN COMPUTER SCIENCE, 2022, 19 (01)
  • [40] Uninterpretable features in learning and alternative grammars?
    Yanovich, Igor
    THEORETICAL LINGUISTICS, 2019, 45 (3-4) : 283 - 286
12345