Optimizing Dependency Parsing Throughput

Albert Weichselbraun, Norman Süsstrunk

2015

Abstract

Dependency parsing is considered a key technology for improving information extraction tasks. Research indicates that dependency parsers spend more than 95% of their total runtime on feature computations. Based on this insight, this paper investigates the potential of improving parsing throughput by designing feature representations which are optimized for combining single features to more complex feature templates and by optimizing parser constraints. Applying these techniques to MDParser increased its throughput four fold, yielding Syntactic Parser, a dependency parser that outperforms comparable approaches by factor 25 to 400.

References

  1. Bohnet, B. (2010). Very High Accuracy and Fast Dependency Parsing is Not a Contradiction. In Proceedings of the 23rd International Conference on Computational Linguistics, COLING 7810, pages 89-97, 6A Web demo of Syntactic Parser is available at demo.semanticlab.net/syntactic-parser. A runnable version of the parser may be obtained from the authors for scientific purposes.
  2. Chen, D. and Manning, C. (2014). A Fast and Accurate Dependency Parser using Neural Networks. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP 2014), pages 740-750, Doha, Qatar. Association for Computational Linguistics.
  3. Choi, J. D. and Palmer, M. (2011). Getting the Most out of Transition-based Dependency Parsing. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: Short Papers - Volume 2, HLT 7811, pages 687-692, Stroudsburg, PA, USA. Association for Computational Linguistics.
  4. Covington, M. A. (2001). A fundamental algorithm for dependency parsing. In In Proceedings of the 39th Annual ACM Southeast Conference, pages 95-102.
  5. Gindl, S., Weichselbraun, A., and Scharl, A. (2013). Rulebased opinion target and aspect extraction to acquire affective knowledge. In First WWW Workshop on Multidisciplinary Approaches to Big Social Data Analysis (MABSDA 2013), Rio de Janeiro, Brazil.
  6. He, H., III, H. D., and Eisner, J. (2013). Dynamic Feature Selection for Dependency Parsing. In Empirical Methods in Natural Language Processing (EMNLP 2013).
  7. McDonald, R., Lerman, K., and Pereira, F. (2006). Multilingual Dependency Parsing with a Two-Stage Discriminative Parser. In Tenth Conference on Computational Natural Language Learning (CoNLL-X).
  8. McDonald, R. and Pereira, F. (2006). Online learning of approximate dependency parsing algorithms. In Proceedings of 11th Conference of the European Chapter of the Association for Computational Linguistics (EACL-2006)), volume 6, pages 81-88.
  9. Nivre, J. (2008). Algorithms for Deterministic Incremental Dependency Parsing. Computer Linguistics, 34(4):513-553.
  10. Nivre, J. (2009). Non-projective Dependency Parsing in Expected Linear Time. In Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1, ACL 7809, pages 351-359, Stroudsburg, PA, USA. Association for Computational Linguistics.
  11. Nivre, J. and McDonald, R. (2008). Integrating GraphBased and Transition-Based Dependency Parsers. In Proceedings of ACL-08: HLT, pages 950-958, Columbus, Ohio. Association for Computational Linguistics.
  12. Nivre, J., Rimell, L., McDonald, R., and Gómez-Rodríguez, C. (2010). Evaluation of Dependency Parsers on Unbounded Dependencies. In Proceedings of the 23rd International Conference on Computational Linguistics, COLING 7810, pages 833-841, Stroudsburg, PA, USA. Association for Computational Linguistics.
  13. Poria, S., Agarwal, B., Gelbukh, A., Hussain, A., and Howard, N. (2014). Dependency-based semantic parsing for concept-level text analysis. In Gelbukh, A., editor, Computational Linguistics and Intelligent Text Processing, number 8403 in Lecture Notes in Computer Science, pages 113-127. Springer Berlin Heidelberg.
  14. Qiu, G., Liu, B., Bu, J., and Chen, C. (2011). Opinion Word Expansion and Target Extraction through Double Propagation. Computational Linguistics, 37(1):9- 27.
  15. Volokh, A. (2013). Performance-oriented dependency parsing. PhD Thesis, Saarland University.
  16. Volokh, A. and Neumann, G. (2012). Dependency Parsing with Efficient Feature Extraction. In Glimm, B. and Krüger, A., editors, KI 2012: Advances in Artificial Intelligence, number 7526 in Lecture Notes in Computer Science, pages 253-256. Springer Berlin Heidelberg.
Download


Paper Citation


in Harvard Style

Weichselbraun A. and Süsstrunk N. (2015). Optimizing Dependency Parsing Throughput . In Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2015) ISBN 978-989-758-158-8, pages 511-516. DOI: 10.5220/0005638905110516


in Bibtex Style

@conference{kdir15,
author={Albert Weichselbraun and Norman Süsstrunk},
title={Optimizing Dependency Parsing Throughput},
booktitle={Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2015)},
year={2015},
pages={511-516},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005638905110516},
isbn={978-989-758-158-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 1: KDIR, (IC3K 2015)
TI - Optimizing Dependency Parsing Throughput
SN - 978-989-758-158-8
AU - Weichselbraun A.
AU - Süsstrunk N.
PY - 2015
SP - 511
EP - 516
DO - 10.5220/0005638905110516