1 / 10

A Simpler Parsing Algorithm for Relative Clauses in Vietnamese

A Simpler Parsing Algorithm for Relative Clauses in Vietnamese. Tanmoy Bhattacharya Nguyen Chi Duy Khuong tanmoy1@gmail.com khuongvn2000@yahoo.com Department of Linguistics University of Delhi. The Problem. Implementable formalisms (e.g. HPSG) have two problems with adjuncts:

talib
Download Presentation

A Simpler Parsing Algorithm for Relative Clauses in Vietnamese

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Simpler Parsing Algorithm for Relative Clauses in Vietnamese Tanmoy Bhattacharya Nguyen Chi Duy Khuong tanmoy1@gmail.comkhuongvn2000@yahoo.com Department of Linguistics University of Delhi

  2. The Problem • Implementable formalisms (e.g. HPSG) have two problems with adjuncts: • identifying the adjunct (Recognition) • determining the place the adjunct belongs (Addressing Technique) • The paper highlights these problems and suggests a solution to get around it using RC theories of Principles & Parameters framework

  3. Classic HPSG: The duality of representation • Problem in general: whether the adjunct is a functor or an argument • Proliferation features to produce a syntactic parse • Head-Complement idea is conducive to HPSG as it is easier to see complements as semantic arguments of their heads. • Broader range of categories modified • Number of adjuncts is not pre-fixed • Pollard and Sag (1987): adjunct-main clause dependency determined by rules of grammar

  4. Problem with the Classic HPSG • The solution rests on hierarchy of types/ subtypes (head-structure and head-adjunct-structure respectively) Phrase qo CLAUSALITY HEADEDNESS qo qo Clause non-clause hd-ph non-hd-ph • tu .. … rel-cl hd-adj-ph

  5. HPSG schemata for solution that I like PHON solution that I like HEAD 1 SYN | LOC SUBCAT 2 LEX _ PHON solution MAJ N HEAD-DTR HEAD 1 NFORM NORM ADJUNCTS <..3..> DTRS SYN|LOC SUBCAT 2 DET LEX _ PHON that I like ADJ-DTR SYN 3 RELCLAUSE

  6. Revised HPSG S [MOD N] qo NP VP [MOD N] wi NP V [MOD N] John-I chayk-ul neh-un -nom book-acc put-rel ‘The book that John put’ Sag (1995)

  7. Highest V in RC need not show RC morphology Watashi ga inu ga taberu ring-o miru I NOM dog NOM eats apple-ACC see ‘I see the apple which the dog eats.’ IP 3 watashi ga I’ 3 VP I 3 NP V 3 miru CP NP 6 inuga taberu ringo • Similarly with Vietnamese

  8. Sag (1995) Solution BIND 0 word ARG-ST [SLASH 1 ], …, [SLASH n ] SLASH ( 1 ⊎ …⊎ 2 ) __ 0 who (relative) CAT NP CONT [INDEX 3] REL { 3 } QUE { }

  9. Semantics of the Gap I eat the apples which the men bought.

  10. Linking the two clauses

More Related