We present a fast, space efficient and non-heuristic method for calculating the decision function of polynomial kernel classifiers for NLP applications. We apply the method to the MaltParser system, resulting in a Java parser that parses over 50 sentences per second on modest hardware without loss of accuracy (a 30 time speedup over existing methods). The method implementation is available as the open-source splitSVM Java library.
|Number of pages||4|
|Journal||Proceedings of the Annual Meeting of the Association for Computational Linguistics|
|State||Published - 2008|
|Event||46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL 2008 - Columbus, United States|
Duration: 16 Jun 2008 → 17 Jun 2008
Bibliographical notePublisher Copyright:
© 2008 Association for Computational Linguistics.