Free Word Order in a Constraint-based Implementation of Dependency Grammar

نویسندگان

  • Tom B. Y. Lai
  • Changning Huang
چکیده

Parsing of sentences based on Dependency Grammar is emulated with a constraintand unification-based mechanism that preserves single-headedness and projectivity in syntactic dependency. Working on Chinese, and referring to English at times, the authors have treated subcategorization properties of verbs on the assumptions that relative positions of obligatory complements of a verb are fixed, and that optional verbal adjuncts, while relatively free in their choice of positions in the sentence, are constrained to be placed farther away from the governing verb than any complements. A pair of subcategorization lists residing in the governing verb have been used to capture these properties. However when one tries to extend the model to languages with relatively free word order like Japanese, for which the assumptions mentioned above are not valid, straight-forward list-manipulations on subcategorization lists will not be adequate. This paper discusses how additional subcategorization handling mechanisms can be introduced to deal with verbal complements scrambling and intervening adjuncts, while retaining the mechanisms to capture default word order.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information Structure in Topological Dependency Grammar

Topological Dependency Grammar (TDG) is a lexicalized dependency grammar formalism, able to model languages with a relatively free word order. In such languages, word order variation often has an important function: the realization of information structure. The paper discusses how to integrate information structure into TDG, and presents a constraint-based approach to modelling information stru...

متن کامل

Complements And Adjuncts In Dependency Grammar Parsing Emulated By A Constrained Context-Free Grammar

Generalizing from efforts parsing natural language sentences using the grammar formalism, Dependency Grammar (DG) has been emulated by a context-free grammar (CFG) constrained by grammatical function annotation. Single-headedness and projectivity are assumed. This approach has the benefit of making general constraint-based context-free grammar parsing facilities available to DG analysis. This p...

متن کامل

Czech Syntactic Analysis Constraint-based - XDG: One Possible Start

This article describes an attempt to implement a constraint-based dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Extensible Dependency Grammar (XDG). The grammar rules are automatically inferred from the Prague Dependency Treebank (PDT) and constrain dependency relations, modification frames and word order, including non-projectivity. Althoug...

متن کامل

A Two Stage Constraint - Based Dependency Parser for Free Word Order Languages

The paper proposes a broad coverage twostage constraint based dependency parser for free word order languages. For evaluating the parser and to ascertain its coverage we show its performance on Hindi which is a free word order language. We compare our results with that of two data-driven parsers which were trained on a subpart of a Hindi Treebank. The final results are good with a maximum attac...

متن کامل

Problems of Inducing Large Coverage Constraint-Based Dependency Grammar for Czech

This article describes an attempt to implement a constraintbased dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Extensible Dependency Grammar (XDG). The grammar rules are automatically inferred from the Prague Dependency Treebank (PDT) and constrain dependency relations, modification frames and word order, including non-projectivity. Although...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999