arXiv:1606.08954
공식 코드 · Papers with Code
Greedy, Joint Syntactic-Semantic Parsing with Stack LSTMs
원문 초록
We present a transition-based parser that jointly produces syntactic and semantic dependencies. It learns a representation of the entire algorithm state, using stack long short-term memories. Our greedy inference algorithm has linear time, including feature extraction. On the CoNLL 2008--9 English shared tasks, we obtain the best published parsing performance among models that jointly learn syntax and semantics.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.