Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor...
Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor... Lexicalized Tree-Adjoining Grammars (LTAG) - ad-teaching.infor...
References Joshi, A. K. and Schabes, Y. (1997) Tree-Adjoining Grammars. In Salomma, A. and Rosenberg, G., editors, Handbook of Formal Languages and Automata, volume 3, pages 69–124. Springer. Kallmeyer, L. (2010) Parsing Beyond Context-Free Grammars. Springer. Abeillé, A. and Rambow, O. (2000) Tree Adjoining Grammar: An Overview. In Abeillé, A. and Rambow, O., editors, Tree Adjoining Grammars: Formalisms, Linguistic Analyses and Processing, volume 107 of CSLI Lecture Notes, pages 1–68. CSLI Publications, Stanford. Shen, L. and Joshi, A. K. (2005) Incremental LTAG Parsing. In Proceedings of the Human Language Technology Conference / Conference of Empirical Methods in Natural Language Processing (HLT/EMNLP). 52 / 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 and 46: Recognizing Substitution Recognizer
- Page 47 and 48: LTAG-Spinal Parser LTAG-spinal: Rou
- Page 49 and 50: LTAG-Spinal Parser Graphical repres
- Page 51: Conclusion TAG: a grammar formalism
References<br />
Joshi, A. K. and Schabes, Y. (1997)<br />
<strong>Tree</strong>-<strong>Adjoining</strong> <strong>Grammars</strong>.<br />
In Salomma, A. and Rosenberg, G., editors, Handbook of Formal<br />
Languages and Automata, volume 3, pages 69–124. Springer.<br />
Kallmeyer, L. (2010)<br />
Parsing Beyond Context-Free <strong>Grammars</strong>.<br />
Springer.<br />
Abeillé, A. and Rambow, O. (2000)<br />
<strong>Tree</strong> <strong>Adjoining</strong> Grammar: An Overview.<br />
In Abeillé, A. and Rambow, O., editors, <strong>Tree</strong> <strong>Adjoining</strong> <strong>Grammars</strong>:<br />
Formalisms, Linguistic Analyses and Processing, volume 107 of CSLI<br />
Lecture Notes, pages 1–68. CSLI Publications, Stanford.<br />
Shen, L. and Joshi, A. K. (2005)<br />
Incremental <strong>LTAG</strong> Parsing.<br />
In Proceedings of the Human Language Technology Conference /<br />
Conference of Empirical Methods in Natural Language Processing<br />
(HLT/EMNLP).<br />
52 / 52
Change language