qim.h

来自「我们一个小组」· C头文件 代码 · 共 39 行

#pragma once

#include "TrieTree.h"
#include "..\BiHashTable\BiHashTable.h"
#include "..\DynamicPhraseTable\DynamicPhraseTable.h"


class Qim
{
public:

	bool InsertStaticPhrase(const string& py, const string& strPhrase, double frequency);

	bool InsertDynamicPhrase(const string& py, const string& strPrase, double frequency) ;

	bool InsertDynamicPhrase1(string py, string strSlimcutpy, string strPhrase,double frequency);

	//Get the static word by py, using longest-matching strategy, return the longest matching count
	int GetStaticWordByLongestMatchedPy(const string& py, vector<string>& vecPhraseTable);

	int GetDynamicPraseByLongestMatchedPy(const string& py, vector<string>& vecPhraseTable) ;

	bool IncreaseStaticFrequency(const string& py, const string& strPhrase) ;

	bool IncreaseDynamicFrequency(const string& py, const string& strPhrase);

	bool Save(const string& strStaticTableFilename, const string& strDynamicTableFilename, const string& strHashtableFilename); 

	bool Load(const string& strStaticTableFilename, const string& strDynamicTableFilename, const string& strHashtableFilename); 
	
	bool LoadFromRawFile (const string& strFileName);

	bool LoadDynamicFromRawFile (const string& strFileName) ;

private:
	TrieTree m_StaticPhraseTable ;
	BiHashTable m_BiHashTable ;
	DynamicPhraseTable m_DynamicPraseTable ;
};