2024-01-30 14:42:09 +08:00
|
|
|
/*
|
2024-02-06 09:45:29 +08:00
|
|
|
* The MIT License (MIT)
|
2024-01-30 14:42:09 +08:00
|
|
|
*
|
2024-02-06 09:45:29 +08:00
|
|
|
* Copyright (C) 2013 Yanyi Wu
|
2024-01-30 14:42:09 +08:00
|
|
|
* Copyright (C) 2023, KylinSoft Co., Ltd.
|
|
|
|
*
|
2024-02-06 09:45:29 +08:00
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
|
|
* to deal in the Software without restriction, including without limitation
|
|
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
|
|
* Software is furnished to do so, subject to the following conditions:
|
2024-01-30 14:42:09 +08:00
|
|
|
*
|
2024-02-06 09:45:29 +08:00
|
|
|
* The above copyright notice and this permission notice shall be
|
|
|
|
* included in all copies or substantial portions of the Software.
|
2024-01-30 14:42:09 +08:00
|
|
|
*
|
2024-02-06 09:45:29 +08:00
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
|
|
|
|
* OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
|
|
|
|
* ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
|
|
* OTHER DEALINGS IN THE SOFTWARE.
|
2024-01-30 14:42:09 +08:00
|
|
|
*
|
2024-02-06 09:45:29 +08:00
|
|
|
*/
|
2023-12-28 10:27:40 +08:00
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include <memory>
|
|
|
|
#include "QuerySegment.hpp"
|
|
|
|
#include "KeywordExtractor.hpp"
|
|
|
|
#include "segment-trie/segment-trie.h"
|
|
|
|
|
|
|
|
namespace cppjieba {
|
|
|
|
|
|
|
|
class Jieba {
|
|
|
|
public:
|
|
|
|
Jieba(const string& dict_path,
|
|
|
|
const string& model_path,
|
|
|
|
const string& user_dict_path,
|
|
|
|
const string& idfPath = "",
|
|
|
|
const string& stopWordPath = "",
|
|
|
|
const string& dat_cache_path = "")
|
|
|
|
: dict_trie_(dict_path, user_dict_path, dat_cache_path),
|
|
|
|
model_(model_path),
|
|
|
|
mp_seg_(&dict_trie_),
|
|
|
|
hmm_seg_(&model_),
|
|
|
|
mix_seg_(&dict_trie_, &model_, stopWordPath),
|
|
|
|
full_seg_(&dict_trie_),
|
|
|
|
query_seg_(&dict_trie_, &model_, stopWordPath),
|
|
|
|
extractor(&dict_trie_, &model_, idfPath, dat_cache_path, stopWordPath){ }
|
|
|
|
~Jieba() { }
|
|
|
|
|
|
|
|
void Cut(const string& sentence, vector<string>& words, bool hmm = true) const {
|
|
|
|
mix_seg_.CutToStr(sentence, words, hmm);
|
|
|
|
}
|
|
|
|
void Cut(const string& sentence, vector<Word>& words, bool hmm = true) const {
|
|
|
|
mix_seg_.CutToWord(sentence, words, hmm);
|
|
|
|
}
|
|
|
|
void CutAll(const string& sentence, vector<string>& words) const {
|
|
|
|
full_seg_.CutToStr(sentence, words);
|
|
|
|
}
|
|
|
|
void CutAll(const string& sentence, vector<Word>& words) const {
|
|
|
|
full_seg_.CutToWord(sentence, words);
|
|
|
|
}
|
|
|
|
void CutForSearch(const string& sentence, vector<string>& words, bool hmm = true) const {
|
|
|
|
query_seg_.CutToStr(sentence, words, hmm);
|
|
|
|
}
|
|
|
|
void CutForSearch(const string& sentence, vector<Word>& words, bool hmm = true) const {
|
|
|
|
query_seg_.CutToWord(sentence, words, hmm);
|
|
|
|
}
|
|
|
|
void CutHMM(const string& sentence, vector<string>& words) const {
|
|
|
|
hmm_seg_.CutToStr(sentence, words);
|
|
|
|
}
|
|
|
|
void CutHMM(const string& sentence, vector<Word>& words) const {
|
|
|
|
hmm_seg_.CutToWord(sentence, words);
|
|
|
|
}
|
|
|
|
void CutSmall(const string& sentence, vector<string>& words, size_t max_word_len) const {
|
|
|
|
mp_seg_.CutToStr(sentence, words, false, max_word_len);
|
|
|
|
}
|
|
|
|
void CutSmall(const string& sentence, vector<Word>& words, size_t max_word_len) const {
|
|
|
|
mp_seg_.CutToWord(sentence, words, false, max_word_len);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Tag(const string& sentence, vector<pair<string, string> >& words) const {
|
|
|
|
mix_seg_.Tag(sentence, words);
|
|
|
|
}
|
|
|
|
string LookupTag(const string &str) const {
|
|
|
|
return mix_seg_.LookupTag(str);
|
|
|
|
}
|
|
|
|
|
|
|
|
void ResetSeparators(const string& s) {
|
|
|
|
//TODO
|
|
|
|
mp_seg_.ResetSeparators(s);
|
|
|
|
hmm_seg_.ResetSeparators(s);
|
|
|
|
mix_seg_.ResetSeparators(s);
|
|
|
|
full_seg_.ResetSeparators(s);
|
|
|
|
query_seg_.ResetSeparators(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
const DictTrie* GetDictTrie() const {
|
|
|
|
return &dict_trie_;
|
|
|
|
}
|
|
|
|
|
|
|
|
const HMMModel* GetHMMModel() const {
|
|
|
|
return &model_;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
DictTrie dict_trie_;
|
|
|
|
HMMModel model_;
|
|
|
|
|
|
|
|
// They share the same dict trie and model
|
|
|
|
MPSegment mp_seg_;
|
|
|
|
HMMSegment hmm_seg_;
|
|
|
|
MixSegment mix_seg_;
|
|
|
|
FullSegment full_seg_;
|
|
|
|
QuerySegment query_seg_;
|
|
|
|
|
|
|
|
public:
|
|
|
|
KeywordExtractor extractor;
|
|
|
|
}; // class Jieba
|
|
|
|
|
|
|
|
} // namespace cppjieba
|
|
|
|
|