Rational Recurrences for Empirical Natural Language Processing

Explore rational recurrences in empirical natural language processing through this 56-minute lecture by Noah Smith from the University of Washington. Delve into the family of recurrent neural networks that follow specific rules for calculating hidden states, corresponding to parallelized weighted finite-state pattern matching. Discover how this approach aims to create more understandable deep learning models for NLP without sacrificing accuracy. Learn about the weighted finite-state view and its applications in deriving new models. Examine various experiments, interpretability aspects, and the benefits of sparse Lasso in this context. Gain insights into the historical background, soft patterns, Simple Recurrent Units, and the concept of "unigram" and "bigram" models in rational recurrences. Understand the potential of this approach for creating more explainable yet powerful NLP models.