Mapping Between English Strings and Reentrant Semantic Graphs
We investigate formalisms for capturing the relation between semantic graphs and English strings. Semantic graph corpora have spurred recent interest in graph transduction formalisms, but it is not yet clear whether such formalisms are a good fit for natural language data―in particular, for describing how semantic reentrancies correspond to English pronouns, zero pronouns, reflexives, passives, nominalizations, etc. We introduce a data set that focuses on these problems, we build grammars to capture the graph/string relation in this data, and we evaluate those grammars for conciseness and accuracy.
Code (0)
등록된 구현이 없습니다.
Tasks
Machine TranslationRelationSimilar Papers 제목 키워드 기반
What Can String Probability Tell Us About Grammaticality?
What have language models (LMs) learned about grammar? This question remains hotly debated, with major ramifications for linguistic theory. However, since probability and grammaticality are distinct notions in linguistic…
Structural Neural Encoders for AMR-to-text Generation
AMR-to-text generation is a problem recently introduced to the NLP community, in which the goal is to generate sentences from Abstract Meaning Representation (AMR) graphs. Sequence-to-sequence models can be used to this …
Abstract Meaning RepresentationAMR-to-Text GenerationGraph-to-SequenceText GenerationThe ERG at MRP 2019: Radically Compositional Semantic Dependencies
The English Resource Grammar (ERG) is a broad-coverage computational grammar of English that outputs underspecified logical-form representations of meaning in a framework dubbed English Resource Semantics (ERS). Two of t…
Offline bilingual word vectors, orthogonal transformations and the inverted softmax
Usually bilingual word vectors are trained "online". Mikolov et al. showed they can also be found "offline", whereby two pre-trained embeddings are aligned with a linear transformation, using dictionaries compiled from e…
Translation