-
Notifications
You must be signed in to change notification settings - Fork 119
/
Copy pathTextRankExtractor_8hpp_source.html
111 lines (109 loc) · 34.5 KB
/
TextRankExtractor_8hpp_source.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>Clause: src/jieba/include/cppjieba/TextRankExtractor.hpp 源文件</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Clause
 <span id="projectnumber">1.0</span>
</div>
<div id="projectbrief">Chatopera Language Understanding Service.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>首页</span></a></li>
<li><a href="pages.html"><span>相关页面</span></a></li>
<li><a href="modules.html"><span>模块</span></a></li>
<li><a href="namespaces.html"><span>命名空间</span></a></li>
<li><a href="annotated.html"><span>类</span></a></li>
<li class="current"><a href="files.html"><span>文件</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="搜索" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>文件列表</span></a></li>
</ul>
</div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_fbdfadbb744c948350505e8738791e4e.html">jieba</a></li><li class="navelem"><a class="el" href="dir_efc4309f5a371b59161bd01663dd64b9.html">include</a></li><li class="navelem"><a class="el" href="dir_c6353e5563b4d99e51ccecd6b6f775d1.html">cppjieba</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">TextRankExtractor.hpp</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="preprocessor">#ifndef CPPJIEBA_TEXTRANK_EXTRACTOR_H</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="preprocessor">#define CPPJIEBA_TEXTRANK_EXTRACTOR_H</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> </div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="preprocessor">#include <cmath></span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#include "Jieba.hpp"</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#include "glog/logging.h"</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="keyword">namespace </span><a class="code" href="namespacecppjieba.html">cppjieba</a> {</div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="keyword">using namespace </span><a class="code" href="namespacestd.html">std</a>;</div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"><a class="line" href="classcppjieba_1_1TextRankExtractor.html"> 11</a></span> <span class="keyword">class </span><a class="code" href="classcppjieba_1_1TextRankExtractor.html">TextRankExtractor</a> {</div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00013"></a><span class="lineno"><a class="line" href="structcppjieba_1_1TextRankExtractor_1_1__Word.html"> 13</a></span>  <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code" href="structcppjieba_1_1TextRankExtractor_1_1__Word.html">_Word</a> {</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span>  <span class="keywordtype">string</span> word;</div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  vector<size_t> offsets;</div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  <span class="keywordtype">double</span> weight;</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  } <a class="code" href="structcppjieba_1_1TextRankExtractor_1_1__Word.html">Word</a>; <span class="comment">// struct Word</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  <span class="keyword">typedef</span> std::map<string, Word> WordMap;</div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span>  <span class="keyword">class </span>WordGraph {</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keyword">typedef</span> <span class="keywordtype">double</span> Score;</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  <span class="keyword">typedef</span> <span class="keywordtype">string</span> Node;</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  <span class="keyword">typedef</span> std::set<Node> NodeSet;</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keyword">typedef</span> std::map<Node, double> Edges;</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">typedef</span> std::map<Node, Edges> Graph;</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="comment">//typedef std::unordered_map<Node,double> Edges;</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="comment">//typedef std::unordered_map<Node,Edges> Graph;</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordtype">double</span> d;</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  Graph graph;</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  NodeSet nodeSet;</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  WordGraph(): d(0.85) {};</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  WordGraph(<span class="keywordtype">double</span> in_d): d(in_d) {};</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordtype">void</span> addEdge(Node start, Node end, <span class="keywordtype">double</span> weight) {</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  Edges temp;</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  Edges::iterator gotEdges;</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  nodeSet.insert(start);</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  nodeSet.insert(end);</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  graph[start][end] += weight;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  graph[end][start] += weight;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  }</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordtype">void</span> rank(WordMap &ws, <span class="keywordtype">size_t</span> rankTime = 10) {</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  WordMap outSum;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  Score wsdef, min_rank, max_rank;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span>( graph.size() == 0)</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  wsdef = 1.0 / graph.size();</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">for</span>(Graph::iterator edges = graph.begin(); edges != graph.end(); ++edges) {</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// edges->first start节点；edge->first end节点；edge->second 权重</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  ws[edges->first].word = edges->first;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  ws[edges->first].weight = wsdef;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  outSum[edges->first].weight = 0;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">for</span>(Edges::iterator edge = edges->second.begin(); edge != edges->second.end(); ++edge) {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  outSum[edges->first].weight += edge->second;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  }</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  }</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="comment">//sort(nodeSet.begin(),nodeSet.end()); 是否需要排序?</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">for</span>( <span class="keywordtype">size_t</span> i = 0; i < rankTime; i++ ) {</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span>(NodeSet::iterator node = nodeSet.begin(); node != nodeSet.end(); node++ ) {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordtype">double</span> s = 0;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">for</span>( Edges::iterator edge = graph[*node].begin(); edge != graph[*node].end(); edge++ )</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// edge->first end节点；edge->second 权重</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  s += edge->second / outSum[edge->first].weight * ws[edge->first].weight;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  ws[*node].weight = (1 - d) + d * s;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  min_rank = max_rank = ws.begin()->second.weight;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">for</span>(WordMap::iterator i = ws.begin(); i != ws.end(); i ++) {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span>( i->second.weight < min_rank ) {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  min_rank = i->second.weight;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span>( i->second.weight > max_rank ) {</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  max_rank = i->second.weight;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">for</span>(WordMap::iterator i = ws.begin(); i != ws.end(); i ++) {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  ws[i->first].weight = (i->second.weight - min_rank / 10.0) / (max_rank - min_rank / 10.0);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  };</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <a class="code" href="classcppjieba_1_1TextRankExtractor.html">TextRankExtractor</a>(<span class="keyword">const</span> <span class="keywordtype">string</span>& dictPath,</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> <span class="keywordtype">string</span>& hmmFilePath,</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">const</span> <span class="keywordtype">string</span>& stopWordPath,</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">const</span> <span class="keywordtype">string</span>& userDict = <span class="stringliteral">""</span>)</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  : segment_(dictPath, hmmFilePath, userDict) {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  LoadStopWordDict(stopWordPath);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="code" href="classcppjieba_1_1TextRankExtractor.html">TextRankExtractor</a>(<span class="keyword">const</span> <a class="code" href="classcppjieba_1_1DictTrie.html">DictTrie</a>* dictTrie,</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">const</span> <a class="code" href="structcppjieba_1_1HMMModel.html">HMMModel</a>* model,</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">const</span> <span class="keywordtype">string</span>& stopWordPath)</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  : segment_(dictTrie, model) {</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  LoadStopWordDict(stopWordPath);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="classcppjieba_1_1TextRankExtractor.html">TextRankExtractor</a>(<span class="keyword">const</span> <a class="code" href="classcppjieba_1_1Jieba.html">Jieba</a>& jieba, <span class="keyword">const</span> <span class="keywordtype">string</span>& stopWordPath) : segment_(jieba.GetDictTrie(), jieba.GetHMMModel()) {</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  LoadStopWordDict(stopWordPath);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  ~<a class="code" href="classcppjieba_1_1TextRankExtractor.html">TextRankExtractor</a>() {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> </div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">void</span> Extract(<span class="keyword">const</span> <span class="keywordtype">string</span>& sentence, vector<string>& keywords, <span class="keywordtype">size_t</span> topN)<span class="keyword"> const </span>{</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  vector<Word> topWords;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  Extract(sentence, topWords, topN);</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < topWords.size(); i++) {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  keywords.push_back(topWords[i].word);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordtype">void</span> Extract(<span class="keyword">const</span> <span class="keywordtype">string</span>& sentence, vector<pair<string, double> >& keywords, <span class="keywordtype">size_t</span> topN)<span class="keyword"> const </span>{</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  vector<Word> topWords;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  Extract(sentence, topWords, topN);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < topWords.size(); i++) {</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  keywords.push_back(pair<string, double>(topWords[i].word, topWords[i].weight));</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  }</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordtype">void</span> Extract(<span class="keyword">const</span> <span class="keywordtype">string</span>& sentence, vector<Word>& keywords, <span class="keywordtype">size_t</span> topN, <span class="keywordtype">size_t</span> span = 5, <span class="keywordtype">size_t</span> rankTime = 10)<span class="keyword"> const </span>{</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  vector<string> words;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  segment_.Cut(sentence, words);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  TextRankExtractor::WordGraph graph;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  WordMap wordmap;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordtype">size_t</span> offset = 0;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span> </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0; i < words.size(); i++) {</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordtype">size_t</span> t = offset;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  offset += words[i].size();</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">if</span> (IsSingleWord(words[i]) || stopWords_.find(words[i]) != stopWords_.end()) {</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> j = i + 1, skip = 0; j < i + span + skip && j < words.size(); j++) {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">if</span> (IsSingleWord(words[j]) || stopWords_.find(words[j]) != stopWords_.end()) {</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  skip++;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  graph.addEdge(words[i], words[j], 1);</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> </div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  wordmap[words[i]].offsets.push_back(t);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span> (offset != sentence.size()) {</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  VLOG(2) << <span class="stringliteral">"words illegal"</span>;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  }</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  graph.rank(wordmap, rankTime);</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> </div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  keywords.clear();</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  keywords.reserve(wordmap.size());</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">for</span> (WordMap::iterator itr = wordmap.begin(); itr != wordmap.end(); ++itr) {</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  keywords.push_back(itr->second);</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  topN = min(topN, keywords.size());</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  partial_sort(keywords.begin(), keywords.begin() + topN, keywords.end(), Compare);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  keywords.resize(topN);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">void</span> LoadStopWordDict(<span class="keyword">const</span> <span class="keywordtype">string</span>& filePath) {</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  ifstream ifs(filePath.c_str());</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  CHECK(ifs.is_open()) << <span class="stringliteral">"open "</span> << filePath << <span class="stringliteral">" failed"</span>;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordtype">string</span> line ;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">while</span> (getline(ifs, line)) {</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  stopWords_.insert(line);</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  assert(stopWords_.size());</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> Compare(<span class="keyword">const</span> <a class="code" href="structcppjieba_1_1TextRankExtractor_1_1__Word.html">Word</a> &x, <span class="keyword">const</span> <a class="code" href="structcppjieba_1_1TextRankExtractor_1_1__Word.html">Word</a> &y) {</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">return</span> x.weight > y.weight;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="code" href="classcppjieba_1_1MixSegment.html">MixSegment</a> segment_;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  unordered_set<string> stopWords_;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> }; <span class="comment">// class TextRankExtractor</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> </div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="keyword">inline</span> ostream& operator << (ostream& os, <span class="keyword">const</span> <a class="code" href="structcppjieba_1_1TextRankExtractor_1_1__Word.html">TextRankExtractor::Word</a>& word) {</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> os << <span class="stringliteral">"{\"word\": \""</span> << word.word << <span class="stringliteral">"\", \"offset\": "</span> << word.offsets << <span class="stringliteral">", \"weight\": "</span> << word.weight << <span class="stringliteral">"}"</span>;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> } <span class="comment">// namespace cppjieba</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> </div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> </div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="ttc" id="structcppjieba_1_1HMMModel_html"><div class="ttname"><a href="structcppjieba_1_1HMMModel.html">cppjieba::HMMModel</a></div><div class="ttdef"><b>Definition:</b> HMMModel.hpp:13</div></div>
<div class="ttc" id="namespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdef"><b>Definition:</b> StdExtension.hpp:18</div></div>
<div class="ttc" id="namespacecppjieba_html"><div class="ttname"><a href="namespacecppjieba.html">cppjieba</a></div><div class="ttdef"><b>Definition:</b> DictTrie.hpp:18</div></div>
<div class="ttc" id="structcppjieba_1_1TextRankExtractor_1_1__Word_html"><div class="ttname"><a href="structcppjieba_1_1TextRankExtractor_1_1__Word.html">cppjieba::TextRankExtractor::_Word</a></div><div class="ttdef"><b>Definition:</b> TextRankExtractor.hpp:13</div></div>
<div class="ttc" id="classcppjieba_1_1Jieba_html"><div class="ttname"><a href="classcppjieba_1_1Jieba.html">cppjieba::Jieba</a></div><div class="ttdef"><b>Definition:</b> Jieba.hpp:9</div></div>
<div class="ttc" id="classcppjieba_1_1TextRankExtractor_html"><div class="ttname"><a href="classcppjieba_1_1TextRankExtractor.html">cppjieba::TextRankExtractor</a></div><div class="ttdef"><b>Definition:</b> TextRankExtractor.hpp:11</div></div>
<div class="ttc" id="classcppjieba_1_1DictTrie_html"><div class="ttname"><a href="classcppjieba_1_1DictTrie.html">cppjieba::DictTrie</a></div><div class="ttdef"><b>Definition:</b> DictTrie.hpp:27</div></div>
<div class="ttc" id="classcppjieba_1_1MixSegment_html"><div class="ttname"><a href="classcppjieba_1_1MixSegment.html">cppjieba::MixSegment</a></div><div class="ttdef"><b>Definition:</b> MixSegment.hpp:11</div></div>
</div><!-- fragment --></div><!-- contents -->
<address class="footer">
<small>
Copyright (c) (2019-2020) <a href="https://www.chatopera.com">
北京华夏春松科技有限公司
</a>. All Rights Reserved
</small>
</address>