
מיכאל אלחדד
אקדמי בכיר
splitSVM
Fast, Space-efficient, non-Heuristic, polynomial kernel computation for NLP applications
We present a fast, space efficient and nonheuristic 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.
| שפת פרסום | אנגלית |
| דפים | 237-240 |
| סטטוס פרסום | פורסם - 01.12.2008 |
ASJC Scopus subject areas
Language and Linguistics
Computer Networks and Communications
Linguistics and Language