Learning Analysis by Reduction from Positive Data Using Reversible Languages

被引：0
|
作者：
Hoffmann, Petr [1 ]
机构：
[1] Charles Univ Prague, Fac Math & Phys, Dept Software & Comp Sci Educ, Prague 11800 1, Czech Republic
来源：
SEVENTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS, PROCEEDINGS | 2008年
关键词：
D O I：
10.1109/ICMLA.2008.105
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The analysis by reduction [6, 7, 11] is a method for checking correctness of a sentence from a natural language. To model the analysis by reduction so-called restarting automata can be used. We propose a method for learning a special kind of restarting automata called single zero-reversible restarting automata (S-ZR-RRWW-automata). Interesting learning results achieved by using our implementation of the method are given. In addition the power of the model is investigated.
引用
收藏
页码：141 / 146
页数：6
相关论文
共 50 条
  • [1] Learning analysis by reduction from positive data
    Mraz, Frantisek
    Otto, Friedrich
    Platek, Martin
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2006, 4201 : 125 - 136
  • [2] Learning languages from positive data and negative counterexamples
    Jain, Sanjay
    Kinber, Efim
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2008, 74 (04) : 431 - 456
  • [3] Learning languages from positive data and negative counterexamples
    Jain, S
    Kinber, E
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2004, 3244 : 54 - 68
  • [4] Learning languages from positive data and a finite number of queries
    Jain, S
    Kinber, E
    INFORMATION AND COMPUTATION, 2006, 204 (01) : 123 - 175
  • [5] Locality, reversibility, and beyond: Learning languages from positive data
    Head, T
    Kobayashi, S
    Yokomori, T
    ALGORITHMIC LEARNING THEORY, 1998, 1501 : 191 - 204
  • [6] Learning languages from positive data and a finite number of queries
    Jain, S
    Kinber, E
    FSTTCS 2004: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2004, 3328 : 360 - 371
  • [7] Learning languages from positive data and a limited number of short counterexamples
    Jain, Sanjay
    Kinber, Efim
    THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 190 - 218
  • [8] On learning languages from positive data and a limited number of short counterexamples
    Jain, Sanjay
    Kinber, Efim
    LEARNING THEORY, PROCEEDINGS, 2006, 4005 : 259 - 273
  • [9] Learning locally testable even linear languages from positive data
    Sempere, JM
    García, P
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2002, 2484 : 225 - 236
  • [10] Learning indexed families of recursive languages from positive data: A survey
    Lange, Steffen
    Zeugmann, Thomas
    Zilles, Sandra
    THEORETICAL COMPUTER SCIENCE, 2008, 397 (1-3) : 194 - 232
12345