LAUSR

Ordered Tree Decomposition for HRG Rule Extraction

Sign Up to like & get
recommendations!
1 Published in 2019 at "Computational Linguistics"

DOI: 10.1162/coli_a_00350

Abstract: 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 order,… read more here.

Keywords: tree decomposition; rule; extraction; ordered tree ... See more keywords