| Challenge: | Various formal meaning representations have been developed corresponding to different semantic theories. |
| Approach: | They propose a method to learn a semantic parser from multiple datasets by treating annotations for unobserved formalisms as latent structured variables. |
| Outcome: | The proposed approach improves on existing methods using unobserved formalisms and underlying corpora. |
Similar Papers
Joint Universal Syntactic and Semantic Parsing (2021.tacl-1)
Copied to clipboard
| Challenge: | Several attempts have been made to jointly parse syntax and semantics, but this trade-off is not well understood. |
| Approach: | They propose multiple model architectures that exploit the rich syntactic and semantic annotations contained in the Universal Decompositional Semantics dataset to obtain state-of-the-art results. |
| Outcome: | The proposed model outperforms existing models in 8 languages and their results are consistent across languages. |
Cooperative Learning of Disjoint Syntax and Semantics (N19-1)
Copied to clipboard
| Challenge: | Existing models that learn to jointly infer an expression’s syntactic structure and its semantics fail to learn the correct parsing strategy on mathematical expressions generated from a simple context-free grammar. |
| Approach: | They propose a recursive model that learns to jointly infer an expression’s syntactic structure and its semantics without requiring a formal supervision. |
| Outcome: | The proposed model performs competitively on several natural language tasks, such as Natural Language Inference and Sentiment Analysis. |
Learning Latent Semantic Annotations for Grounding Natural Language to Structured Data (D18-1)
Copied to clipboard
| Challenge: | Existing work on grounded language learning does not capture the semantics of correspondences between structured world state representations and texts. |
| Approach: | They propose to learn explicit latent semantic annotations from paired structured tables and texts . they use an adapted semi-hidden Markov model to impose a soft constraint to further improve performance . |
| Outcome: | The proposed framework improves on a semi-hidden Markov model and extracts templates for language generation. |
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. |
Learning Cross-lingual Distributed Logical Representations for Semantic Parsing (P18-2)
Copied to clipboard
| Challenge: | Recent research efforts have looked into the problem of learning semantic parsers in a multilingual setup, but how to improve the performance of a monolingual semantic parsed system remains a research question that is under-explored. |
| Approach: | They propose to use data annotated in different languages to learn distributed representations of logical forms for improving a monolingual semantic parser. |
| Outcome: | The proposed method improves on the standard multilingual GeoQuery dataset. |
Quantifying training challenges of dependency parsers (C18-1)
Copied to clipboard
| Challenge: | a new metric is introduced to evaluate the difficulty to learn a given class of dependencies . a series of systematic computations using that metric have revealed interesting properties of the 3 considered parsing algorithms . |
| Approach: | They introduce a new metric to evaluate the difficulty to learn a given class of dependencies . they use it to characterize the information conveyed by cross-lingual parsers . |
| Outcome: | The proposed metric reveals the kind of dependencies that require high effort during training . it also shows that cross-lingual parsers can provide better quality information . |
A Short Survey on Sense-Annotated Corpora (2020.lrec-1)
Copied to clipboard
| Challenge: | Word Sense Disambiguation (WSD) is a key task in Natural Language Understanding. |
| Approach: | They propose to use sense-annotated corpora for supervised Word Sense Disambiguation. |
| Outcome: | The proposed methods have been compared with knowledge-based approaches and have shown to be more efficient when they are available. |
Semi-Supervised Semantic Dependency Parsing Using CRF Autoencoders (2020.acl-main)
Copied to clipboard
| Challenge: | Semantic dependency parsing allows words to have multiple dependency heads, resulting in graph-structured representations. |
| Approach: | They propose an approach to semi-supervised learning of semantic dependency parsers based on the CRF autoencoder framework. |
| Outcome: | The proposed model improves over the baseline model and is arc-factored. |
Learning Relatedness between Types with Prototypes for Relation Extraction (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing datasets have no intrinsic Ontology for relation types. |
| Approach: | They propose to use prototypical examples to represent each relation type and use them to augment related types from a different dataset. |
| Outcome: | The proposed model improves on a baseline with multi-task learning between datasets to obtain better representation for relations. |
DynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing (2022.coling-1)
Copied to clipboard
| Challenge: | Existing parsers that learn graph representations based on static graphs are error-prone and disjointed . Graph-based parser can parse sentences efficiently but suffer from error propagation . |
| Approach: | They propose a dynamic graph learning framework to learn graph representations based on a static graph constructed by an existing parser. |
| Outcome: | The proposed parser outperforms the previous parsers on the SemEval-2015 task 18 dataset in three languages. |