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 条

[21] Learning reversible languages with terminal distinguishability
Sempere, Jose M.
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2006, 4201 : 354 - 355
[22] Learning regular languages from simple positive examples
Denis, F
MACHINE LEARNING, 2001, 44 (1-2) : 37 - 66
[23] Efficient learning of multiple context-free languages with multidimensional substitutability from positive data
Yoshinaka, Ryo
THEORETICAL COMPUTER SCIENCE, 2011, 412 (19) : 1821 - 1831
[24] INDUCTIVE INFERENCE OF FORMAL LANGUAGES FROM POSITIVE DATA
ANGLUIN, D
INFORMATION AND CONTROL, 1980, 45 (02): : 117 - 135
[25] INDUCTIVE INFERABILITY FOR FORMAL LANGUAGES FROM POSITIVE DATA
SATO, M
UMAYAHARA, K
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1992, E75D (04) : 415 - 419
[26] Learning from positive data
Muggleton, S
INDUCTIVE LOGIC PROGRAMMING, 1997, 1314 : 358 - 376
[27] From reversible programming languages to reversible metalanguages
Gluck, Robert
Kaarsgaard, Robin
Yokoyama, Tetsuo
THEORETICAL COMPUTER SCIENCE, 2022, 920 : 46 - 63
[28] Learning tree languages from positive examples and membership queries
Besombes, J
Marion, JY
ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2004, 3244 : 440 - 453
[29] Learning tree languages from positive examples and membership queries
Besombes, Jerome
Marion, Jean-Yves
THEORETICAL COMPUTER SCIENCE, 2007, 382 (03) : 183 - 197
[30] Learning deterministic even linear languages from positive examples
Koshiba, T
Makinen, E
Takada, Y
THEORETICAL COMPUTER SCIENCE, 1997, 185 (01) : 63 - 79

← 1 2 3 4 5 →