PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Models (2021.emnlp-main)
Copied to clipboard
| Challenge: | Large pre-trained language models for textual data have an unconstrained output space . when fine-tuned to target constrained formal languages like SQL, these models often generate invalid code, rendering it unusable. |
| Approach: | They propose a method for constraining auto-regressive decoders of language models through incremental parsing. |
| Outcome: | The proposed method can find valid output sequences by rejecting inadmissible tokens . it can be used on Spider and CoSQL text-to-SQl translation tasks . |
Similar Papers
Combining Constrained and Unconstrained Decoding via Boosting: BoostCD and Its Application to Information Extraction (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent approaches to structured NLP tasks use autoregressive models trained on pairs of unstructured input text and structured output targets. |
| Approach: | They propose a model that combines constrained and unconstrained decoding in two phases to achieve two weak predictions. |
| Outcome: | The proposed model outperforms previous approaches both in and out of distribution, addressing several common errors identified in those approaches. |
Learned Incremental Representations for Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | a new syntactic representation that commits to syntakic choices is proposed for humans . we use a system that uses only incremental processing of a prefix to predict the word in a sentence . |
| Approach: | They propose a syntactic representation that commits to syntakic choices incrementally . they say the system can achieve 93.72 F1 on the Penn Treebank with as few as 5 bits per word . |
| Outcome: | The proposed representation achieves 93.72 F1 on the Penn Treebank with as few as 5 bits per word . the analysis of the representations shows they have interpretable features and deferred resolution of syntactic ambiguities. |
An Embarrassingly Simple Method to Mitigate Undesirable Properties of Pretrained Language Model Tokenizers (2022.acl-short)
Copied to clipboard
| Challenge: | a standard tokenizer does not cover all characters of a word but preserves key aspects of its morphological structure . a novel method to improve tokenization of pretrained language models is proposed . |
| Approach: | They propose a method to improve the tokenization of pretrained language models . they use the vocabulary of a standard tokenizer but preserves morphological structure . |
| Outcome: | The proposed method improves tokenization of pretrained language models on morphological gold segmentations and text classification tasks. |
Improved Lexically Constrained Decoding for Translation and Monolingual Rewriting (N19-1)
Copied to clipboard
J. Edward Hu, Huda Khayrallah, Ryan Culkin, Patrick Xia, Tongfei Chen, Matt Post, Benjamin Van Durme
| Challenge: | Lexically-constrained sequence decoding allows for explicit positive or negative phrase-based constraints to be placed on target output strings in machine translation or monolingual text rewriting tasks. |
| Approach: | They propose a vectorized dynamic beam allocation algorithm which extends work in lexically-constrained decoding to work with batching. |
| Outcome: | The proposed method improves on natural language inference, question answering and machine translation tasks by fivefold . |
NarrowBERT: Accelerating Masked Language Model Pretraining and Inference (2023.acl-short)
Copied to clipboard
| Challenge: | Large-scale language model pretraining is expensive as the models and pretraining corpora have become larger over time. |
| Approach: | They propose a modified transformer encoder that increases throughput for masked language model pretraining by more than 2x. |
| Outcome: | The proposed model increases throughput on IMDB and Amazon reviews classification and CoNLL NER tasks by 3.5x with minimal performance degradation. |
Grammar-Constrained Decoding for Structured NLP Tasks without Finetuning (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing grammar-constrained decoding methods are limited to specific tasks . a grammar constraint is used to control the generation of LMs, but it is limited to a few tasks a task is not performed. |
| Approach: | They propose grammar-constrained decoding to control the generation of large language models . they demonstrate that grammars can describe the output space for a wider range of tasks . |
| Outcome: | The proposed grammars outperform unconstrained models on information extraction, entity disambiguation, and constituency parsing. |
Grammar-Constrained Decoding Makes Large Language Models Better Logical Parsers (2025.acl-industry)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown capabilities in various natural language processing tasks, yet struggle with logical reasoning. |
| Approach: | They propose to combine Large Language Models with symbolic reasoners to improve syntactic correctness and semantic accuracy in logical parsing tasks. |
| Outcome: | The proposed approach improves syntactic correctness and semantic accuracy in logical parsing tasks. |
Expanding Pretrained Models to Thousands More Languages via Lexicon-based Adaptation (2022.acl-long)
Copied to clipboard
| Challenge: | Recent studies have found that the performance of multilingual pretrained models is highly dependent on the availability of monolingual or parallel text in a target language. |
| Approach: | They propose to use bilingual lexicons to synthesize textual or labeled data and combine it with monolingual or parallel text when available. |
| Outcome: | The proposed methods improve performance for 19 under-represented languages with and without extra monolingual text. |
CodeT5+: Open Code Large Language Models for Code Understanding and Generation (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing code LLMs adopt a specific architecture or rely on a unified encoder-decoder network for downstream tasks, lacking flexibility to operate in the optimal architecture for a particular task. |
| Approach: | They propose to initialize code LLMs with frozen off-the-shelf LLM and explore instruction-tuning to align with natural language instructions. |
| Outcome: | The proposed model outperforms open-source LLMs on 20 code-related benchmarks. |
Rethinking Denoised Auto-Encoding in Language Pre-Training (2021.emnlp-main)
Copied to clipboard
| Challenge: | Pre-trained models such as BERT have achieved success in learning sequence representations, but they tend to learn representations that are covariant with the noise of pre-training. |
| Approach: | They propose to train self-trained models to learn noise invariant sequence representations . they encourage consistency between original sequence and corrupted version via unsupervised instance-wise training signals. |
| Outcome: | The proposed model improves on 11 natural language understanding and cross-modal tasks and achieves 0.6% gain on GLUE benchmarks and 0.8% increment on NLVR2 . |