Skip to content

M
mtbookv2
Commit 5f08fd52 by 单韦乔
Options

合并分支 'shanweiqiao' 到 'caorunzhe' 

第二章斜体

查看合并请求 !74
parents 017de444 797245e1
正在显示 包含 87 行增加 和 105 行删除
Chapter2/Figures/figure-example-of-greedy-search.tex
......@@ -29,12 +29,12 @@
\node[anchor=south,unit,text=red] (w3) at ([yshift=0.5em]n34.north){$w_3$};
\draw[->,ublue,very thick] (n11.east) -- (n21.west);
\draw[->,ublue,very thick] (n11.east) -- (n22.west);
% \draw[->,ublue,very thick,dashed] (n11.east) -- (n22.west);
\draw[->,ublue,very thick] (n11.east) -- (n23.west);
\draw[->,ublue,very thick] (pt22.south) -- (n34.west);
\draw[->,ublue,very thick] (pt22.south) -- (n35.west);
\draw[->,ublue,very thick] (pt22.south) -- (n36.west);
% \draw[->,ublue,very thick,dashed] (pt22.south) -- (n36.west);
% \draw[->,red,ultra thick,opacity=0.7,line width=2pt]([xshift=-1em]n11.west) -- (n11.east) -- (n22.west) -- (pt22.south) -- (n36.west) -- ([xshift=1em]pt36.south);
\draw[->,red,ultra thick,opacity=0.7,line width=2pt]([xshift=-1em]n11.west) -- (n11.west);
......
Chapter2/Figures/figure-full-probability-word-segmentation-3.tex
......@@ -11,16 +11,16 @@
\begin{tikzpicture}
\node [anchor=west] (label1) at (0,0) {总词数：$6 + 8 + 5 = 20$};
\node [anchor=north west] (p1) at (label1.south west) {$P(\textrm{很})=1/20=0.05$};
\node [anchor=north west] (p2) at (p1.south west) {$P(\textrm{。})=3/20=0.15$};
\node [anchor=north west] (p3) at (p2.south west) {$P(\textrm{确实})=1/20=0.05$};
\node [anchor=north west] (p1) at (label1.south west) {$\funp{P}(\textrm{很})=1/20=0.05$};
\node [anchor=north west] (p2) at (p1.south west) {$\funp{P}(\textrm{。})=3/20=0.15$};
\node [anchor=north west] (p3) at (p2.south west) {$\funp{P}(\textrm{确实})=1/20=0.05$};
\node [anchor=north west] (label11) at ([xshift=18.0em,yshift=1.63em]label1.south west) {更多数据-总词数:100K $\sim$ 1M};
\node [anchor=north west] (p12) at (label11.south west) {$P(\textrm{很})=0.000010$};
\node [anchor=north west] (p22) at (p12.south west) {$P(\textrm{。})=0.001812$};
\node [anchor=north west] (p32) at (p22.south west) {$P(\textrm{确实})=0.000001$};
\node [anchor=north west] (p12) at (label11.south west) {$\funp{P}(\textrm{很})=0.000010$};
\node [anchor=north west] (p22) at (p12.south west) {$\funp{P}(\textrm{。})=0.001812$};
\node [anchor=north west] (p32) at (p22.south west) {$\funp{P}(\textrm{确实})=0.000001$};
......
Chapter2/Figures/figure-self-information-function.tex
......@@ -3,8 +3,8 @@
\begin{axis}[
width=12cm,
height=4cm,
xlabel={{$P(x)$}},
ylabel={{$I(x)$}},
xlabel={{$\funp{P}(x)$}},
ylabel={{$\funp{I}(x)$}},
ylabel style={yshift=-1.5em,font=\footnotesize},
xlabel style={yshift=0.3em,font=\footnotesize},
xtick={0,0.2,...,1.0},
......@@ -23,7 +23,7 @@ xticklabel style={font=\small}, %坐标轴字体大小
yticklabel style={font=\small}
]
\addplot[draw=ublue,samples=100,thick] {-log2(x)};
\legend{\footnotesize{$I(x) = -\log P(x)$}}
\legend{\footnotesize{$\funp{I}(x) = -\log \funp{P}(x)$}}
\end{axis}
\end{tikzpicture}
......
Chapter2/Figures/figure-the-dice-game-model.tex
......@@ -13,7 +13,7 @@
\node [draw,thick,minimum size=10pt] at (\i,0) {1};
}
}
\node [anchor=west] at (33em,0) {$\textrm{P}(\text{1}) = 5/30$};
\node [anchor=west] at (33em,0) {$\funp{P}(\text{1}) = 5/30$};
\end{scope}
\begin{scope}[yshift=-2.5em]
......@@ -22,7 +22,7 @@
\node [draw,thick,minimum size=10pt] at (\i,0) {{\color{red} 2}};
}
}
\node [anchor=west] at (33em,0) {$\textrm{P}(\text{2}) = 4/30$};
\node [anchor=west] at (33em,0) {$\funp{P}(\text{2}) = 4/30$};
\end{scope}
\begin{scope}[yshift=-5.0em]
......@@ -31,7 +31,7 @@
\node [draw,thick,minimum size=10pt] at (\i,0) {{\color{ublue} 3}};
}
}
\node [anchor=west] at (33em,0) {$\textrm{P}(\text{3}) = 6/30$};
\node [anchor=west] at (33em,0) {$\funp{P}(\text{3}) = 6/30$};
\end{scope}
\begin{scope}[yshift=-7.5em]
......@@ -40,7 +40,7 @@
\node [draw,thick,minimum size=10pt] at (\i,0) {{\color{ugreen} 4}};
}
}
\node [anchor=west] at (33em,0) {$\textrm{P}(\text{4}) = 12/30$};
\node [anchor=west] at (33em,0) {$\funp{P}(\text{4}) = 12/30$};
\end{scope}
\begin{scope}[yshift=-10.0em]
......@@ -49,7 +49,7 @@
\node [draw,thick,minimum size=10pt] at (\i,0) {{\color{purple} 5}};
}
}
\node [anchor=west] at (33em,0) {$\textrm{P}(\text{5}) = 2/30$};
\node [anchor=west] at (33em,0) {$\funp{P}(\text{5}) = 2/30$};
\end{scope}
\begin{scope}[yshift=-12.5em]
......@@ -58,7 +58,7 @@
\node [draw,thick,minimum size=10pt] at (\i,0) {{\color{orange} 6}};
}
}
\node [anchor=west] at (33em,0) {$\textrm{P}(\text{6}) = 1/30$};
\node [anchor=west] at (33em,0) {$\funp{P}(\text{6}) = 1/30$};
\end{scope}
\end{tikzpicture}
......
bibliography-old.bib
......@@ -958,19 +958,11 @@
}
@article{huang2015bidirectional,
author = {Zhiheng Huang and
Wei Xu and
Kai Yu},
title = {Bidirectional {LSTM-CRF} Models for Sequence Tagging},
journal = {CoRR},
volume = {abs/1508.01991},
year = {2015},
//url = {http://arxiv.org/abs/1508.01991},
//archivePrefix = {arXiv},
//eprint = {1508.01991},
//timestamp = {Mon, 13 Aug 2018 16:46:46 +0200},
//biburl = {https://dblp.org/rec/journals/corr/HuangXY15.bib},
//bibsource = {dblp computer science bibliography, https://dblp.org}
title={Bidirectional LSTM-CRF Models for Sequence Tagging},
author={Zhiheng {Huang} and Wei {Xu} and Kai {Yu}},
journal={arXiv preprint arXiv:1508.01991},
//notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/1940872118",
year={2015}
}
@inproceedings{kneser1995improved,
author = {Reinhard Kneser and
......@@ -1161,34 +1153,28 @@
}
@book{russell2003artificial,
title="Artificial Intelligence : A Modern Approach",
author="Stuart J. {Russell} and Peter {Norvig}",
title={Artificial Intelligence : A Modern Approach},
author={Stuart J. {Russell} and Peter {Norvig}},
notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2122410182",
year="2003"
year={2003}
}
@book{sahni1978fundamentals,
title="Fundamentals of Computer Algorithms",
author="Sartaj {Sahni} and Ellis {Horowitz}",
notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/1554451661",
year="1978"
}
@article{DBLP:journals/tssc/HartNR68,
author = {Peter E. Hart and
Nils J. Nilsson and
Bertram Raphael},
title = {A Formal Basis for the Heuristic Determination of Minimum Cost Paths},
journal = {{IEEE} Trans. Syst. Sci. Cybern.},
volume = {4},
number = {2},
pages = {100--107},
year = {1968},
//url = {https://doi.org/10.1109/TSSC.1968.300136},
//doi = {10.1109/TSSC.1968.300136},
//timestamp = {Sat, 25 Apr 2020 13:57:19 +0200},
//biburl = {https://dblp.org/rec/journals/tssc/HartNR68.bib},
//bibsource = {dblp computer science bibliography, https://dblp.org}
title={Fundamentals of Computer Algorithms},
author={Sartaj {Sahni} and Ellis {Horowitz}},
//notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/1554451661",
year={1978}
}
@article{hart1968a,
title={A Formal Basis for the Heuristic Determination of Minimum Cost Paths},
author={Peter E. {Hart} and Nils J. {Nilsson} and Bertram {Raphael}},
journal={IEEE Transactions on Systems Science and Cybernetics},
volume={4},
number={2},
pages={100--107},
notes={Sourced from Microsoft Academic - https://academic.microsoft.com/paper/1969483458},
year={1968}
}
@inproceedings{DBLP:conf/nips/HeLXQ0L17,
......@@ -1217,19 +1203,15 @@
//bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{Joshua2001A,
author={Joshua T. Goodman},
title={A bit of progress in language modeling},
journal={Comput. Speech Lang.},
volume={15},
number={4},
pages={403--434},
year={2001},
//url={https://doi.org/10.1006/csla.2001.0174},
//doi={10.1006/csla.2001.0174},
//timestamp={Thu, 20 Feb 2020 11:32:09 +0100},
//biburl={https://dblp.org/rec/journals/csl/Goodman01.bib},
//bibsource = {dblp computer science bibliography, https://dblp.org}
@article{goodman2001a,
title={A bit of progress in language modeling},
author={Joshua T. {Goodman}},
journal={Computer Speech & Language},
volume={15},
number={4},
pages={403--434},
//notes={Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2111305191},
year={2001}
}
@article{jing2019survey,
......@@ -1367,59 +1349,59 @@
@book{lowerre1976the,
title="The HARPY speech recognition system",
author="Bruce T. {Lowerre}",
notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2137095888",
year="1976"
title={The HARPY speech recognition system},
author={Bruce T. {Lowerre}},
//notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2137095888",
year={1976}
}
@book{bishop1995neural,
title="Neural networks for pattern recognition",
author="Christopher M. {Bishop}",
notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/1554663460",
year="1995"
title={Neural networks for pattern recognition},
author={Christopher M. {Bishop}},
//notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/1554663460",
year={1995}
}
@article{åström1965optimal,
title="Optimal control of Markov processes with incomplete state information",
author="Karl Johan {Åström}",
journal="Journal of Mathematical Analysis and Applications",
volume="10",
number="1",
pages="174--205",
notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2011418219",
year="1965"
title={Optimal control of Markov processes with incomplete state information},
author={Karl Johan {Åström}},
journal={Journal of Mathematical Analysis and Applications},
volume={10},
number={1},
pages={174--205},
//notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2011418219",
year={1965}
}
@article{korf1990real,
title="Real-time heuristic search",
author="Richard E. {Korf}",
journal="Artificial Intelligence",
volume="42",
number="2",
pages="189--211",
notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2021061679",
year="1990"
title={Real-time heuristic search},
author={Richard E. {Korf}},
journal={Artificial Intelligence},
volume={42},
number={2},
pages={189--211},
//notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2021061679",
year={1990}
}
@article{ney1994on,
title="On structuring probabilistic dependences in stochastic language modelling",
author="Hermann {Ney} and Ute {Essen} and Reinhard {Kneser}",
journal="Computer Speech \& Language",
volume="8",
number="1",
pages="1--38",
notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2075201173",
year="1994"
title={On structuring probabilistic dependences in stochastic language modelling},
author={Hermann {Ney} and Ute {Essen} and Reinhard {Kneser}},
journal={Computer Speech \& Language},
volume={8},
number={1},
pages={1--38},
//notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2075201173",
year={1994}
}
@inproceedings{ney1991on,
title="On smoothing techniques for bigram-based natural language modelling",
author="H. {Ney} and U. {Essen}",
booktitle="[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing",
pages="825--828",
notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2020749563",
year="1991"
title={On smoothing techniques for bigram-based natural language modelling},
author={H. {Ney} and U. {Essen}},
booktitle={[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing},
pages={825--828},
//notes="Sourced from Microsoft Academic - https://academic.microsoft.com/paper/2020749563",
year={1991}
}
%%%%% chapter 2------------------------------------------------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
......
Markdown 格式
0% 或
您添加了 0 人 到此讨论。请谨慎行事。
请先完成此评论的编辑！
请 注册 或者 后发表评论