Please use this identifier to cite or link to this item:
|Title:||Tree sequence kernel for natural language|
|Authors:||Sun, J. |
|Source:||Sun, J.,Zhang, M.,Tan, C.L. (2011). Tree sequence kernel for natural language. Proceedings of the National Conference on Artificial Intelligence 1 : 921-926. ScholarBank@NUS Repository.|
|Abstract:||We propose Tree Sequence Kernel (TSK), which implicitly exhausts the structure features of a sequence of subtrees embedded in the phrasal parse tree. By incorporating the capability of sequence kernel, TSK enriches tree kernel with tree sequence features so that it may provide additional useful patterns for machine learning applications. Two approaches of penalizing the substructures are proposed and both can be accomplished by efficient algorithms via dynamic programming. Evaluations are performed on two natural language tasks, i.e. Question Classification and Relation Extraction. Experimental results suggest that TSK outperforms tree kernel for both tasks, which also reveals that the structure features made up of multiple subtrees are effective and play a complementary role to the single tree structure. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.|
|Source Title:||Proceedings of the National Conference on Artificial Intelligence|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.