A Synchronous Hyperedge Replacement Grammar based approach for AMR parsing
Code (0)
등록된 구현이 없습니다.
Tasks
AMR ParsingMachine TranslationQuestion AnsweringSimilar Papers 제목 키워드 기반
UofR at SemEval-2016 Task 8: Learning Synchronous Hyperedge Replacement Grammar for AMR Parsing
2016-06-01 · SEMEVAL 2016 6
· Xiaochang Peng, Daniel Gildea
AMR ParsingMachine TranslationQuestion Answering
Parsing Graphs with Hyperedge Replacement Grammars
2013-08-01 · ACL 2013 8
· David Chiang, Jacob Andreas, Daniel Bauer, Karl Moritz Hermann 외
Machine Translation
Parsing Weighted Order-Preserving Hyperedge Replacement Grammars
2019-07-01 · WS 2019 7
· Henrik Bj{\"o}rklund, Frank Drewes, Petter Ericson
Exact yet Efficient Graph Parsing, Bi-directional Locality and the Constructivist Hypothesis
2020-07-01 · ACL 2020 6
· Yajie Ye, Weiwei Sun
A key problem in processing graph-based meaning representations is graph parsing, i.e. computing all possible derivations of a given graph according to a (competence) grammar. We demonstrate, for the first time, that exa…
Ordered Tree Decomposition for HRG Rule Extraction
2019-06-01 · CL 2019 6
· Daniel Gildea, Giorgio Satta, Xiaochang Peng
We present algorithms for extracting Hyperedge Replacement Grammar (HRG) rules from a graph along with a vertex order. Our algorithms are based on finding a tree decomposition of smallest width, relative to the vertex or…
Tree Decomposition