3 citations · 6 across the 5 of their papers we have counts for
5 papers
Simulating Weighted Automata over Sequences and Trees with Transformers
Michael Rizvi, Maude Lizaire, Clara Lacroce +1
Transformers are ubiquitous models in the natural language processing (NLP) community and have shown impressive empirical successes in the past few years. However, little is unders…
Optimal Approximate Minimization of One-Letter Weighted Finite Automata
Clara Lacroce, Borja Balle, Prakash Panangaden +1
In this paper, we study the approximate minimization problem of weighted finite automata (WFAs): to compute the best possible approximation of a WFA given a bound on the number of…
Towards an AAK Theory Approach to Approximate Minimization in the Multi-Letter Case
Clara Lacroce, Prakash Panangaden, Guillaume Rabusseau
We study the approximate minimization problem of weighted finite automata (WFAs): given a WFA, we want to compute its optimal approximation when restricted to a given size. We refo…
Extracting Weighted Automata for Approximate Minimization in Language Modelling
Clara Lacroce, Prakash Panangaden, Guillaume Rabusseau
In this paper we study the approximate minimization problem for language modelling. We assume we are given some language model as a black box. The objective is to obtain a weighted…
Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata
Borja Balle, Clara Lacroce, Prakash Panangaden +2
We address the approximate minimization problem for weighted finite automata (WFAs) with weights in , over a one-letter alphabet: to compute the best possible approxima…