Liuliu writeup of Bunescu 2006

From Cohen Courses
Revision as of 10:42, 3 September 2010 by WikiAdmin (talk | contribs) (1 revision)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

This is a review of Bunescu_2006_subsequence_kernels_for_relation_extraction by user:Liuliu.

This paper is about extracting entity relations by using a subsequence kernel. This paper is a very similar to the Bunescu 2005 paper.

  • They both use kernel method: [Bunescu 2005] uses a shortest path dependency kernel while [Bunescu 2006] uses a subsequence kernel.
  • Both kernels uses some patterns: [Bunescu 2005] uses predicate-argument structure, head-modifier dependency; while [Bunescu 2006] uses three subsequence patterns: fore-between, between, between-after
  • Both use feature vectors and combines rich knowledge of syntactic and semantic information
  • Both use kernel function and SVM due to the high dimensionality of feature space