Recurrent Neural Networks as Weighted Language Recognizers

On non-computable functions

Tibor Radó. 1962 · 1962

Earlier work this paper cites.

The unsolvability of the equivalence problem for ∧ \wedge -free nondeterministic generalized machines

T. V. Griffiths. 1968 · 1968

Earlier work this paper cites.

Applying probability measures to abstract languages

T. L. Booth and R. A. Thompson. 1973 · 1973

Earlier work this paper cites.

The design and analysis of computer algorithms

Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974 · 1974

Earlier work this paper cites.

The Harpy Speech Recognition System

Bruce T. Lowerre. 1976 · 1976

Earlier work this paper cites.

A generalization of Dijkstra’s algorithm

Donald E. Knuth. 1977 · 1977

Earlier work this paper cites.

Minimal NFA problems are hard

Tao Jiang and B. Ravikumar. 1993 · 1993

Earlier work this paper cites.

On the computational power of neural nets

Hava T. Siegelmann and Eduardo D. Sontag. 1995 · 1995

Earlier work this paper cites.

Computational complexity of probabilistic disambiguation by means of tree-grammars

Khalil Simaan. 1996 · 1996

Cited alongside, same era.

Long short-term memory

Sepp Hochreiter and Jürgen Schmidhuber. 1997 · 1997

Cited alongside, same era.

The equivalence problem for deterministic pushdown automata is decidable

Géraud Sénizergues. 1997 · 1997

Cited alongside, same era.

Computational complexity of problems on probabilistic grammars and transducers

Francisco Casacuberta and Colin de la Higuera. 2000 · 2000

Cited alongside, same era.

Estimation of consistent probabilistic context-free grammars

Mark-Jan Nederhof and Giorgio Satta. 2006 · 2006

Cited alongside, same era.

OpenFst: A General and Efficient Weighted Finite-State Transducer Library

Cyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, and Mehryar Mohri. 2007 · 2007

Computing the most probable string with a probabilistic finite state machine

Colin de la Higuera and José Oncina. 2013 · 2013

Later among the works it cites.

Handbook of Weighted Automata

Manfred Droste, Werner Kuich, and Heiko Vogler. 2013 · 2013

Later among the works it cites.

Neural machine translation by jointly learning to align and translate

D. Bahdanau, K. Cho, and Y. Bengio. 2014 · 2014

Later among the works it cites.

Language equivalence of probabilistic pushdown automata

Vojtěch Forejt, Petr Jančar, Stefan Kiefer, and James Worrell. 2014 · 2014

Later among the works it cites.

Sequence to sequence learning with neural networks

I. Sutskever, O. Vinyals, and Q. V. Le. 2014 · 2014

Later among the works it cites.

Exploring the limits of language modeling

Original

Rafal Jozefowicz, Oriol Vinyals, Mike Schuster, Noam Shazeer, and Yonghui Wu. 2016 · 2016