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 条
  • [31] Developments from enquiries into the learnability of the pattern languages from positive data
    Ng, Yen Kaow
    Shinohara, Takeshi
    THEORETICAL COMPUTER SCIENCE, 2008, 397 (1-3) : 150 - 165
  • [32] Inferring uniquely terminating regular languages from positive data
    Makinen, E
    INFORMATION PROCESSING LETTERS, 1997, 62 (02) : 57 - 60
  • [33] On inferring subclasses of internal contextual languages from positive data
    Emerald, JD
    Subramanian, KG
    Thomas, DG
    IMAGE ANALYSIS IN MATERIALS AND LIFE SCIENCES, 2001, : 55 - 60
  • [34] Incremental learning from positive data
    Lange, S
    Zeugmann, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 53 (01) : 88 - 103
  • [35] Negative data in learning languages
    Jain, Sanjay
    Kinber, Efim
    MATHEMATICAL LOGIC IN ASIA, 2006, : 90 - +
  • [36] Some classes of regular languages identifiable in the limit from positive data
    Denis, F
    Lemay, A
    Terlutte, A
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLIICATIONS, 2002, 2484 : 63 - 76
  • [37] Inductive inference of unbounded unions of pattern languages from positive data
    Shinohara, T
    Arimura, H
    THEORETICAL COMPUTER SCIENCE, 2000, 241 (1-2) : 191 - 209
  • [38] Inferring pure context-free languages from positive data
    Koshiba, Takeshi
    Makinen, Erkki
    Takada, Yuji
    Acta Cybernetica, 2000, 14 (03): : 469 - 477
  • [39] Inductive inference of unbounded unions of pattern languages from positive data
    Lect Notes Artif Intell, (256):
  • [40] Data Structures and Dynamic Memory Management in Reversible Languages
    Cservenka, Martin Holm
    Gluck, Robert
    Haulund, Tue
    Mogensen, Torben Aegidius
    REVERSIBLE COMPUTATION, RC 2018, 2018, 11106 : 269 - 285
12345