Presentation is loading. Please wait.

Presentation is loading. Please wait.

1/15 Synchronous Tree-Adjoining Grammars Authors: Stuart M. Shieber and Yves Schabes Reporter: 江欣倩 Professor: 陳嘉平.

Similar presentations


Presentation on theme: "1/15 Synchronous Tree-Adjoining Grammars Authors: Stuart M. Shieber and Yves Schabes Reporter: 江欣倩 Professor: 陳嘉平."— Presentation transcript:

1 1/15 Synchronous Tree-Adjoining Grammars Authors: Stuart M. Shieber and Yves Schabes Reporter: 江欣倩 Professor: 陳嘉平

2 2/15 Introduction Advantage of TAG (Tree-adjoining grammar)  The domain of locality  The statements of dependencies and recursion possibilities in a tree are factored Synchronous TAGs  Characterize correspondences between languages

3 3/15 Synchronous TAGs The two TAGs are synchronous in the sense that adjunction and substitution operations are applied simultaneously to related nodes in pairs of trees, one for each language.  two languages: source and target languages (nondirectional) English and French  Example

4 4/15 A derivation step A derivation step from a pair of trees (α 1, α 2 )  Nondeterministically choose a link in the pair connecting two nodes (n 1 in α 1 and n 2 in α 2 )  Nondeterministically choose a pair of trees (β 1, β 2 ) in the grammar.  Form the resultant pair (β 1 (α 1,n 1 ), β 2 (α 2,n 2 ))

5 5/15 Example The tree pair α Nondeterministically choose a link in the pair connecting two nodes

6 6/15 Example Nondeterministically choose a pair of trees (β 1, β 2 ) in the grammar Form the resultant pair (β 1 (α 1,n 1 ), β 2 (α 2,n 2 ))

7 7/15 Example Nondeterministically choose a link in the pair connecting two nodes Nondeterministically choose a pair of trees (γ 1, γ 2 ) in the grammar

8 8/15 Example Form the resultant pair (γ 1 (α 1,n 1 ), γ 2 (α 2,n 2 )) Nondeterministically choose a pair of trees (δ 1, δ 2 ) and (ε 1, ε 2 ) in the grammar

9 9/15 Example Form the resultant pair (δ 1 (α 1,n 1 ), δ 2 (α 2,n 2 )) and (ε 1 (α 1,n 1 ), ε 2 (α 2,n 2 ))

10 10/15 Synchronous TAGs The arguments for factoring recursion and dependencies as TAGs do for the syntax of natural language have their counterparts in the semantics. the use of the synchronous TAG augmentation allows an even more radical reduction in the role of features in a TAG grammar.

11 11/15 Applications: Idioms Discontinuous syntactic constituents can be semantically localized. Nonstandard long-distance dependencies are statable without resort to reanalysis. Both frozen and flexible idioms can be easily characterized.

12 12/15 Applications: Quantifiers

13 13/15 Applications: Quantifiers

14 14/15 Using Synchronous TAGs Synchronous TAGs are inherently semantically monotonic. LTAG allow for more efficient parsing according to the semantic grammar and more efficient generation.  Context free grammars are not possible to require nontrivial semantics to be associated with each lexical item. Lexicalization of the syntactic grammar aids parsing, so lexicalization of the semantic grammar aids generation.

15 15/15 Conclusion Synchronous TAGs provide a simple mechanism that can be used to graft such an ability onto a base TAG formalism.


Download ppt "1/15 Synchronous Tree-Adjoining Grammars Authors: Stuart M. Shieber and Yves Schabes Reporter: 江欣倩 Professor: 陳嘉平."

Similar presentations


Ads by Google