Lexicalized Tree Adjoining Grammar

From GM-RKB
Jump to navigation Jump to search

A Lexicalized Tree Adjoining Grammar is a Tree Adjoining Grammar where each Elementary Tree has at least one Terminal Symbol as a Leaf Node.



References

1997

  • (Joshi & Schabes, 1997)
    • explain how every CFG can be strongly lexicalized by TAG
    • show that Tree-Adjoining Languages are closed under lexicalization: every TAL has a lexicalized TAG grammar
    • Lexicalization has some useful effects:
      • finite ambiguity: corresponds to our intuition about NL ambiguities,
      • statistical dependencies between words can be captured which can improve parsing accuracy