segmenter.h

来自「贝叶斯公式」· C头文件 代码 · 共 27 行

#ifndef SEGMENTER_H
#define SEGMENTER_H
#include <string>
#include <utility>
#include "ssps.h"

using namespace std;
typedef pair<string,int> wordpair;
class segmenter{	
	CSSPS* lex;

	// this function search for a specified string s in the lex. it will return true if find and 
	//false if not.
	//argument s: the string to be searched;
	
	//string getpos(string &s);


public:
	segmenter(CSSPS* ssps):lex(ssps){};
	string segment(string &str,char tag1,char tag2);
	void segment(string &str,vector<wordpair>& result);
	string exist(string &s);
	string segmenter::segment(std::string &str,char delima);
};

#endif