diff --git a/docs/docs/optimization.xml b/docs/docs/optimization.xml index 9fe27b014..933b038f2 100644 --- a/docs/docs/optimization.xml +++ b/docs/docs/optimization.xml @@ -78,6 +78,7 @@ graph_cut_score potts_model_score parse_tree_to_string + find_trees_not_rooted_with_tag @@ -551,6 +552,25 @@ However, for graphs with cycles, the solution may be approximate. + + + + find_trees_not_rooted_with_tag + dlib/optimization.h + dlib/optimization/find_max_parse_cky_abstract.h + + Finds all the largest non-overlapping parse trees + in tree that are not rooted with a particular tag. +

+ This function is useful when you want to cut a parse tree + into a bunch of sub-trees and you know that the top level of the tree is all + composed of the same kind of tag. So if you want to just "slice off" the top + of the tree where this tag lives then this function is useful for doing that. +

+
+ +
+ diff --git a/docs/docs/term_index.xml b/docs/docs/term_index.xml index 58e6f7236..2f7bf2a39 100644 --- a/docs/docs/term_index.xml +++ b/docs/docs/term_index.xml @@ -84,6 +84,7 @@ +