TAILIEUCHUNG - Báo cáo khoa học: "Towards efficient parsing with proof-nets"

This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actually a mere conservative extension of the earlier method of syntactic connexion, discovered by Ajduckiewicz [1935]. The method amounts to find alternating spanning trees in graphs. A sketch of an algorithm for finding such a tree is provided. Interesting properties of time-complexity for this method are expected. It has some similarities with chart-parsing ([KOnig, 1991, 1992], [Hepple, 1992]) but is different at least in the fact that intervals are here edges and words are vertices. | Towards efficient parsing with proof-nets Alain Lecomte GRIL Université Blaise Pascal 63037-Clermont-Ferrand France email lecomte@ Abstract This paper presents a method for parsing associative Lambek grammars based on graph-theoretic properties. Connection graphs which are a simplified version of proof-nets are actually a mere conservative extension of the earlier method of syntactic connexion discovered by Ajduckiewicz 1935 . The method amounts to find alternating spanning frees in graphs. A sketch of an algorithm for finding such a tree is provided. Interesting properties of time-complexity for this method are expected. It has some similarities with chart-parsing Kõnig 1991 1992 Hepple 1992 but is different at least in the fact that intervals are here edges and words are vertices or trees instead of the contrary in classical chartparsing. 1 Introduction In this paper we present a method for parsing Lambek grammars based on graph-theoretic properties. We expect that it may be done efficiently by an algorithm time-polynomial even in the worst case which aims at finding an alternating spanning tree in a graph. We do not give the explicit formulation of such an algorithm in this paper we will only give an idea and an illustration of it. This paper is thus mostly devoted to the properties on which the method is based. We call connection graphs the special kind of proof-nets we explore just in order to make explicit some difference with the usual method of proof-nets as it can be found in Roorda 1991 1992 and Moortgat 1992 but the two concepts are very similar. In many respects connection graphs are a mere conservative extension of the earlier method of syntactic connection discovered by Ajduckiewicz 1935 . The method amounts to link the nodes of an ordered sequence of trees in such a way that properties of connexion non overlapping acyclicity and strong connectivity are verified. Connection graphs are simpler than proof-nets in that they loose some .

• Báo cáo khoa học
• Towards efficient parsing
• proof nets
• 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