Tree Kernel Function Induction Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ". __N" to ". ---- __N") |
m (Text replacement - "---- __NOTOC__" to "---- __NOTOC__") |
||
| Line 16: | Line 16: | ||
---- | ---- | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Stub]] | [[Category:Stub]] | ||
Latest revision as of 04:18, 9 March 2021
See: Random Forest Tree Induction Algorithm, Tree Kernel Function, Induction Algorithm.
References
2004
- (Moschitti, 2004) ⇒ Alessandro Moschitti. A study on Convolution Kernel for Shallow Semantic Parsing. In: Proceedings of the 42-th Conference on Association for Computational Linguistic (ACL-2004), Barcelona, Spain, 2004.
2002
- (Collins & Duffy, 2002) ⇒ Michael Collins, and Nigel Duffy (2002) New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In ACL02, 2002.
2002
- (Vishwanathan & Smola, 2002) ⇒ S.V.N. Vishwanathan and A.J. Smola. Fast kernels on strings and trees.