Grammar conversion from LTAG to HPSG
Naoki Yoshinaga, Yusuke Miyao · 2002
We propose an algorithm for the conversion of grammars from an arbitrary FB-LTAG grammar into a strongly equivalent HPSG-style grammar. Our algorithm converts LTAG elementary trees into HPSG feature structures by encoding the tree structures in stacks. A set of pre-determined rules manipulate the stack to emulate substitution and adjunction. We have used our algorithm to obtain HPSG-style grammars from existing LTAG grammars. We apply this algorithm to the XTAG English grammar and report some of our findings.