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

共 50 条

[21] Accurate computation of the relative entropy between stochastic regular grammars
Carrasco, RC
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1997, 31 (05): : 437 - 444
[22] A Deterministic Polynomial-Time Protocol for Synchronizing From Deletions
Yazdi, S. M. Sadegh Tabatabaei
Dolecek, Lara
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (01) : 397 - 409
[23] Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars
Etessami, Kousha
Stewart, Alistair
Yannakakis, Mihalis
STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 579 - 588
[24] Separation of deterministic and stochastic components from time series
Petelczyc, Monika, 1600, Jagiellonian University (07):
[25] Polynomial time learning of simple deterministic languages via queries and a representative sample
Tajima, Y
Tomita, E
Wakatsuki, M
Terada, M
THEORETICAL COMPUTER SCIENCE, 2004, 329 (1-3) : 203 - 221
[26] On sufficient conditions to identify in the limit classes of grammars from polynomial time and data
de la Higuera, C
Oncina, J
GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2002, 2484 : 134 - 148
[27] Polynomial-time identification of very simple grammars from positive data
Yokomori, T
THEORETICAL COMPUTER SCIENCE, 2003, 298 (01) : 179 - 206
[28] Explicit separation of relativised random polynomial time and relativised deterministic polynomial time
Zippel, Richard, 1600, (33):
[29] Lambek grammars with one division are decidable in polynomial time
Savateev, Yury
COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2008, 5010 : 273 - 282
[30] Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
Bex, Geert Jan
Gelade, Wouter
Neven, Frank
Vansummeren, Stijn
ACM TRANSACTIONS ON THE WEB, 2010, 4 (04)

← 1 2 3 4 5 →