splitSVM: Fast, space-efficient, non-heuristic, polynomial kernel computation for NLP applications

Yoav Goldberg, Michael Elhadad

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)237-240
Number of pages4
JournalProceedings of the Annual Meeting of the Association for Computational Linguistics
StatePublished - 1 Jan 2008
Event46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ACL 2008 - Columbus, United States
Duration: 16 Jun 200817 Jun 2008

ASJC Scopus subject areas

  • Computer Science Applications
  • Linguistics and Language
  • Language and Linguistics

Fingerprint

Dive into the research topics of 'splitSVM: Fast, space-efficient, non-heuristic, polynomial kernel computation for NLP applications'. Together they form a unique fingerprint.

Cite this