Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor...
Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor... Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor...
Outline 1 Why CFGs are not enough (for linguists) 2 Introduction to Tree-Adjoining Grammars 3 An Algorithm for Parsing TAGs 4 LTAG-Spinal Parser 46 / 52
LTAG-Spinal Parser LTAG-spinal: Roughly speaking, a subset of LTAG, where every elementary tree is in spinal form (no branching, except for footnodes). We look at the left-to-right incremental LTAG-spinal parser by Shen and Joshi (2005), implemented in Java. Input: POS-tagged sentences Donald_NNP is_VBZ most_RBS famous_JJ for_IN his_PRP$ semi-intelligible_JJ speech_NN and_CC his_PRP$ explosive_JJ temper_NN ._. 47 / 52
- Page 1 and 2: Lexicalized Tree-Adjoining Grammars
- Page 3 and 4: Context-Free Grammars Definition (C
- Page 5 and 6: Tree-Substitution Grammars Example
- Page 7 and 8: Outline 1 Why CFGs are not enough (
- Page 9 and 10: Cross-Serial Dependencies Example (
- Page 11 and 12: Lexicalization Example (Lexicalized
- Page 13 and 14: Lexicalization Example (CFG which i
- Page 15 and 16: Outline 1 Why CFGs are not enough (
- Page 17 and 18: Initial Trees Definition (Initial T
- Page 19 and 20: Substitution Definition (Substituti
- Page 21 and 22: Adjunction Definition (Adjunction)
- Page 23 and 24: Adjunction Constraints Given TAG G
- Page 25 and 26: Lexicalization Example (strong lexi
- Page 27 and 28: Further Formal Properties of TAL Tr
- Page 29 and 30: TAG Parsing Parser: Given a string
- Page 31 and 32: Recognizing Adjunction But the algo
- Page 33 and 34: Dotted Tree We introduce the notion
- Page 35 and 36: Chart Items The algorithm stores in
- Page 37 and 38: Scan Operations Input string: c 1
- Page 39 and 40: Complete Operations 1 2 3 [γ, adr,
- Page 41 and 42: Recognizer Algorithm Algorithm (Rec
- Page 43 and 44: Complexity of Recognizer Given: n:
- Page 45: Recognizing Substitution Recognizer
- Page 49 and 50: LTAG-Spinal Parser Graphical repres
- Page 51 and 52: Conclusion TAG: a grammar formalism
<strong>LTAG</strong>-Spinal Parser<br />
<strong>LTAG</strong>-spinal:<br />
Roughly speaking, a subset of <strong>LTAG</strong>, where every elementary tree<br />
is in spinal form (no branching, except for footnodes).<br />
We look at the left-to-right incremental <strong>LTAG</strong>-spinal parser by<br />
Shen and Joshi (2005), implemented in Java.<br />
Input: POS-tagged sentences<br />
Donald_NNP is_VBZ most_RBS famous_JJ for_IN his_PRP$<br />
semi-intelligible_JJ speech_NN and_CC his_PRP$<br />
explosive_JJ temper_NN ._.<br />
47 / 52
Change language