TAILIEUCHUNG - Báo cáo khoa học: "A PARSING METHOD OR INFLECTIONAL FREE WORD ORDER LAN"

This paper presents a parser of an inflectional free word order language, namely Finnish. Two-way finite automata are used to specify a functional dependency grammar and to actually parse Finnish sentences. Each automaton gives a functional description of a dependency structure within a constituent. Dynamic local control of the parser is realized by augmenting the automata with simple operations to make the automata, associated with the words of an input sentence, activate one another. | TWO-WAY FINITE AUTOMATA AND DEPENDENCY GRAM4AR A PARSING METHOD EUR INFLECTIONAL EREE WORD ORDER IANGUAGESÌ Esa Nelimarkka Harri Jappinen and Aamo Lehtola Helsinki University of Technology Helsinki Finland ABSTRACT This paper presents a parser of an inflectional free word order language namely Finnish. Two-way finite automata are used to specify a functional dependency grairnar and to actually parse Finnish sentences. Each automaton gives a functional description of a dependency structure within a constituent. Dynamic local control of the parser is realized by augmenting the automata with simple operations to make the automata associated with the words of an input sentence activate one another. I INTRODUCTION This paper introduces a computational model for the description and analysis of an inflectional free word order language namely Finnish. We argue that such a language can be conveniently described in the framework of a functional dependency grammar which uses formally defined syntactic functions to specify dependency structures and deep case relations to introduce semantics into syntax. We show how such a functional grarrtnar can be compactly and efficiently modelled with finite two-way automata which recognize the dependants of a word in various syntactic functions on its both sides and build corresponding dependency structures. The automata along with formal descriptions of the functions define the graimar. The functional structure specifications are augmented with simple control instructions so that the automata associated with the words of an input sentence actually parse the sentence. This gives a strategy of local decisions resulting in a strongly data driven left-to-right and bottom-up parse. A parser based on this model is being implemented as a conponent of a Finnish natural language data base interface where it follows a separate morphological analyzer. Hence throughout the paper vre assume that all relevant morphological and lexical information has

• Báo cáo khoa học
• A PARSING METHOD
• INFLECTIONAL FREE WORD ORDER LAN
• Esa Nelimarkka
• scientific reports
• model language
• process natural language
• A Tabulation Based Parsing Method
• Reduces Copying
• Gerald Penn and Cosmin Munteanu
• báo cáo khoa học
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• An Earley style Predictive
• Chart Parsing Method
• Lambek Grammars
• 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