Browse > Article

Performance Evaluation of Left-Comer and Look-Ahead Chart Parsing for Small-Sized Context Free Grammar  

Shim, Kwang-Seob (성신여자대학교 IT학부)
Publication Information
Journal of KIISE:Software and Applications / v.36, no.7, 2009 , pp. 571-579 More about this Journal
Abstract
A left-comer and look-ahead chart parsing algorithm suppresses the generation of meaningless intermediate structures, and thus, gains parsing speed-ups. However, the algorithm requires additional costs to maintain left-comer and look-ahead information throughout the parsing process. Albeit the additional costs, previous research shows that significant parsing speed-ups have been achieved for large-sized context-free grammars. In this paper, we perform similar experiments with a small-sized grammar. We still get parsing speed-ups, but relatively low. We also find that left-comer information has rather negative effects on parsing speed-ups.
Keywords
left-comer; look-ahead; chart parsing; performance comparison;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Masaru Tomita, 'An Efficient Augmented-Context-Free Parsing Algorithm,' Computational Linguistics, vol.13, no.1-2, pp.31-46, 1987
2 T. Kasammi, 'An efficient recognition and syntax analysis algorithm for context-free language,' Technical Report AFCRL-65-758, Air Force Cambridge Research Laboratory, Bedford, Messachusetts, 1965
3 Mark-Jan Nederhof, 'Generalized left-corner Parsing,' Proceedings of the sixth conference on European Chapter of the Association for Computational Linguistics, pp.305-314, 1993   DOI
4 Hiroyasu Nogami, Yumiko Yoshimura and Shinya Amano, 'Parsing with look-ahead in real-time on-line translation system,' Proceedings of the 12th conference on Computational Linguistics, pp.488-493, 1988   DOI
5 Paul W Placeway, 'Tree-Structured Chart Parsing with left-corner and look-ahead Constraints,' CMU-LTI-00-161, Language Technologies Institute, School of Computer Science, Carnegie Mellon University, 2000
6 Xinying Song, Shilin Ding and Chin-Yew Lin, 'Better Binarization for the CKY Parsing,' Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing, pp.167-176, 2008
7 심광섭, 양재형, '자질 기반 구 구조 문법을 위한 문법개발 환경', 한국정보과학회논문지 : 소프트웨어 및 응용, 31권 10호, pp.1418-1429, 2004   과학기술학회마을
8 시스템설계 : 중한자동번역시스템 (v1.0), 음성/언어정보연구센터, 한국전자통신연구원, 2006
9 Susan Graham, Michael Harrison and Walter Ruzzo, 'An Improved Context-Free Recognizer,' ACM Transactions on Programming Language and Systems, vol.2, no.3, pp.415-462, 1980   DOI
10 Brian Roark and Mark Johnson, 'Efficient probabilistic top-down and left-corner parsing,' Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, pp.421-428, 1999   DOI
11 Martin Kay, 'Algorithm schemata and data structures in syntactic processing,' Technical Report CSL80-12, Xerox PARC, Palo Alto, 1980
12 Bob Moore, 'Parser Comparison - Context-Free Grammar (CFG) Data,' http://www.informatics.sussex.ac.uk/research/groups/nlp/carroll/cfg- resources/index.html
13 Robert C. Moore, 'Improved left-corner Chart Parsing for Large Context-Free Grammar,' New Developments in parsing Technology, Kluwer Academic Publishers, pp.185-201, 2004
14 Eugene Charniak, Sharon Goldwater and Mark Johnson, 'Edge-based best-first chart parsing,' Proceedings of the Sixth Workshop on Very Large Corpora, pp.127-133, 1998
15 James Allen, Natural Language Understanding, 2nd edition, The Benjamin/Cummings Publishing Company, Inc., 1995
16 Daniel Jurafsky and James Martin, Speech and Language Processing, Prentice Hall, 2000