ResearchTrend.AI
Distance and Equivalence between Finite State Machines and Recurrent Neural Networks: Computational results

Distance and Equivalence between Finite State Machines and Recurrent Neural Networks: Computational results

Reda Marzouk
C. D. L. Higuera
ArXiv (abs)PDFHTML

Papers citing "Distance and Equivalence between Finite State Machines and Recurrent Neural Networks: Computational results"

4 / 4 papers shown
Title
Extracting Weighted Automata for Approximate Minimization in Language Modelling
Extracting Weighted Automata for Approximate Minimization in Language Modelling
Clara Lacroce
Prakash Panangaden
Guillaume Rabusseau
71
7
0
05 Jun 2021
Formal Language Theory Meets Modern NLP
Formal Language Theory Meets Modern NLP
William Merrill
AI4CENAI
112
13
0
19 Feb 2021
Distillation of Weighted Automata from Recurrent Neural Networks using a Spectral Approach
Distillation of Weighted Automata from Recurrent Neural Networks using a Spectral Approach
Rémi Eyraud
Stéphane Ayache
51
16
0
28 Sep 2020
On Computability, Learnability and Extractability of Finite State Machines from Recurrent Neural Networks
On Computability, Learnability and Extractability of Finite State Machines from Recurrent Neural Networks
Reda Marzouk
38
2
0
10 Sep 2020

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.