Their kernel is also very time consuming and in their more general sparse setting it requires O ( mn3 ) time and O ( mn2 ) space , where m and n are the number of nodes of the two trees ( m > = n ) ( Zelenko et al. , 2003 ) .
kernel methods for relation extraction
D Zelenko C Aone A Richardella
In contrast , our dependency-based word subsequence kernel , which also computes similarity between two dependency trees , is very transparent with the implicit features being simply the dependency paths . Their kernel is also very time consuming and in their more general sparse setting it requires O ( mn3 ) time and O ( mn2 ) space , where m and n are the number of nodes of the two trees ( m > = n ) ( Zelenko et al. , 2003 ) . Bunescu and Mooney ( 2005a ) give a shortest path dependency kernel for relation extraction .
Their kernel is also very time consuming and in their more general sparse setting it requires O ( mn3 ) time and O ( mn2 ) space , where m and n are the number of nodes of the two trees ( m > = n ) ( @@CITATION ) .