| Challenge: | Existing methods for semantic parsing use placeholders to represent relations between sentences and semantic representations. |
| Approach: | They show that compositional parsers can remember unbounded number of placeholders . this is the first study of this kind to describe relations between sentences and semantic representations based on projective mechanisms. |
| Outcome: | The proposed method can represent relations between sentences and semantic representations without using nonprojective mechanisms. |
Similar Papers
The Limitations of Limited Context for Constituency Parsing (2021.acl-long)
Copied to clipboard
| Challenge: | a language model that is syntax-aware can produce better samples, authors say . a recent study shows that neural approaches to syntax can perform unsupervised syntactic parsing . |
| Approach: | They propose to incorporate syntax into neural approaches in NLP to produce better samples . they find that the first time neural approaches were able to perform unsupervised syntactic parsing . |
| Outcome: | The proposed models can perform unsupervised syntactic parsing, but they are lagging behind . the proposed models are based on a sandbox of probabilistic context-free-grammars . |
Discourse Representation Parsing for Sentences and Documents (P19-1)
Copied to clipboard
| Challenge: | Experimental results show that our model outperforms competitive baselines by a wide margin. |
| Approach: | They propose a neural model which parses discourse structures of arbitrary length and granularity. |
| Outcome: | The proposed model outperforms baseline models on sentence- and document-level benchmarks. |
Lower Bounds on the Expressivity of Recurrent Neural Language Models (2024.naacl-long)
Copied to clipboard
| Challenge: | Recent studies of the representational capacity of neural LMs have focused on their ability to recognize formal languages. |
| Approach: | They propose to connect recurrent neural networks (RNNs) as classifiers to finite-state automatas (FSAs) and a probabilistic FSA to characterize their representational capacity. |
| Outcome: | The proposed models can express arbitrary regular LMs with linearly bounded precision. |
Filling in the Mechanisms: How do LMs Learn Filler-Gap Dependencies under Developmental Constraints? (2026.findings-acl)
Copied to clipboard
| Challenge: | Language models lack language-specific biases, yet still posit some important syntactic generalizations. |
| Approach: | They applied Distributed Alignment Search to checkpoints of a language model from the BabyLM challenge to evaluate whether representations of filler-gap dependencies transfer between wh-questions and topicalization. |
| Outcome: | The results suggest shared, yet item-sensitive mechanisms may develop with limited training data. |
Parsing All: Syntax and Semantics, Dependencies and Spans (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Syntactic and semantic structures are key linguistic contextual clues, but few studies have explored how they can be used to improve syntactical parsing. |
| Approach: | They propose a syntactic and semantic parsing model which integrates syntaktic information in the encoder of neural network and benefits from two representation formalisms in a uniform way. |
| Outcome: | The proposed model achieves state-of-the-art or competitive results on both span and dependency representations and on Penn Treebank. |
Benchmarking Compositionality with Formal Languages (2022.coling-1)
Copied to clipboard
| Challenge: | Compositionality is a hallmark of human language, but it is not yet fully understood . recombining known primitive concepts into larger novel combinations is elusive . |
| Approach: | They use finite-state transducers to make a dataset with controllable compositionality . they find that the models either learn the relations completely or not at all . |
| Outcome: | The proposed model learns the relation completely or not at all on large datasets. |
Context Dependent Semantic Parsing: A Survey (2020.coling-main)
Copied to clipboard
| Challenge: | Semantic parsing is the task of translating natural language utterances into machine-readable meaning representations. |
| Approach: | They propose to use contextual information to translate natural language utterances into machine-readable meaning representations. |
| Outcome: | The proposed methods do not utilize contextual information, which could boost the semantic parsing systems. |
Assessing Composition in Sentence Vector Representations (C18-1)
Copied to clipboard
| Challenge: | opacity of sentence vector representations is a challenge to achieving language understanding . current neural network models are unable to capture meaning information in dense vectors . |
| Approach: | They propose a method that targets compositional meaning information in sentence embeddings with a high degree of precision and control. |
| Outcome: | The proposed method extracts useful information about the different capacities of existing sentences models. |
Bridging Perception, Memory, and Inference through Semantic Relations (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies suggest that it is impossible to learn meaning from surface form alone. |
| Approach: | They propose to develop triadic systems that combine neural and symbolic methods to provide a seamless information flow between them. |
| Outcome: | The proposed systems combine the strengths of neural and symbolic methods to achieve a seamless information flow between them. |
The Role of Semantic Parsing in Understanding Procedural Text (2023.findings-eacl)
Copied to clipboard
| Challenge: | Inferring actions and their impact on entities involved in a procedural text can be challenging in various aspects. |
| Approach: | They propose a symbolic parser and semantic role labeling as two sources of semantic parsing knowledge. |
| Outcome: | The proposed framework integrates semantic parsing knowledge into state-of-the-art neural models and shows that it improves procedural understanding. |