Learning deterministic regular grammars from stochastic samples in polynomial time

被引：71

作者：

Carrasco, RC ^{[1
]}

Oncina, J ^{[1
]}

机构：

[1] Univ Alicante, Dept Lenguajes & Sistemas Informat, Alicante 03071, Spain

来源：

RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | 1999年 / 33卷 / 01期

关键词：

D O I：

10.1051/ita:1999102

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, the identification of stochastic regular languages is addressed. For this purpose, we propose a class of algorithms which allow for the identification of the structure of the minimal stochastic automaton generating the language. It is shown that the time needed grows only linearly with the size of the sample set and a measure of the complexity of the task is provided. Experimentally, our implementation proves very fast for application purposes.

引用

页码：1 / 19

页数：19

共 21 条

[1]

[Anonymous], 1988, YALEUDCSRR614

[2]

Anthony Martin., 1992, COMPUTATIONAL LEARNI

[3]

CARRASCO RC, 1994, LECT NOTES ARTIFICIA, V862

[4]

CASTANO MA, 1993, LECT NOTES COMPUTER, V686, P210

[5]

Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X

[6]

Feller William, 1950, An Introduction to Probability Theory and its Applications I

[7]

Fu K. S., 1982, SYNTACTIC PATTERN RE

[8] LEARNING AND EXTRACTING FINITE STATE AUTOMATA WITH 2ND-ORDER RECURRENT NEURAL NETWORKS [J].

GILES, CL ;

MILLER, CB ;

CHEN, D ;

CHEN, HH ;

SUN, GZ ;

LEE, YC .

NEURAL COMPUTATION, 1992, 4 (03) :393-405

[9] LANGUAGE IDENTIFICATION IN LIMIT [J].

GOLD, EM .

INFORMATION AND CONTROL, 1967, 10 (05) :447-&

[10] PROBABILITY-INEQUALITIES FOR SUMS OF BOUNDED RANDOM-VARIABLES [J].

HOEFFDING, W .

JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1963, 58 (301) :13-+

← 1 2 3 →