| Challenge: | Existing approaches to extract syntactic features from text or sentences are limited by the loss of rich structural information contained in the syntax tree. |
| Approach: | They propose to embed the syntax parse tree of sentence into a learnable distributed representation . they show that the approach improves upon the prior art and achieves new performance records . |
| Outcome: | The proposed approach improves upon the prior art and achieves new performance records on five benchmarking data sets. |
Similar Papers
Towards Lossless Encoding of Sentences (P19-1)
Copied to clipboard
| Challenge: | Existing methods for encoding text into lossless representations focus on performing well on downstream tasks and are unable to reconstruct original sequence from learned embedding. |
| Approach: | They propose a lossless method for encoding long sequences of texts into feature rich representations by recursive autoencoding. |
| Outcome: | The proposed method performs well on sentiment analysis and sentiment classification tasks. |
Embeddings in Natural Language Processing (2020.coling-tutorials)
Copied to clipboard
| Challenge: | Embeddings have been a key topic of interest in NLP for the past decade . a quick warm-up introduction to NLP and why it is important to have a semantic comprehension of texts . |
| Approach: | This tutorial will provide a high-level synthesis of the main embedding techniques in NLP . it will start with word embedds and then move to other types of embeddable vectors . |
| Outcome: | This tutorial will provide a high-level synthesis of the main embedding techniques in NLP . it will start with word embedds and move to other types of embeddable representations . |
Unifying Parsing and Tree-Structured Models for Generating Sentence Semantic Representations (2022.naacl-srw)
Copied to clipboard
| Challenge: | Existing tree-based models require handannotated data to be trained. |
| Approach: | They propose a tree-based model that learns its composition function together with its structure. |
| Outcome: | The proposed model outperforms existing models on downstream tasks and is competitive with Bert base model. |
CAST: Enhancing Code Summarization with Hierarchical Splitting and Reconstruction of Abstract Syntax Trees (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for code summarization do not capture rich information in ASTs . existing methods are labor-intensive and time-consuming to document code with good summaries manually. |
| Approach: | They propose a model that hierarchically splits and reconstructs ASTs by a neural network . they propose to use AST embeddings and a vanilla code token encoder to generate the model . |
| Outcome: | The proposed model splits and reconstructs ASTs into subtrees and then aggregates embeddings of subtreas to get the complete AST. |
Syntax-Enhanced Neural Machine Translation with Syntax-Aware Word Representations (N19-1)
Copied to clipboard
| Challenge: | Syntax integration has been demonstrated highly effective in neural machine translation (NMT). |
| Approach: | They propose a method to integrate source-side syntax implicitly for neural machine translation . they use hidden representations of a well-trained end-to-end dependency parser to concatenate them with ordinary word embeddings to enhance basic NMT models. |
| Outcome: | The proposed method outperforms existing methods on two translation tasks . it can be easily integrated into the widely-used sequence-to-sequence (Seq2Sequen) framework . |
Explaining Word Embeddings via Disentangled Representation (2020.aacl-main)
Copied to clipboard
| Challenge: | Disentangled representations are known to represent interpretable factors in separated dimensions. |
| Approach: | They propose to transform dense word vectors into disentangled embeddings with improved interpretability by encoding polysemous semantics separately. |
| Outcome: | The proposed model can be encoded into multiple sub-embeddings or sub-areas and generates more efficient and effective features for natural language processing. |
Parameter-free Sentence Embedding via Orthogonal Basis (D19-1)
Copied to clipboard
| Challenge: | Existing methods to build sentence embeddings are parameterized and require training to optimize their parameters. |
| Approach: | They propose a non-parameterized method to combine pre-trained word embeddings into sentence representations using an orthogonal basis of the word vector subspace and its surrounding context. |
| Outcome: | The proposed method shows superior performance on 11 downstream NLP tasks and is competitive to other methods relying on large amounts of labelled data or prolonged training time. |
Composition-contrastive Learning for Sentence Embeddings (2023.acl-long)
Copied to clipboard
| Challenge: | Recent work shows potential to learn vector representations from unlabelled data without task-specific fine-tuning. |
| Approach: | They propose to maximize alignment between textual embeddings and a composition of their phrasal constituents. |
| Outcome: | The proposed approach improves on similarity tasks comparable to state-of-the-art approaches. |
Unsupervised Learning of Sentence Embeddings Using Compositional n-Gram Features (N18-1)
Copied to clipboard
| Challenge: | Currently, unsupervised word embeddings are routinely trained on large amounts of raw text data. |
| Approach: | They propose to use unsupervised word embeddings to train distributed representations of sentences. |
| Outcome: | The proposed method outperforms state-of-the-art models on most benchmark tasks and is robust to the produced general-purpose sentence embeddings. |
Scripts Through Time: A Survey of the Evolving Role of Transliteration in NLP (2026.findings-acl)
Copied to clipboard
| Challenge: | Cross-lingual transfer is often hindered by the "script barrier" where differences in writing systems inhibit transfer learning . transliteration is a powerful technique to bridge this gap by increasing lexical overlap . authors present a taxonomy of key motivations to utilize transliterations in language models . |
| Approach: | They propose a taxonomy of key motivations to utilize transliterations in NLP . they analyze the evolution and effectiveness of these methods and discuss trade-offs . |
| Outcome: | The proposed transliteration technique is effective in cross-lingual NLP, the authors argue . the proposed translliteration method is a powerful tool to overcome the "script barrier" |