Efficient Constituency Tree based Encoding for Natural Language to Bash Translation (2022.naacl-main)
Copied to clipboard
| Challenge: | Semantic parsing is one of the central tasks for natural language understanding (NLU). |
| Approach: | They propose a Segmented Invocation Transformer that utilizes the information from the constituency parse tree of the natural language text and Bash command components to generate Bash commands. |
| Outcome: | The proposed method improves the inference time and reduces the model parameters by 1.8x . |
Similar Papers
A Learning-Based Dependency to Constituency Conversion Algorithm for the Turkish Language (2022.lrec-1)
Copied to clipboard
Büşra Marşan, Oğuz K. Yıldız, Aslı Kuzgun, Neslihan Cesur, Arife B. Yenice, Ezgi Sanıyar, Oğuzhan Kuyrukçu, Bilge N. Arıcan, Olcay Taner Yıldız
| Challenge: | a team of linguists manually annotated a set of constituency trees. |
| Approach: | They propose to create the first Turkish-based dependency-to-constituency conversion algorithm using a morphologic analyser and feature-based machine learning model. |
| Outcome: | The proposed algorithm can be used to generate new constituency treebanks and training data for NLP resources like constituency parsers. |
Parsing Headed Constituencies (2024.lrec-main)
Copied to clipboard
| Challenge: | Using constituency and dependency trees, syntactic representations are preferred for tasks such as nominal phrase extraction and identification of terminology. |
| Approach: | They propose a parsing technique that generates headed constituency trees which combine information typically contained in constituency and dependency trees. |
| Outcome: | The proposed method generates headed constituency trees with discontinuities and can generate constituency tree with discontinuity. |
Straight to the Tree: Constituency Parsing with Neural Syntactic Distance (P18-1)
Copied to clipboard
| Challenge: | Compared to traditional shift-reduce parsing schemes, our approach is free from the potentially disastrous compounding error. |
| Approach: | They propose a model that predicts a scalar for each split position in a sentence and then determines the topology of grammar tree based on syntactic distances. |
| Outcome: | The proposed model achieves the state-of-the-art single model F1 score of 92.1 on PTB and 86.4 on CTB dataset, surpassing the previous single model results by a large margin. |
Efficient Constituency Parsing by Pointing (2020.acl-main)
Copied to clipboard
| Challenge: | Constituency parsing is a core task in natural language processing (NLP) Existing methods for constituency paring are greedy transition-based or globally optimized. |
| Approach: | They propose a constituency parsing model that casts the problem into a series of pointing tasks. |
| Outcome: | The proposed model achieves 92.78 F1 without pre-trained models, which is faster than existing models. |
Syntax-BERT: Improving Pre-trained Transformers with Syntax Trees (2021.eacl-main)
Copied to clipboard
| Challenge: | Pre-trained language models like BERT achieve superior performances in various NLP tasks without explicit consideration of syntactic information. |
| Approach: | They propose a plug-and-play framework that incorporates syntax trees into pre-trained Transformers. |
| Outcome: | The proposed framework improves on pre-trained models on natural language understanding datasets and shows that it can be used to train pre-structured neural networks. |
TreeMix: Compositional Constituency-based Data Augmentation for Natural Language Understanding (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing data augmentation methods miss the important characteristic of compositionality, meaning of a complex expression is built from its sub-parts. |
| Approach: | They propose a compositional data augmentation approach for natural language understanding called TreeMix that leverages constituency parsing tree to decompose sentences into constituent sub-structures and the Mixup data enhancing technique to recombine them to generate new sentences. |
| Outcome: | The proposed approach outperforms current state-of-the-art methods on text classification and SCAN. |
NL2Bash: A Corpus and Semantic Parser for Natural Language Interface to the Linux Operating System (L18-1)
Copied to clipboard
| Challenge: | NL2Bash is a new semantic parsing problem for mapping English sentences to Bash commands. |
| Approach: | They propose a dataset of English commands and expert-written Bash commands to map English sentences to Bash. |
| Outcome: | The proposed methods are significantly larger (from two to ten times) than most existing benchmarks. |
Analysis of Tree-Structured Architectures for Code Generation (2021.findings-acl)
Copied to clipboard
| Challenge: | Code generation is the task of generating code snippets from input user specifications written in natural language (NL). |
| Approach: | They evaluate the significance of input parse trees for code generation by using constituency-based parsers as input and an abstract syntax tree as the target. |
| Outcome: | The proposed models on a Python-based code generation dataset and a semantic parsing dataset show that constituency trees encoded using a structure-aware model improve performance. |
LLM-Supported Natural Language to Bash Translation (2025.naacl-long)
Copied to clipboard
| Challenge: | Using the natural language to Bash command (NL2SH) for command composition is difficult due to inaccurate test data and unreliable heuristics for determining the functional equivalence of Bash commands. |
| Approach: | They propose to use a heuristic to determine the functional equivalence of two Bash commands with 95% confidence, a 16% increase over previous heurs. |
| Outcome: | The proposed heuristic can determine the functional equivalence of two Bash commands with 95% confidence, a 16% increase over previous heurs. |
Rethinking Positional Encoding in Tree Transformer for Code Representation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent works have proposed novel tree Transformers to capture the syntactic structure in source code. |
| Approach: | They propose a novel tree Transformer encoding node positions based on a description method for tree structures to incorporate inductive bias into Transformer. |
| Outcome: | The proposed model outperforms baselines on code summarization and completion tasks across two languages, and it is able to perform better on both local and global paradigms. |