TAILIEUCHUNG - Báo cáo khoa học: "Parsing Mildly Non-projective Dependency Structures"

We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at most 1, with the same complexity as the best existing parsers for constituency formalisms of equivalent generative power; all well-nested structures with gap degree bounded by any constant k; and a new class of structures with gap degree up to k that includes some ill-nested structures. The third case includes all the gap degree k structures in a number of dependency treebanks. . | Parsing Mildly Non-projective Dependency Structures Carlos Gomez-Rodriguez Departamento de Computation Universidade da Coruna Spain cgomezr@ David Weir and John Carroll Department of Informatics University of Sussex United Kingdom davidw johnca @ Abstract We present parsing algorithms for various mildly non-projective dependency formalisms. In particular algorithms are presented for all well-nested structures of gap degree at most 1 with the same complexity as the best existing parsers for constituency formalisms of equivalent generative power all well-nested structures with gap degree bounded by any constant k and a new class of structures with gap degree up to k that includes some ill-nested structures. The third case includes all the gap degree k structures in a number of dependency treebanks. 1 Introduction Dependency parsers analyse a sentence in terms of a set of directed links dependencies expressing the head-modifier and head-complement relationships which form the basis of predicate argument structure. We take dependency structures to be directed trees where each node corresponds to a word and the root of the tree marks the syntactic head of the sentence. For reasons of efficiency many practical implementations of dependency parsing are restricted to projective structures in which the subtree rooted at each word covers a contiguous substring of the sentence. However while free word order languages such as Czech do not satisfy this constraint parsing without the projectivity constraint is computationally complex. Although it is possible to parse non-projective structures in quadratic time under a model in which each dependency decision is independent of all the others McDonald et al. 2005 Partially supported by MEC and FEDER HUM2007-66607-C04 and Xunta de Galicia PGIDIT07SiNo05206PR INCITE08E1R104022ES INCiTe08ENA305025ES IN-CITE08PXIB302179PR Rede Galega de Proc. da Linguaxe e RI Bolsas para Estadias INCITE - FSE cofinanced . the problem

• Báo cáo khoa học
• Parsing Mildly Non projective
• Dependency Structures
• Long Papers
• scientific reports
• model language
• process natural language
• Dialog Control
• Natural Language System
• Dialog Control in a Natural Language System
• Expanding the Horizons
• Natural Language Interfaces
• Phil Hayes
• PROSPECTS OR PRACTICAL
• NATURAL LANGUAGE SYSTEMS
• Workshops
• NATURAL LANGUAGE
• INTERACTION WITH MACHINES
• COMPUTER INTEBFACE DESIGN MURRAY TUROFF DEPARTMENT OF COMPUTER
• IiVFORMATION SCIENCE IIEW JERSEY INSTITUTE OF TECHNOLOGY
• EVALUATION OF NATURAL LANGUAGE
• INTERFACES TO DATABASE SYSTEMS
• A PANEL DISCUSSION
• database query system
• J
• Norwood Crout
• INTERFACES TO DATA BASE SYSTEMS
• Bozena Henisz
• INTERPRETING NATURAL LANGUAGE
• DATABASE UPDATES
• S
• Jermld Kaplan Jim David
• TRANSPORTABLE NATURAL LANGUAGE
• INTERFACES TO DATABASES
• Gary G
• Hendrlx and William H
• Lewis
• DATABASES THEORETICAL
• TECHNICAL ISSUES
• TRANSPORTABLE NATURAL LANGUAGE INTERFACES
• PROBLEMS AND TECHNIQUES
• Barbara J
• Grosz
• THEORETICAL TECHNICAL ISSUES
• NATURAL LANGUAGE ACCESS TO DATABASES
• R
• Petrick
• Domain Independent
• Database Access Systems
• ISSUES IN NATURAL LANGUAGE
• ACCESS TO DATABASES
• A LOGIC PROGRAMMING PERSPECTIVE
• Sharon C
• Salveter David Maier
• PLANNING NATURAL LANGUAGE
• EXPRESSIONS REFERRING
• Douglas E
• Appelt
• THE TEXT SYSTEM
• NATURAL LANGUAGE GENERATION
• Kathleen R
• M
• MENTING A DATABASE
• KNOWLEDGE REPRESENTATION
• THE KEY TO THE SELECTION PROBLEM
• E
• Jeffrey Conklin David D
• McDonald
• A KNOWLEDGE ENGINEERING
• NATURAL LANGUAGE UNDERSTANDING
• Stuart C
• Shapiro
• NATURAL LANGUAGE TEXTS
• NECESSARILY GRAMMATICAL
• EVEN COMPLETE
• UNGRAMHATICALITY
• EXTRA GRAMMATICALITY
• NATURAL LANGUAGE UNDERSTANDING SYSTEMS
• Taxonomy
• Descriptions
• Individuals in Natural
• Language Understanding
• The Use of Ooject Special Knowledge
• Natural Language Processing
• Mark H
• Bursteln