Syntactic analysis of natural languages based on context freegrammar backbone

The paper introduces libkp comparison and evaluation system for the syntactic processing of natural languages. The analysis of sentences is based on context free grammar for given language with contextual extensions (constraints). The tool is language-independent, even though it is optimized for very large and highly ambiguous grammars for Czech (thousands of rules). We discuss the advantages of our modular design as well as efficiency of the processing on the standard evaluation grammars. We also expect this system to be used for comparing and evaluating different CFG-parsing algorithms.

[1]  Geoffrey K. Pullum,et al.  Generalized Phrase Structure Grammar , 1985 .

[2]  Mark-Jan Nederhof,et al.  Increasing the Applicability of LR Parsing , 1993, IWPT.

[3]  Michael Collins,et al.  Three Generative, Lexicalised Models for Statistical Parsing , 1997, ACL.

[4]  Masaru Tomita,et al.  Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[5]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[6]  Jean-Cédric Chappelier,et al.  A Generalized CYK Algorithm for Parsing Stochastic CFG , 1998, TAPD.

[7]  Gertjan van Noord.  An Efficient Implementation of the Head-Corner Parser , 1997, CL.

[8]  Martin Kay,et al.  Head-Driven Parsing , 1989, IWPT.

[9]  Klaas Sikkel,et al.  Tomita's Algorithm: Extensions and Applications , 1991 .

[10]  Antinus Nijholt,et al.  Parallel approaches to context-free language parsing , 1994 .

[11]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[12]  Patrick Shann.  Experiments with GLR and Chart Parsing , 1991 .

[13]  Klaas Sikkel,et al.  Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms , 2002 .

[14]  Eugene Charniak,et al.  Statistical Parsing with a Context-Free Grammar and Word Statistics , 1997, AAAI/IAAI.

[15]  Ales Horák,et al.  Enhancing Best Analysis Selection and Parser Comparison , 2002, TSD.

[16]  Martin Plátek,et al.  An Implementation of Syntactic Analysis of Czech , 1995, IWPT.

[17]  Mark-Jan Nederhof,et al.  Generalized Left-Corner Parsing , 1993, EACL.

[18]  Eugene Charniak,et al.  A Maximum-Entropy-Inspired Parser , 2000, ANLP.

[19]  Giorgio Satta,et al.  Head-Driven Bidirectional Parsing: A Tabular Method , 1989, IWPT.

[20]  Walter L. Ruzzo,et al.  An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..

[21]  Daniel J. Rosenkrantz,et al.  Deterministic Left Corner Parsing (Extended Abstract) , 1970, SWAT.

[22]  Jochen Dörre,et al.  Memoization of Coroutined Constraints , 1995, ACL.

[23]  Donald E. Knuth,et al.  On the Translation of Languages from Left to Right , 1965, Inf. Control..

[24]  Robert C. Moore.  Time as a Measure of Parsing Efficiency , 2000, ELSPS.

[25]  René Leermakers,et al.  A Recursive Ascent Earley Parser , 1992, Inf. Process. Lett..

[26]  Martin Kay,et al.  Algorithm schemata and data structures in syntactic processing , 1986 .

[27]  Ales Horák,et al.  Large Scale Parsing of Czech , 2000, ELSPS.

[28]  Tadao Kasami,et al.  An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages , 1965 .

[29]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[30]  Robert C. Berwick,et al.  Computational complexity and natural language , 1987 .