D11-1047 extension of the algorithm for approximate matching of treelets . We consider that
C96-2121 them from the tree-bank using approximate matching . I , ; xeeution dines are l
J14-4004 and ACE evaluations , consider approximate matching of mention spans . However ,
J02-2001 lexical-choice algorithm based on the approximate matching of lexical representations to
E12-1036 unlabeled data using exact and approximate matching over multiple representations
C96-2121 different sentences are retrieved by approximate matching , a fourth one can be built by
N13-1005 new documents . So we used an approximate matching scheme that required each word
P06-1104 partial rule matching and other approximate matching mechanisms in the parse tree
P03-1005 , SSK ' and HDAG Kernel offer approximate matching which produces better performance
P07-1026 2 : Grammar-driven tree nodes approximate matching . The conventional tree kernel
P07-1026 Improvement 1 : Grammar-driven approximate matching between substructures . The conventional
P03-1005 element . This framework achieves approximate matching of the structure au - tomatically
P07-1026 , we propose a grammar-driven approximate matching mechanism to capture the similarity
C96-2121 under it have been obtained by approximate matching . Knowing the respective distances
P03-1005 matching of sub-structures but also approximate matching , we allow node skips according
N13-1018 judgments . R-precision normalizes the approximate matching score by the maximum number of
C96-2121 edition of text with trees , allows approximate matching on trees , and generation is
N07-3009 precision . We 'd like to allow approximate matching of a query 's phone sequence
J96-1003 1989 ) describe algorithms for approximate matching to regular expressions with arbitrary
P07-1026 sub-trees r1 and r2 . Under the new approximate matching mecha - nism , two structures
hide detail