mirror of
https://github.com/PaddlePaddle/FastDeploy.git
synced 2025-10-14 20:55:57 +08:00
Add uie cpp deploy (#120)
* implement PredictUIEInput * remove batch size * Add GetCandidateIdx * add GetCandidateIdx GetSpan GetSpanIdxAndProbs * Add Predict of UIEModel * Add relation schema * Fix uie unicode bug * rename information_extraction/ernie -> uie * Add more uie task * Add cross task extraction * use CharToBytesOffsetConverter * Add faster_tokenizer dir * Add RuntimeOption args * Add todo comments * Add some readme * fix readme * Fix readme Co-authored-by: Jason <jiangjiajun@baidu.com>
This commit is contained in:
Jack Zhou
156
examples/text/uie/cpp/uie.h
Normal file
156
examples/text/uie/cpp/uie.h
Normal file
@@ -0,0 +1,156 @@
|
||||
// Copyright (c) 2022 PaddlePaddle Authors. All Rights Reserved.
|
||||
//
|
||||
// Licensed under the Apache License, Version 2.0 (the "License");
|
||||
// you may not use this file except in compliance with the License.
|
||||
// You may obtain a copy of the License at
|
||||
//
|
||||
// http://www.apache.org/licenses/LICENSE-2.0
|
||||
//
|
||||
// Unless required by applicable law or agreed to in writing, software
|
||||
// distributed under the License is distributed on an "AS IS" BASIS,
|
||||
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
// See the License for the specific language governing permissions and
|
||||
// limitations under the License.
|
||||
#pragma once
|
||||
|
||||
#include <ostream>
|
||||
#include <set>
|
||||
#include <string>
|
||||
#include <unordered_map>
|
||||
#include <vector>
|
||||
#include "fastdeploy/fastdeploy_model.h"
|
||||
#include "fastdeploy/utils/unique_ptr.h"
|
||||
#include "faster_tokenizer/tokenizers/ernie_faster_tokenizer.h"
|
||||
|
||||
using namespace paddlenlp;
|
||||
|
||||
struct UIEResult {
|
||||
size_t start_;
|
||||
size_t end_;
|
||||
double probability_;
|
||||
std::string text_;
|
||||
std::unordered_map<std::string, std::vector<UIEResult>> relation_;
|
||||
UIEResult() = default;
|
||||
UIEResult(size_t start, size_t end, double probability, std::string text)
|
||||
: start_(start), end_(end), probability_(probability), text_(text) {}
|
||||
};
|
||||
|
||||
std::ostream& operator<<(std::ostream& os, const UIEResult& result);
|
||||
std::ostream& operator<<(
|
||||
std::ostream& os,
|
||||
const std::vector<std::unordered_map<std::string, std::vector<UIEResult>>>&
|
||||
results);
|
||||
|
||||
struct SchemaNode {
|
||||
std::string name_;
|
||||
std::vector<std::vector<std::string>> prefix_;
|
||||
std::vector<std::vector<UIEResult*>> relations_;
|
||||
std::vector<SchemaNode> children_;
|
||||
|
||||
explicit SchemaNode(const std::string& name,
|
||||
const std::vector<SchemaNode>& children = {})
|
||||
: name_(name), children_(children) {}
|
||||
void AddChild(const std::string& schema) { children_.emplace_back(schema); }
|
||||
void AddChild(const SchemaNode& schema) { children_.push_back(schema); }
|
||||
void AddChild(const std::string& schema,
|
||||
const std::vector<std::string>& children) {
|
||||
SchemaNode schema_node(schema);
|
||||
for (auto& child : children) {
|
||||
schema_node.children_.emplace_back(child);
|
||||
}
|
||||
children_.emplace_back(schema_node);
|
||||
}
|
||||
void AddChild(const std::string& schema,
|
||||
const std::vector<SchemaNode>& children) {
|
||||
SchemaNode schema_node(schema);
|
||||
schema_node.children_ = children;
|
||||
children_.emplace_back(schema_node);
|
||||
}
|
||||
};
|
||||
|
||||
struct Schema {
|
||||
explicit Schema(const std::string& schema, const std::string& name = "root");
|
||||
explicit Schema(const std::vector<std::string>& schema_list,
|
||||
const std::string& name = "root");
|
||||
explicit Schema(const std::unordered_map<std::string,
|
||||
std::vector<SchemaNode>>& schema_map,
|
||||
const std::string& name = "root");
|
||||
|
||||
private:
|
||||
void CreateRoot(const std::string& name);
|
||||
std::unique_ptr<SchemaNode> root_;
|
||||
friend class UIEModel;
|
||||
};
|
||||
|
||||
struct UIEModel {
|
||||
public:
|
||||
UIEModel(
|
||||
const std::string& model_file, const std::string& params_file,
|
||||
const std::string& vocab_file, float position_prob, size_t max_length,
|
||||
const std::vector<std::string>& schema,
|
||||
const fastdeploy::RuntimeOption& custom_option =
|
||||
fastdeploy::RuntimeOption(),
|
||||
const fastdeploy::Frontend& model_format = fastdeploy::Frontend::PADDLE);
|
||||
UIEModel(
|
||||
const std::string& model_file, const std::string& params_file,
|
||||
const std::string& vocab_file, float position_prob, size_t max_length,
|
||||
const std::unordered_map<std::string, std::vector<SchemaNode>>& schema,
|
||||
const fastdeploy::RuntimeOption& custom_option =
|
||||
fastdeploy::RuntimeOption(),
|
||||
const fastdeploy::Frontend& model_format = fastdeploy::Frontend::PADDLE);
|
||||
void SetSchema(const std::vector<std::string>& schema);
|
||||
void SetSchema(
|
||||
const std::unordered_map<std::string, std::vector<SchemaNode>>& schema);
|
||||
|
||||
void PredictUIEInput(const std::vector<std::string>& input_texts,
|
||||
const std::vector<std::string>& prompts,
|
||||
std::vector<std::vector<UIEResult>>* results);
|
||||
void Predict(
|
||||
const std::vector<std::string>& texts,
|
||||
std::vector<std::unordered_map<std::string, std::vector<UIEResult>>>*
|
||||
results);
|
||||
|
||||
private:
|
||||
using IDX_PROB = std::pair<int64_t, float>;
|
||||
struct IdxProbCmp {
|
||||
bool operator()(const std::pair<IDX_PROB, IDX_PROB>& lhs,
|
||||
const std::pair<IDX_PROB, IDX_PROB>& rhs) const;
|
||||
};
|
||||
using SPAN_SET = std::set<std::pair<IDX_PROB, IDX_PROB>, IdxProbCmp>;
|
||||
struct SpanIdx {
|
||||
faster_tokenizer::core::Offset offset_;
|
||||
bool is_prompt_;
|
||||
};
|
||||
void AutoSplitter(
|
||||
const std::vector<std::string>& texts, size_t max_length,
|
||||
std::vector<std::string>* short_texts,
|
||||
std::unordered_map<size_t, std::vector<size_t>>* input_mapping);
|
||||
void AutoJoiner(
|
||||
const std::vector<std::string>& short_texts,
|
||||
const std::unordered_map<size_t, std::vector<size_t>>& input_mapping,
|
||||
std::vector<std::vector<UIEResult>>* results);
|
||||
// Get idx of the last dimension in probability arrays, which is greater than
|
||||
// a limitation.
|
||||
void GetCandidateIdx(const float* probs, int64_t batch_size, int64_t seq_len,
|
||||
std::vector<std::vector<IDX_PROB>>* candidate_idx_prob,
|
||||
float threshold = 0.5) const;
|
||||
void GetSpan(const std::vector<IDX_PROB>& start_idx_prob,
|
||||
const std::vector<IDX_PROB>& end_idx_prob,
|
||||
SPAN_SET* span_set) const;
|
||||
void GetSpanIdxAndProbs(
|
||||
const SPAN_SET& span_set,
|
||||
const std::vector<faster_tokenizer::core::Offset>& offset_mapping,
|
||||
std::vector<SpanIdx>* span_idxs, std::vector<float>* probs) const;
|
||||
void ConvertSpanToUIEResult(
|
||||
const std::vector<std::string>& texts,
|
||||
const std::vector<std::string>& prompts,
|
||||
const std::vector<std::vector<SpanIdx>>& span_idxs,
|
||||
const std::vector<std::vector<float>>& probs,
|
||||
std::vector<std::vector<UIEResult>>* results) const;
|
||||
fastdeploy::RuntimeOption runtime_option_;
|
||||
fastdeploy::Runtime runtime_;
|
||||
std::unique_ptr<Schema> schema_;
|
||||
size_t max_length_;
|
||||
float position_prob_;
|
||||
faster_tokenizer::tokenizers_impl::ErnieFasterTokenizer tokenizer_;
|
||||
};
|
||||
Reference in New Issue
Block a user