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

소규모 문맥 자유 문법에 대한 Left-Corner / Look-Ahead 차트 파싱 알고리즘의 성능 평가

  • Published : 2009.07.15

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.

차트 파싱 알고리즘에서 left-corner와 look-ahead 정보를 이용하여 불필요한 중간 구조가 생성되지 않도록 함으로써 파싱 속도를 향상시키는 방법이 제안된 바 있다. left-corner와 look-ahead 정보를 이용할 경우 불필요한 중간 구조가 생성되지 않으므로 파싱 속도가 빨라지겠지만 이러한 정보를 유지 관리하고 참조하는 데 따른 추가 비용이 발생한다. 이러한 추가 비용이 발생함에도 불구하고 대규모 문법을 사용하여 파싱을 할 때에는 파싱 속도가 상당한 많이 향상되었다는 연구 결과가 있었다. 본 논문에서 는 소규모 문법을 사용했을 때 파싱 속도가 어느 정도 향상되는가를 관찰하는 실험을 하였다. 실험 결과 소규모의 문법에서는 파싱 속도 향상 정도가 상대적으로 낮았으며 left-corner 정보는 파싱 속도를 향상 시키는 것이 아니라 오히려 저해한다는 사실을 알 수 있었다.

Keywords

References

  1. Masaru Tomita, 'An Efficient Augmented-Context-Free Parsing Algorithm,' Computational Linguistics, vol.13, no.1-2, pp.31-46, 1987
  2. 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
  3. 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
  4. Martin Kay, 'Algorithm schemata and data structures in syntactic processing,' Technical Report CSL80-12, Xerox PARC, Palo Alto, 1980
  5. 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
  6. 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 https://doi.org/10.1145/357103.357112
  7. James Allen, Natural Language Understanding, 2nd edition, The Benjamin/Cummings Publishing Company, Inc., 1995
  8. Daniel Jurafsky and James Martin, Speech and Language Processing, Prentice Hall, 2000
  9. 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 https://doi.org/10.3115/976744.976780
  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 https://doi.org/10.3115/1034678.1034743
  11. 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 https://doi.org/10.3115/991719.991739
  12. 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
  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. Bob Moore, 'Parser Comparison - Context-Free Grammar (CFG) Data,' http://www.informatics.sussex.ac.uk/research/groups/nlp/carroll/cfg- resources/index.html
  15. 심광섭, 양재형, '자질 기반 구 구조 문법을 위한 문법개발 환경', 한국정보과학회논문지 : 소프트웨어 및 응용, 31권 10호, pp.1418-1429, 2004
  16. 시스템설계 : 중한자동번역시스템 (v1.0), 음성/언어정보연구센터, 한국전자통신연구원, 2006