Nadav Borenstein

Latest

• Can Transformer Language Models Learn $n$-gram Language Models?
• What Languages are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languages