analysis of clausal coordination using synchronous tree adjoining grammar.
Saved in:
| Title: | analysis of clausal coordination using synchronous tree adjoining grammar. |
|---|---|
| Authors: | Han, Chung-hye1 chunghye@sfu.ca, Williamson, Sara1, Born, Logan2, Sarkar, Anoop2 |
| Source: | Journal of Logic & Computation. Jan2019, Vol. 29 Issue 1, p91-123. 33p. |
| Subjects: | Grammar, Synchronous data transmission systems, Syntax (Grammar), Semantics, Argument |
| Abstract: | This paper presents a novel analysis of clausal coordination with shared arguments using synchronous tree adjoining grammar (STAG), a pairing of a tree adjoining grammar (TAG) for syntax and a TAG for semantics. In clausal coordination, one or more arguments can be shared by the verbal predicates of the conjuncts, as in Sue likes and Kim hates Pete, where an object argument Pete is shared by likes and hates. As the predicate-argument structure must be represented within each predicative elementary tree in TAG, modelling argument sharing across clauses poses an interesting challenge for TAG. A widely adopted approach within the TAG literature at present is to employ the conjoin operation (Sakar and Joshi, 1996, Proceedings of COLING '96, 610–615), a non-standard tree-composing operation in TAG. This operation applies across elementary trees to identify and merge the arguments from each clause, yielding a derivation structure in which the shared arguments are combined with multiple elementary trees and a derived tree in which the shared arguments are dominated by multiple verbal projections. In contrast, our STAG analysis pairs a syntactic elementary tree that participates in the derivation of clausal coordination with a semantic elementary tree that includes a |$\lambda$| -term to abstract over the shared argument. This allows the sharing of arguments in coordination to be instantiated in semantics, without being represented in syntax in the form of multiple dominance, utilizing only the standard TAG operations, substitution and adjoining. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 134213649 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: analysis of clausal coordination using synchronous tree adjoining grammar. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Han%2C+Chung-hye%22">Han, Chung-hye</searchLink><relatesTo>1</relatesTo><i> chunghye@sfu.ca</i><br /><searchLink fieldCode="AR" term="%22Williamson%2C+Sara%22">Williamson, Sara</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Born%2C+Logan%22">Born, Logan</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Sarkar%2C+Anoop%22">Sarkar, Anoop</searchLink><relatesTo>2</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Jan2019, Vol. 29 Issue 1, p91-123. 33p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Grammar%22">Grammar</searchLink><br /><searchLink fieldCode="DE" term="%22Synchronous+data+transmission+systems%22">Synchronous data transmission systems</searchLink><br /><searchLink fieldCode="DE" term="%22Syntax+%28Grammar%29%22">Syntax (Grammar)</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Argument%22">Argument</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This paper presents a novel analysis of clausal coordination with shared arguments using synchronous tree adjoining grammar (STAG), a pairing of a tree adjoining grammar (TAG) for syntax and a TAG for semantics. In clausal coordination, one or more arguments can be shared by the verbal predicates of the conjuncts, as in Sue likes and Kim hates Pete, where an object argument Pete is shared by likes and hates. As the predicate-argument structure must be represented within each predicative elementary tree in TAG, modelling argument sharing across clauses poses an interesting challenge for TAG. A widely adopted approach within the TAG literature at present is to employ the conjoin operation (Sakar and Joshi, 1996, Proceedings of COLING '96, 610–615), a non-standard tree-composing operation in TAG. This operation applies across elementary trees to identify and merge the arguments from each clause, yielding a derivation structure in which the shared arguments are combined with multiple elementary trees and a derived tree in which the shared arguments are dominated by multiple verbal projections. In contrast, our STAG analysis pairs a syntactic elementary tree that participates in the derivation of clausal coordination with a semantic elementary tree that includes a |$\lambda$| -term to abstract over the shared argument. This allows the sharing of arguments in coordination to be instantiated in semantics, without being represented in syntax in the form of multiple dominance, utilizing only the standard TAG operations, substitution and adjoining. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=134213649 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1093/logcom/exy031 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 33 StartPage: 91 Subjects: – SubjectFull: Grammar Type: general – SubjectFull: Synchronous data transmission systems Type: general – SubjectFull: Syntax (Grammar) Type: general – SubjectFull: Semantics Type: general – SubjectFull: Argument Type: general Titles: – TitleFull: analysis of clausal coordination using synchronous tree adjoining grammar. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Han, Chung-hye – PersonEntity: Name: NameFull: Williamson, Sara – PersonEntity: Name: NameFull: Born, Logan – PersonEntity: Name: NameFull: Sarkar, Anoop IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: Jan2019 Type: published Y: 2019 Identifiers: – Type: issn-print Value: 0955792X Numbering: – Type: volume Value: 29 – Type: issue Value: 1 Titles: – TitleFull: Journal of Logic & Computation Type: main |
| ResultId | 1 |
