⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 crfpp_8h-source.html

📁 CRF工具包
💻 HTML
📖 第 1 页 / 共 3 页
字号:
<a name="l00197"></a>00197   <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classCRFPP_1_1Tagger.html#1a8e45d675a38a7f5c3075c39c2ee2fb">emission_cost</a>(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> j) <span class="keyword">const</span> = 0;<a name="l00198"></a>00198 <a name="l00199"></a>00199   <span class="comment">// return transition cost of [j-th tag at i-th token] to</span><a name="l00200"></a>00200   <span class="comment">// [k-th tag at(i+1)-th token]</span><a name="l00201"></a>00201   <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classCRFPP_1_1Tagger.html#2327ce0f0be365a8e3b2df6bd14d223a">next_transition_cost</a>(<span class="keywordtype">size_t</span> i,<a name="l00202"></a>00202                                       <span class="keywordtype">size_t</span> j, <span class="keywordtype">size_t</span> k) <span class="keyword">const</span> = 0;<a name="l00203"></a>00203 <a name="l00204"></a>00204   <span class="comment">// return transition cost of [j-th tag at i-th token] to</span><a name="l00205"></a>00205   <span class="comment">// [k-th tag at(i-1)-th token]</span><a name="l00206"></a>00206   <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classCRFPP_1_1Tagger.html#6b68c088ce371e4bcb9973bc09f793d5">prev_transition_cost</a>(<span class="keywordtype">size_t</span> i,<a name="l00207"></a>00207                                       <span class="keywordtype">size_t</span> j, <span class="keywordtype">size_t</span> k) <span class="keyword">const</span> = 0;<a name="l00208"></a>00208 <a name="l00209"></a>00209   <span class="comment">//  return the best accumulative cost to the j-th tag at i-th token</span><a name="l00210"></a>00210   <span class="comment">// used in viterbi search</span><a name="l00211"></a>00211   <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classCRFPP_1_1Tagger.html#39b2762fc466abf4d63c9c7273c92dcc">best_cost</a>(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> j) <span class="keyword">const</span> = 0;<a name="l00212"></a>00212 <a name="l00213"></a>00213 <span class="preprocessor">#ifndef SWIG</span><a name="l00214"></a>00214 <span class="preprocessor"></span>  <span class="comment">// return emission feature vector of the j-th tag at i-th token</span><a name="l00215"></a>00215   <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">int</span>* <a class="code" href="classCRFPP_1_1Tagger.html#4f5172db2d33c2d16a71989486750299">emission_vector</a>(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> j) <span class="keyword">const</span> = 0;<a name="l00216"></a>00216 <a name="l00217"></a>00217   <span class="comment">// return transition feature vector of [j-th tag at i-th token] to</span><a name="l00218"></a>00218   <span class="comment">// [k-th tag at(i+1)-th token]</span><a name="l00219"></a>00219   <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">int</span>* <a class="code" href="classCRFPP_1_1Tagger.html#faba05159548ba5427088dc45f7cfde0">next_transition_vector</a>(<span class="keywordtype">size_t</span> i,<a name="l00220"></a>00220                                             <span class="keywordtype">size_t</span> j, <span class="keywordtype">size_t</span> k) <span class="keyword">const</span> = 0;<a name="l00221"></a>00221 <a name="l00222"></a>00222   <span class="comment">// return transition feature vector of [j-th tag at i-th token] to</span><a name="l00223"></a>00223   <span class="comment">// [k-th tag at(i-1)-th token]</span><a name="l00224"></a>00224   <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">int</span>* <a class="code" href="classCRFPP_1_1Tagger.html#4188eeb78469823e096986440b8ca87a">prev_transition_vector</a>(<span class="keywordtype">size_t</span> i,<a name="l00225"></a>00225                                             <span class="keywordtype">size_t</span> j, <span class="keywordtype">size_t</span> k) <span class="keyword">const</span> = 0;<a name="l00226"></a>00226 <span class="preprocessor">#endif</span><a name="l00227"></a>00227 <span class="preprocessor"></span><a name="l00228"></a>00228   <span class="comment">// normalizing factor(log-prob)</span><a name="l00229"></a>00229   <span class="keyword">virtual</span> <span class="keywordtype">double</span> <a class="code" href="classCRFPP_1_1Tagger.html#70578008d83778a53800227002f0e4e5">Z</a>() <span class="keyword">const</span> = 0;<a name="l00230"></a>00230 <a name="l00231"></a>00231   <span class="comment">// do parse and change the internal status, if failed, returns false</span><a name="l00232"></a>00232   <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classCRFPP_1_1Tagger.html#195868fcd1d7e7e9dfc6f802ad32d2e7">parse</a>() = 0;<a name="l00233"></a>00233 <a name="l00234"></a>00234   <span class="comment">// return true if the context is empty</span><a name="l00235"></a>00235   <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classCRFPP_1_1Tagger.html#938183f7d5e5f470efe58bf2aae7dbdd">empty</a>() <span class="keyword">const</span> = 0;<a name="l00236"></a>00236 <a name="l00237"></a>00237   <span class="comment">// clear all context</span><a name="l00238"></a>00238   <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classCRFPP_1_1Tagger.html#c59a9a7b99503c282cd8dc529c9311f7">clear</a>() = 0;<a name="l00239"></a>00239 <a name="l00240"></a>00240   <span class="comment">// change the internal state to output next-optimal output.</span><a name="l00241"></a>00241   <span class="comment">// calling it n-th times, can get n-best results,</span><a name="l00242"></a>00242   <span class="comment">// Neeed to specify -nN option to use this function, where</span><a name="l00243"></a>00243   <span class="comment">// N&gt;=2</span><a name="l00244"></a>00244   <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classCRFPP_1_1Tagger.html#137d7523294d05773a5dd26f60dce73c">next</a>() = 0;<a name="l00245"></a>00245 <a name="l00246"></a>00246   <span class="comment">// parse 'str' and return result as string</span><a name="l00247"></a>00247   <span class="comment">// 'str' must be written in CRF++'s input format</span><a name="l00248"></a>00248   <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classCRFPP_1_1Tagger.html#195868fcd1d7e7e9dfc6f802ad32d2e7">parse</a>(<span class="keyword">const</span> <span class="keywordtype">char</span>* str) = 0;<a name="l00249"></a>00249 <a name="l00250"></a>00250 <span class="preprocessor">#ifndef SWIG</span><a name="l00251"></a>00251 <span class="preprocessor"></span>  <span class="comment">// return parsed result as string</span><a name="l00252"></a>00252   <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classCRFPP_1_1Tagger.html#0f00cbcf6b9486e177f3064ef1b5e275">toString</a>() = 0;<a name="l00253"></a>00253 <a name="l00254"></a>00254   <span class="comment">// return parsed result as string.</span><a name="l00255"></a>00255   <span class="comment">// Result is saved in the buffer 'result', 'size' is the</span><a name="l00256"></a>00256   <span class="comment">// size of the buffer. if failed, return NULL</span><a name="l00257"></a>00257   <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classCRFPP_1_1Tagger.html#0f00cbcf6b9486e177f3064ef1b5e275">toString</a>(<span class="keywordtype">char</span>* <a class="code" href="classCRFPP_1_1Tagger.html#64474629e38769c9b103b6680a5cebbd">result</a> , <span class="keywordtype">size_t</span> <a class="code" href="classCRFPP_1_1Tagger.html#0bb307faa0e68f71ca1bb6a992bc01e4">size</a>) = 0;<a name="l00258"></a>00258 <a name="l00259"></a>00259   <span class="comment">// parse 'str' and return parsed result.</span><a name="l00260"></a>00260   <span class="comment">// You don't need to delete return value, but the buffer</span><a name="l00261"></a>00261   <span class="comment">// is rewritten whenever you call parse method.</span><a name="l00262"></a>00262   <span class="comment">// if failed, return NULL</span><a name="l00263"></a>00263   <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classCRFPP_1_1Tagger.html#195868fcd1d7e7e9dfc6f802ad32d2e7">parse</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *str, <span class="keywordtype">size_t</span> size) = 0;<a name="l00264"></a>00264 <a name="l00265"></a>00265   <span class="comment">// parse 'str' and return parsed result.</span><a name="l00266"></a>00266   <span class="comment">// The result is stored in the buffer 'result'.</span><a name="l00267"></a>00267   <span class="comment">// 'size2' is the size of the buffer. if failed, return NULL</span><a name="l00268"></a>00268   <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classCRFPP_1_1Tagger.html#195868fcd1d7e7e9dfc6f802ad32d2e7">parse</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *str, <span class="keywordtype">size_t</span> size1,<a name="l00269"></a>00269                             <span class="keywordtype">char</span> *result, <span class="keywordtype">size_t</span> size2) = 0;<a name="l00270"></a>00270 <span class="preprocessor">#endif</span><a name="l00271"></a>00271 <span class="preprocessor"></span>  <span class="comment">// return internal error code as string</span><a name="l00272"></a>00272   <span class="keyword">virtual</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="classCRFPP_1_1Tagger.html#a8fdb0f9b6ddeff642e828831ade7aba">what</a>() = 0;<a name="l00273"></a>00273 <a name="l00274"></a><a class="code" href="classCRFPP_1_1Tagger.html#952aec420a7e26c35dc94c47132dd955">00274</a>   <span class="keyword">virtual</span> <a class="code" href="classCRFPP_1_1Tagger.html#952aec420a7e26c35dc94c47132dd955">~Tagger</a>() {}<a name="l00275"></a>00275 };<a name="l00276"></a>00276 <a name="l00277"></a>00277 <span class="comment">/* factory method */</span><a name="l00278"></a>00278 <a name="l00279"></a>00279 <span class="comment">// create CRFPP::Tagger instance with parameters in argv[]</span><a name="l00280"></a>00280 <span class="comment">// e.g, argv[] = {"CRF++", "-m", "model", "-v3"};</span><a name="l00281"></a>00281 <a name="l00282"></a>00282 CRFPP_DLL_EXTERN Tagger *<a class="code" href="namespaceCRFPP.html#30aed044aeffde3a6ac36db925f2fa90">createTagger</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv);<a name="l00283"></a>00283 <a name="l00284"></a>00284 <span class="comment">// create CRFPP::Tagger instance with parameter in arg</span><a name="l00285"></a>00285 <span class="comment">// e.g. arg = "-m model -v3";</span><a name="l00286"></a>00286 CRFPP_DLL_EXTERN Tagger *<a class="code" href="namespaceCRFPP.html#30aed044aeffde3a6ac36db925f2fa90">createTagger</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *arg);<a name="l00287"></a>00287 <a name="l00288"></a>00288 <span class="comment">// return error code of createTagger();</span><a name="l00289"></a>00289 CRFPP_DLL_EXTERN <span class="keyword">const</span> <span class="keywordtype">char</span>* <a class="code" href="namespaceCRFPP.html#4ea358d9f0b666ff13a1553e79a98777">getTaggerError</a>();<a name="l00290"></a>00290 }<a name="l00291"></a>00291 <a name="l00292"></a>00292 <span class="preprocessor">#endif</span><a name="l00293"></a>00293 <span class="preprocessor"></span><span class="preprocessor">#endif</span></pre></div></div><hr size="1"><address style="text-align: right;"><small>Generated on Sun Apr 19 17:43:24 2009 for CRF++ by&nbsp;<a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address></body></html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -