Papers by Clemente Pasti
An L* Algorithm for Deterministic Weighted Regular Languages (2024.emnlp-main)
Copied to clipboard
| Challenge: | Angluin (1987) introduced the active learning scheme L , where the learner interacts with an oracle by asking it queries. |
| Approach: | They propose a weighted variant of Angluin's (1987) L* algorithm for learning finite state automatas from black-box models. |
| Outcome: | The proposed algorithm learns aminimal automaton for the target language. |
Prefix Parsing is Just Parsing (2026.acl-short)
Copied to clipboard
| Challenge: | Existing prefix parsers are typically tied to particular parsing algorithms. |
| Approach: | They propose a prefix grammar transformation that reduces prefix parsing to ordinary parsers . they propose enabling prediction of the next token by computing the next-token weight vector . |
| Outcome: | The proposed method reduces prefix parsing to ordinary parsers without modification . the transformed grammar is only a small factor larger than the input . |
On the Intersection of Context-Free and Regular Languages (2023.eacl-main)
Copied to clipboard
| Challenge: | We generalize the Bar-Hillel intersection construction so that the given WFSA may contain -arcs. |
| Approach: | They propose a construction that generalizes the Bar- Hillel in the case the desired automaton has -arcs and generalize the weighted extension so that the given WFSA may contain arcs. |
| Outcome: | The proposed construction can encode the structure of both the input automaton and grammar while retaining the asymptotic size of the original construction. |