Fetching the paper…
Reading the bibliography…
Language models (LMs) are often expected to generate strings in some formal language; for example, structured data, API calls, or code snippets.
Three models for the description of language
Noam Chomsky · 1956
Earlier work this paper cites.
Finite automata and their decision problems
M. O. Rabin and D. Scott · 1959
Earlier work this paper cites.
Regular expressions and state graphs for automata
R. McNaughton and H. Yamada · 1960
Earlier work this paper cites.
A new normal-form theorem for context-free phrase structure grammars
Sheila A. Greibach · 1965
Earlier work this paper cites.
On the translation of languages from left to right
Donald E. Knuth · 1965
Earlier work this paper cites.
Deterministic context free languages
Seymour Ginsburg and Sheila Greibach · 1966
Earlier work this paper cites.
Programming techniques: Regular expression search algorithm
Ken Thompson · 1968
Earlier work this paper cites.
An efficient context-free parsing algorithm
Jay Earley · 1970
Earlier work this paper cites.
Strict deterministic grammars
Michael A. Harrison and Ivan M. Havel · 1973
Earlier work this paper cites.
On the parsing of deterministic languages
Ivan M. Havel and Michael A. Harrison · 1974
Earlier work this paper cites.
Normal forms of deterministic grammars
Matthew M. Geller, Michael A. Harrison, and Ivan M. Havel · 1976
Earlier work this paper cites.
Greibach normal form transformation, revisited
Robert Koch and Norbert Blum · 1997
Earlier work this paper cites.
Introduction to automata theory, languages, and computation, 2nd edition
John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman · 2001
Earlier work this paper cites.
Finite-state transducers in language and speech processing
Mehryar Mohri · 2003
Earlier work this paper cites.
Weighted Finite-State Transducer Algorithms. An Overview , pp. 551–563
Mehryar Mohri · 2004
Earlier work this paper cites.
Neural models of text normalization for speech applications
Hao Zhang, Richard Sproat, Axel H. Ng, Felix Stahlberg, Xiaochang Peng, Kyle Gorman, and Brian Roark · 2004
Cited alongside, same era.
Representation of events in nerve nets and finite automata
Stephen Cole Kleene · 2008
Cited alongside, same era.
OpenFst: An open-source, weighted finite-state transducer library and its applications to speech and language
Michael Riley, Cyril Allauzen, and Martin Jansche · 2009
Cited alongside, same era.
Python 3 Reference Manual
Guido Van Rossum and Fred L. Drake · 2009
Cited alongside, same era.
A pushdown transducer extension for the openfst library
Cyril Allauzen and Michael Riley · 2012
Cited alongside, same era.
Foundations of json schema
Felipe Pezoa, Juan L. Reutter, Fernando Suarez, Martín Ugarte, and Domagoj Vrgoč · 2016
Cited alongside, same era.
Synchromesh: Reliable code generation from pre-trained language models
Gabriel Poesia, Alex Polozov, Vu Le, Ashish Tiwari, Gustavo Soares, Christopher Meek, and Sumit Gulwani · 2022
Later among the works it cites.
Grammar-constrained decoding for structured NLP tasks without finetuning
Saibo Geng, Martin Josifoski, Maxime Peyrard, and Robert West · 2023
Later among the works it cites.
Fast inference from transformers via speculative decoding
Yaniv Leviathan, Matan Kalman, and Yossi Matias · 2023
Later among the works it cites.
Sequential monte carlo steering of large language models using probabilistic programs, 2023
Alexander K. Lew, Tan Zhi-Xuan, Gabriel Grand, and Vikash K. Mansinghka · 2023
Later among the works it cites.
The art of prompt design: Prompt boundaries and token healing
Scott Lundberg · 2023
Later among the works it cites.
Guidance, 2023
Microsoft · 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Neural machine translation of rare words with subword units
Rico Sennrich, Barry Haddow, and Alexandra Birch · 2016
Cited alongside, same era.
Rnn approaches to text normalization: A challenge, 2017
Richard Sproat and Navdeep Jaitly · 2017
Cited alongside, same era.
Composing finite state transducers on GPUs
Arturo Argueta and David Chiang · 2018
Cited alongside, same era.
Taku Kudo and John Richardson · 2018
Cited alongside, same era.
A general-purpose algorithm for constrained sequential inference
Daniel Deutsch, Shyam Upadhyay, and Dan Roth · 2019
Cited alongside, same era.
Array programming with NumPy
Charles R. Harris, K. Jarrod Millman, Stéfan J. van der Walt, Ralf Gommers, Pauli Virtanen, David Cournapeau, Eric Wieser, Julian Taylor, Sebastian Berg, Nathaniel J. Smith, Robert Kern, Matti Picus, Stephan Hoyer, Marten H. van Kerkwijk, Matthew Brett, Allan Haldane, Jaime Fernández del Río, Mark Wiebe, Pearu Peterson, Pierre Gérard-Marchant, Kevin Sheppard, Tyler Reddy, Warren Weckesser, Hameer Abbasi, Christoph Gohlke, and Travis E. Oliphant · 2020
Cited alongside, same era.
Later among the works it cites.
Gpqa: A graduate-level google-proof q&a benchmark, 2023
David Rein, Betty Li Hou, Asa Cooper Stickland, Jackson Petty, Richard Yuanzhe Pang, Julien Dirani, Julian Michael, and Samuel R. Bowman · 2023
Later among the works it cites.
Efficient guided generation for llms
Brandon T Willard and Rémi Louf · 2023
Later among the works it cites.
React: Synergizing reasoning and acting in language models
Shunyu Yao, Jeffrey Zhao, Dian Yu, Nan Du, Izhak Shafran, Karthik R Narasimhan, and Yuan Cao · 2023
Later among the works it cites.
Constructing a bpe tokenization dfa, 2024
Martin Berglund, Willeke Martens, and Brink van der Merwe · 2024
Closest in time.
“we need structured output”: Towards user-centered constraints on large language model output
Michael Xieyang Liu, Frederick Liu, Alexander J. Fiannaca, Terry Koo, Lucas Dixon, Michael Terry, and Carrie J. Cai · 2024
Closest in time.
Gemma: Open models based on gemini research and technology, 2024
Gemma Team, Thomas Mesnard, Cassidy Hardin, Robert Dadashi, Surya Bhupatiraju, Shreya Pathak, Laurent Sifre, Morgane Rivière, Mihir Sanjay Kale, Juliette Love, Pouya Tafti, Léonard Hussenot, Pier Giuseppe Sessa, Aakanksha Chowdhery, Adam Roberts, Aditya Barua, Alex Botev, Alex Castro-Ros, Ambrose Slone, Amélie Héliou, Andrea Tacchetti, Anna Bulanova, Antonia Paterson, Beth Tsai, Bobak Shahriari, Charline Le Lan, Christopher A. Choquette-Choo, Clément Crepy, Daniel Cer, Daphne Ippolito, David Reid, Elena Buchatskaya, Eric Ni, Eric Noland, Geng Yan, George Tucker, George-Christian Muraru, Grigory Rozhdestvenskiy, Henryk Michalewski, Ian Tenney, Ivan Grishchenko, Jacob Austin, James Keeling, Jane Labanowski, Jean-Baptiste Lespiau, Jeff Stanway, Jenny Brennan, Jeremy Chen, Johan Ferret, Justin Chiu, Justin Mao-Jones, Katherine Lee, Kathy Yu, Katie Millican, Lars Lowe Sjoesund, Lisa Lee, Lucas Dixon, Machel Reid, Maciej Mikuła, Mateo Wirth, Michael Sharman, Nikolai Chinaev, Nithum Thain, Olivier Bachem, Oscar Chang, Oscar Wahltinez, Paige Bailey, Paul Michel, Petko Yotov, Rahma Chaabouni, Ramona Comanescu, Reena Jana, Rohan Anil, Ross McIlroy, Ruibo Liu, Ryan Mullins, Samuel L Smith, Sebastian Borgeaud, Sertan Girgin, Sholto Douglas, Shree Pandya, Siamak Shakeri, Soham De, Ted Klimenko, Tom Hennigan, Vlad Feinberg, Wojciech Stokowiec, Yu hui Chen, Zafarali Ahmed, Zhitao Gong, Tris Warkentin, Ludovic Peran, Minh Giang, Clément Farabet, Oriol Vinyals, Jeff Dean, Koray Kavukcuoglu, Demis Hassabis, Zoubin Ghahramani, Douglas Eck, Joelle Barral, Fernando Pereira, Eli Collins, Armand Joulin, Noah Fiedel, Evan Senter, Alek Andreev, and Kathleen Kenealy · 2024
Closest in time.
Improving llm code generation with grammar augmentation, 2024
Shubham Ugare, Tarun Suresh, Hangoo Kang, Sasa Misailovic, and Gagandeep Singh · 2024
Closest in time.
Fast JSON Decoding for Local LLMs with Compressed Finite State Machine, 2024
Liangsheng Yin, Ying Sheng, and Lianmin Zheng · 2024
Closest in time.