chapter4 fig

Book/Chapter4/Figures/grid-search-1.tex

@@ -29,7 +29,7 @@
 
 \node [anchor=center,draw,circle,inner sep=1.5pt,blue!30,fill=blue!30] (f11) at ([xshift=0em,yshift=23em]y2.north) {};
 \node[anchor=south] (f12) at ([xshift=5em,yshift=-0.5em]f11.south) {\scriptsize{fixed}};
-\node [anchor=center,draw,circle,inner sep=1.5pt,purple!30,fill=ugreen!50] (f21) at ([xshift=0em,yshift=-4em]f11.north) {};
+\node [anchor=center,draw,circle,inner sep=1.5pt,ugreen!50,fill=ugreen!50] (f21) at ([xshift=0em,yshift=-4em]f11.north) {};
 \node[anchor=south] (f22) at ([xshift=8.5em,yshift=-0.5em]f21.south) {\scriptsize{valid choices}};
 \node [anchor=center,draw,circle,inner sep=1.5pt,red!30,fill=red!30] (f31) at ([xshift=0em,yshift=-4em]f21.north) {};
 \node[anchor=south] (f32) at ([xshift=9.5em,yshift=-0.5em]f31.south) {\scriptsize{invalid choices}};

Book/Chapter4/Figures/grid-search-2.tex

@@ -26,7 +26,7 @@
 \node [anchor=center,draw,circle,inner sep=1.5pt,red!30,fill=red!30] (r33) at (2,2) {};
 \node [anchor=center,draw,circle,inner sep=1.5pt,red!30,fill=red!30] (r35) at (2,1) {};
 
-\node [anchor=center,draw,circle,inner sep=1.5pt,purple!30,fill=purple!30] (r34) at (2,3) {};
+\node [anchor=center,draw,circle,inner sep=1.5pt,ugreen!50,fill=ugreen!50] (r34) at (2,3) {};
 
 \draw [-,very thick,red!50, dashed] (1,2) -- (2,4) -- (3,2) -- (2,3) -- (1,2) -- (3,2) -- (2,1) -- (1,2) -- (2,0) -- (3,2);
 \draw [-,very thick,blue!50] (0,1) -- (1,2);

Book/Chapter4/Figures/one-best-node-alignment-and-alignment-matrix.tex

@@ -105,7 +105,7 @@
 \end{flushright}
 \begin{center}
 \vspace{-1em}
-(a)节点对齐矩阵（1-best vs. Matrix）
+\footnotesize{(a)节点对齐矩阵（1-best vs. Matrix）}
 \end{center}
 
 \begin{center}
@@ -147,7 +147,7 @@
 
 \begin{center}
 \vspace{-2em}
-(b) 抽取得到的树到树翻译规则
+\footnotesize{(b) 抽取得到的树到树翻译规则}
 \end{center}
 
 \end{center}

Book/Chapter4/chapter4.tex

@@ -1653,7 +1653,7 @@ r_9: \quad \textrm{IP(}\textrm{NN}_1\ \textrm{VP}_2) \rightarrow \textrm{S(}\tex
 
 \subsubsection{树到串翻译规则}
 
-\parinterval 基于树结构的文法可以很好的表示两个树片段之间的对应关系，即树到树翻译规则。那树到串翻译规则该如何表示呢？实际上，基于树结构的文法也同样适用于树到串模型。比如，如下是一个树片段到串的映射，它可以被看作是树到串规则的一种表示。
+\parinterval 基于树结构的文法可以很好的表示两个树片段之间的对应关系，即树到树翻译规则。那树到串翻译规则该如何表示呢？实际上，基于树结构的文法也同样适用于树到串模型。比如，图\ref{fig:4-49}是一个树片段到串的映射，它可以被看作是树到串规则的一种表示。
 
 %----------------------------------------------
 \begin{figure}[htp]

Book/mt-book-xelatex.tex

@@ -125,9 +125,9 @@
 %\include{Chapter1/chapter1}
 %\include{Chapter2/chapter2}
 %\include{Chapter3/chapter3}
-%\include{Chapter4/chapter4}
+\include{Chapter4/chapter4}
 %\include{Chapter5/chapter5}
-\include{Chapter6/chapter6}
+%\include{Chapter6/chapter6}
 %\include{Chapter7/chapter7}
 %\include{ChapterAppend/chapterappend}