Shared context probabilistic transducers

Yoshua Bengio, Samy Berigio, Jean Frangois Isabelle, Yorarn Singer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Recently, a model for supervised learning of probabilistic transducers represented by suffix trees was introduced. However, this algorithm tends to build very large trees, requiring very large amounts of computer memory. In this paper, we propose a new, more compact, transducer model in which one shares the parameters of distributions associated to contexts yielding similar conditional output distributions. We illustrate the advantages of the proposed algorithm with comparative experiments on inducing a noun phrase recognizer.

Original languageEnglish (US)
Title of host publicationAdvances in Neural Information Processing Systems 10 - Proceedings of the 1997 Conference, NIPS 1997
PublisherNeural information processing systems foundation
Pages409-415
Number of pages7
ISBN (Print)0262100762, 9780262100762
StatePublished - Jan 1 1998
Externally publishedYes
Event11th Annual Conference on Neural Information Processing Systems, NIPS 1997 - Denver, CO, United States
Duration: Dec 1 1997Dec 6 1997

Publication series

NameAdvances in Neural Information Processing Systems
ISSN (Print)1049-5258

Other

Other11th Annual Conference on Neural Information Processing Systems, NIPS 1997
CountryUnited States
CityDenver, CO
Period12/1/9712/6/97

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems
  • Signal Processing

Fingerprint Dive into the research topics of 'Shared context probabilistic transducers'. Together they form a unique fingerprint.

Cite this