diff --git a/docs/docs/optimization.xml b/docs/docs/optimization.xml
index 7f34582cd..9fe27b014 100644
--- a/docs/docs/optimization.xml
+++ b/docs/docs/optimization.xml
@@ -53,6 +53,7 @@
- find_max_factor_graph_nmplp
- find_max_factor_graph_viterbi
- find_max_factor_graph_potts
+ - find_max_parse_cky
- min_cut
@@ -76,6 +77,7 @@
- line_search
- graph_cut_score
- potts_model_score
+ - parse_tree_to_string
@@ -524,6 +526,33 @@ However, for graphs with cycles, the solution may be approximate.
+
+ find_max_parse_cky
+ dlib/optimization.h
+ dlib/optimization/find_max_parse_cky_abstract.h
+
+ This function implements the CKY parsing algorithm. In particular, it
+ finds the maximum scoring binary parse tree that parses an input sequence of tokens.
+
+
+
+
+
+
+
+ parse_tree_to_string
+ dlib/optimization.h
+ dlib/optimization/find_max_parse_cky_abstract.h
+
+ This is a pair of functions useful for converting a parse tree output by
+ find_max_parse_cky into a bracketed string
+ suitable for displaying the parse tree.
+
+
+
+
+
+
find_max_factor_graph_viterbi
dlib/optimization.h
diff --git a/docs/docs/term_index.xml b/docs/docs/term_index.xml
index ef20603ac..58e6f7236 100644
--- a/docs/docs/term_index.xml
+++ b/docs/docs/term_index.xml
@@ -82,6 +82,14 @@
+
+
+
+
+
+
+
+