Jump to content

Tree kernel

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Qwertyus (talk | contribs) at 05:48, 8 August 2013 (stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In machine learning, a tree kernel is a kernel function that computes a similarity score between two trees. Such kernels find applications in natural language processing, where they can be used for machine-learned parsing.[1]

References

  1. ^ Collins, Michael; Duffy, Nigel (2001). Convolution kernels for natural language. Advances in Neural Information Processing Systems.

See also