TAILIEUCHUNG - Báo cáo khoa học: "On Parsing Strategies and Closure"

This paper proposes a welcome hypothesis: a computationally simple device z is sufficient for processing natural language. Traditionally it has been argued that processing natural language syntax requires very powerful machinery. Many engineers have come to this rather grim conclusion; almost all working parers are actually Turing Machines (TM). | On Parsing Strategies and Closure1 Kenneth Church MIT Cambridge MA 02139 This paper proposes a welcome hypothesis a computationally simple device2 3 is sufficient for processing natural language. Traditionally it has been argued that processing natural language syntax requires very powerful machinery. Many engineers have come to this rather grim conclusion almost all working parsers are actually Turing Machines TM . For example. Woods believed that a parser should have TM complexity and specifically designed his Augmented Transition Networks ATNs to be Turing Equivalent. 1 It is. well known cf. Chomsky64 that the strict context-free grammar model is not an adequate mechanism for characterizing the subtleties of natural languages. Woods70 If the problem is really as hard as it appears then the only solution is to grin and bear it. Our own position is that parsing acceptable sentences is simpler because there are constraints on human performance that drastically reduce the computational complexity. Although Woods correctly observes that competence models are very complex this observation may not apply directly to a performance problem such as parsing The claim is that performance limitations actually reduce parsing complexity. This suggests two interesting questions a How is the performance mode constrained so as to reduce its complexity and b How can the constrained performance model naturally approximate competence idealizations 1. The FS Hypothesis We assume a severe processing limitation on available short term memory STM as commonly suggested in the psycholinguistic literature Frazier79 Frazier and Fodor79 Cowper76 Kimball73 75 . Technically a machine with limited memory is a finite state machine FSM which has very good complexity bounds compared to a TM. 1. I would like to thank Peter Szolovits Mitch Marcus Bill Martin Bob Berwick Joan Bresnan Jon Allen Ramesh Patil Bill Swartout Jay Keyser Ken Wexler Howard Lasnik Dave McDonald Per-Kristian Halvorsen and .

• Báo cáo khoa học
• On Parsing Strategies
• Closure
• Kenneth Church
• scientific reports
• model language
• process natural language
• Discriminative Strategies
• Integrate Multiword Expression Recognition and Parsing
• Matthieu Constant
• báo cáo khoa học
• báo cáo ngôn ngữ
• ngôn ngữ tự nhiên
• Probabilistic Parsing Strategies
• Mark Jan Nederhof
• Long Papers
• mô hình ngôn ngữ
• xử lý ngôn ngữ tự nhiên
• A Practical Comparison
• Parsing Strategies
• Jonathan Slocum Siemens
• A Comparison of Rule Invocation Strategies
• Context Free Chart Parsing
• Mats Wirdn
• 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