Span-based Semantic Parsing for Compositional Generalization
원문 초록
Despite the success of sequence-to-sequence (seq2seq) models in semantic parsing, recent work has shown that they fail in compositional generalization, i.e., the ability to generalize to new structures built of components observed during training. In this work, we posit that a span-based parser should lead to better compositional generalization. we propose SpanBasedSP, a parser that predicts a span tree over an input utterance, explicitly encoding how partial programs compose over spans in the input. SpanBasedSP extends Pasupat et al. (2019) to be comparable to seq2seq models by (i) training from programs, without access to gold trees, treating trees as latent variables, (ii) parsing a class of non-projective trees through an extension to standard CKY. On GeoQuery, SCAN and CLOSURE datasets, SpanBasedSP performs similarly to strong seq2seq baselines on random splits, but dramatically improves performance compared to baselines on splits that require compositional generalization: from $61.0 \rightarrow 88.9$ average accuracy.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Where, What, Why: Towards Explainable Driver Attention Prediction
Sigma: A dataset for text-to-code semantic parsing with statistical analysis
Diverse In-Context Example Selection After Decomposing Programs and Aligned Utterances Improves Semantic Parsing
Disambiguate First Parse Later: Generating Interpretations for Ambiguity Resolution in Semantic Parsing
LP-LM: No Hallucinations in Question Answering with Logic Programming
Ontology-Guided, Hybrid Prompt Learning for Generalization in Knowledge Graph Question Answering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.