Abstract
The fastest parsers currently can parse an average sentence in up to 2.5ms, a considerable improvement, since most of the older accuracy-oriented parsers parse only few sentences per second. It is generally accepted that the complexity of a parsing algorithm is decisive for the performance of a parser. However, we show that the most time consuming part of processing is feature extraction and therefore an algorithm which allows efficient feature extraction can outperform a less complex algorithm which does not. Our system based on quadratic Covington’s parsing strategy with efficient feature extraction is able to parse an average English sentence in only 0.8ms without any parallelisation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bohnet, B.: Top Accuracy and Fast Dependency Parsing is not a Contradiction. In: COLING 2010, Beijing, China (2010)
Buchholz, S., Marsi, E.: CoNLL-X shared task on multilingual dependency parsing. In: Proceedings of CONLL-X, New York, pp. 149–164 (2006)
Choi, J.D., Palmer, M.: Getting the Most out of Transition-based Dependency Parsing. In: ACL: HLT 2011, Portland, Oregon, USA, pp. 687–692 (2011)
Covington, M.A.: A Fundamental Algorithm for Dependency Parsing. In: Proceedings of the 39th Annual ACM Southeast Conference (2000)
Klein, D., Manning, C.D.: Accurate Unlexicalized Parsing. In: ACL 2003, pp. 423–430 (2003)
McDonald, R., Pereira, F., Ribarov, K., Hajič, J.: Non-Projective Dependency Parsing using Spanning Tree Algorithms. In: HLT 2005 (2005)
Nivre, J.: Inductive Dependency Parsing (Text, Speech and Language Technology). Springer-Verlag New York, Inc., Secaucus (2006)
Surdeanu, M., Manning, C.D.: Ensemble Models for Dependency Parsing: Cheap and Good? In: NAACL 2010 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Volokh, A., Neumann, G. (2012). Dependency Parsing with Efficient Feature Extraction. In: Glimm, B., Krüger, A. (eds) KI 2012: Advances in Artificial Intelligence. KI 2012. Lecture Notes in Computer Science(), vol 7526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33347-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-33347-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33346-0
Online ISBN: 978-3-642-33347-7
eBook Packages: Computer ScienceComputer Science (R0)