conftrace_

formal language

77 papers

Explore in graph

Also known as

FL

Co-occurring keywords · papers mentioning both

large language model (10) recurrent neural network (8) context-free grammar (5) language model (5) regular language (4) neural network (4) in-context learning (4) mathematical reasoning (4) language generation (3) transformer encoder (3)

Papers

Language Generation in the Limit NeurIPS 2024 Lean Workbook: A large-scale Lean problem set formalized from natural language math problems NeurIPS 2024 Logical Languages Accepted by Transformer Encoders with Hard Attention ICLR 2024 LOGIC-LM++: Multi-Step Refinement for Symbolic Formulations ACL 2024 Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and Beyond) AAAI 2024 MLRegTest: A Benchmark for the Machine Learning of Regular Languages JMLR 2024 Multi-language Diversity Benefits Autoformalization NeurIPS 2024 Rule Extrapolation in Language Modeling: A Study of Compositional Generalization on OOD Prompts NeurIPS 2024 Targeted Syntactic Evaluation on the Chomsky Hierarchy COLING 2024 The Expressive Capacity of State Space Models: A Formal Language Perspective NeurIPS 2024 The Power of Hard Attention Transformers on Data Sequences: A formal language theoretic perspective NeurIPS 2024 Why are Sensitive Functions Hard for Transformers? ACL 2024 A Fast Algorithm for Computing Prefix Probabilities ACL 2023 An Exploration of Left-Corner Transformations EMNLP 2023 CLeAR: Continual Learning on Algorithmic Reasoning for Human-like Intelligence NeurIPS 2023 Efficient Algorithms for Recognizing Weighted Tree-Adjoining Languages EMNLP 2023 NL2LTL – a Python Package for Converting Natural Language (NL) Instructions to Linear Temporal Logic (LTL) Formulas AAAI 2023 On the Intersection of Context-Free and Regular Languages EACL 2023 Recurrent Neural Language Models as Probabilistic Finite-state Automata EMNLP 2023 Tighter Bounds on the Expressivity of Transformer Encoders ICML 2023 Transformers are uninterpretable with myopic methods: a case study with bounded Dyck grammars NeurIPS 2023 Benchmarking Compositionality with Formal Languages COLING 2022 Trees probe deeper than strings: an argument from allomorphy NAACL 2022 AND does not mean OR: Using Formal Languages to Study Language Models’ Representations ACL 2021 Inter-GPS: Interpretable Geometry Problem Solving with Formal Language and Symbolic Reasoning ACL 2021