Bayesian Inference of Regular Grammar and Markov Source Models

Kurt R. Smith; Michael I. Miller

Bayesian Inference of Regular Grammar and Markov Source Models

Kurt R. Smith
, Michael I. Miller

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper we develop a Bayes criterion which includes the Rissanen complexity, for inferring regular grammar models. We develop two methods for regular grammar Bayesian inference. The first method is based on treating the regular grammar as a 1-dimensional Markov source, and the second is based on the combinatoric characteristics of the regular grammar itself. We apply the resulting Bayes criteria to a particular example in order to show the efficiency of each method.

Original language	English (US)
Title of host publication	Advances in Neural Information Processing Systems 2, NIPS 1989
Editors	David S. Touretzky
Publisher	Neural information processing systems foundation
Pages	388-395
Number of pages	8
ISBN (Electronic)	1558601007, 9781558601000
State	Published - 1989
Externally published	Yes
Event	2nd Advances in Neural Information Processing Systems, NIPS 1989 - Denver, United States Duration: Nov 27 1989 → Nov 30 1989

Publication series

Name	Advances in Neural Information Processing Systems
Volume	2
ISSN (Print)	1049-5258

Conference

Conference	2nd Advances in Neural Information Processing Systems, NIPS 1989
Country/Territory	United States
City	Denver
Period	11/27/89 → 11/30/89

ASJC Scopus subject areas

Signal Processing
Information Systems
Computer Networks and Communications

Cite this

Bayesian Inference of Regular Grammar and Markov Source Models. / Smith, Kurt R.; Miller, Michael I.
Advances in Neural Information Processing Systems 2, NIPS 1989. ed. / David S. Touretzky. Neural information processing systems foundation, 1989. p. 388-395 (Advances in Neural Information Processing Systems; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Smith, KR & Miller, MI 1989, Bayesian Inference of Regular Grammar and Markov Source Models. in DS Touretzky (ed.), Advances in Neural Information Processing Systems 2, NIPS 1989. Advances in Neural Information Processing Systems, vol. 2, Neural information processing systems foundation, pp. 388-395, 2nd Advances in Neural Information Processing Systems, NIPS 1989, Denver, United States, 11/27/89.

@inproceedings{e711d0d533fa4bde8fdf8ec75500914e,

title = "Bayesian Inference of Regular Grammar and Markov Source Models",

abstract = "In this paper we develop a Bayes criterion which includes the Rissanen complexity, for inferring regular grammar models. We develop two methods for regular grammar Bayesian inference. The first method is based on treating the regular grammar as a 1-dimensional Markov source, and the second is based on the combinatoric characteristics of the regular grammar itself. We apply the resulting Bayes criteria to a particular example in order to show the efficiency of each method.",

author = "Smith, \{Kurt R.\} and Miller, \{Michael I.\}",

note = "Publisher Copyright: {\textcopyright} 1989 Neural information processing systems foundation. All rights reserved.; 2nd Advances in Neural Information Processing Systems, NIPS 1989 ; Conference date: 27-11-1989 Through 30-11-1989",

year = "1989",

language = "English (US)",

series = "Advances in Neural Information Processing Systems",

publisher = "Neural information processing systems foundation",

pages = "388--395",

editor = "Touretzky, \{David S.\}",

booktitle = "Advances in Neural Information Processing Systems 2, NIPS 1989",

}

TY - GEN

T1 - Bayesian Inference of Regular Grammar and Markov Source Models

AU - Smith, Kurt R.

AU - Miller, Michael I.

PY - 1989

Y1 - 1989

N2 - In this paper we develop a Bayes criterion which includes the Rissanen complexity, for inferring regular grammar models. We develop two methods for regular grammar Bayesian inference. The first method is based on treating the regular grammar as a 1-dimensional Markov source, and the second is based on the combinatoric characteristics of the regular grammar itself. We apply the resulting Bayes criteria to a particular example in order to show the efficiency of each method.

AB - In this paper we develop a Bayes criterion which includes the Rissanen complexity, for inferring regular grammar models. We develop two methods for regular grammar Bayesian inference. The first method is based on treating the regular grammar as a 1-dimensional Markov source, and the second is based on the combinatoric characteristics of the regular grammar itself. We apply the resulting Bayes criteria to a particular example in order to show the efficiency of each method.

UR - https://www.scopus.com/pages/publications/105021403786

UR - https://www.scopus.com/pages/publications/105021403786#tab=citedBy

M3 - Conference contribution

AN - SCOPUS:105021403786

T3 - Advances in Neural Information Processing Systems

SP - 388

EP - 395

BT - Advances in Neural Information Processing Systems 2, NIPS 1989

A2 - Touretzky, David S.

PB - Neural information processing systems foundation

T2 - 2nd Advances in Neural Information Processing Systems, NIPS 1989

Y2 - 27 November 1989 through 30 November 1989

ER -

Bayesian Inference of Regular Grammar and Markov Source Models

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this