TAILIEUCHUNG - Báo cáo khoa học: "A Cascaded Finite-State Parser for Syntactic Analysis of Swedish"

This report describes the development of a parsing system for written Swedish and is focused on a grammar, the main component of the system, semiautomatically extracted from corpora. A cascaded, finite-state algorithm is applied to the grammar in which the input contains coarse-grained semantic class information, and the output produced reflects not only the syntactic structure of the input, but grammatical functions as well. The grammar has been tested on a variety of random samples of different text genres, achieving precision and recall of and respectively, and average crossing rate of , when evaluated against manually. | Proceedings of EACL 99 A Cascaded Finite-State Parser for Syntactic Analysis of Swedish Dimitrios Kokkinakis and Sofie Johansson Kokkinakis Department of Swedish Sprakdata Box 200 SE-405 30 Goteborg University Goteborg Sweden svedk svesj @ Abstract This report describes the development of a parsing system for written Swedish and is focused on a grammar the main component of the system semi-automatically extracted from corpora. A cascaded finite-state algorithm is applied to the grammar in which the input contains coarse-grained semantic class information and the output produced reflects not only the syntactic structure of the input but grammatical functions as well. The grammar has been tested on a variety of random samples of different text genres achieving precision and recall of and respectively and average crossing rate of when evaluated against manually disambiguated annotated texts. 1 Introduction This report describes a parsing system for fast and accurate analysis of large bodies of written Swedish. The grammar has been implemented in a modular fashion as finite-state cascaded machines henceforth called Cass-SWE a name adopted from the parser used Cascaded analysis of syntactic structure Abney 1996 . Cass-SWE operates on part-of-speech annotated texts and is coupled with a pre-processing mechanism which distinguishes thousands of phrasal verbs idioms and multi-word expressions. Cass-SWE is designed in such a way that semantic information inherited by named-entity NE identification software is taken under consideration and grammatical functions are extracted heuristically using finite-state transducers. The grammar has been manually acquired from open-source texts by observing legitimately adjacent part-of-speech chains and how and which function words sig nal boundaries between phrasal constituents and clauses. 2 Background Cascaded Finite-State Automata Finite-state technology has had a great impact on a variety of Natural

• Báo cáo khoa học
• A Cascaded Finite State Parser
• Syntactic Analysis of Swedish
• Dimitrios Kokkinakis
• 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
• Long Papers
• 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