informers 0.2.0 → 1.0.1

data/lib/informers/ner.rb

@@ -1,106 +0,0 @@
-# Copyright 2018 The HuggingFace Inc. team.
-# Copyright 2020 Andrew Kane.
-#
-# 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.
-
-module Informers
-  class NER
-    def initialize(model_path)
-      tokenizer_path = File.expand_path("../../vendor/bert_base_cased_tok.bin", __dir__)
-      @tokenizer = BlingFire.load_model(tokenizer_path)
-      @model = OnnxRuntime::Model.new(model_path)
-    end
-
-    def predict(texts)
-      singular = !texts.is_a?(Array)
-      texts = [texts] if singular
-
-      result = []
-      texts.each do |text|
-        # tokenize
-        tokens, start_offsets, end_offsets = @tokenizer.text_to_ids_with_offsets(text, nil, 100) # unk token
-        tokens.unshift(101) # cls token
-        tokens << 102 # sep token
-
-        # infer
-        input = {
-          input_ids: [tokens],
-          attention_mask: [[1] * tokens.size],
-          token_type_ids: [[0] * tokens.size]
-        }
-        res = @model.predict(input)
-
-        # transform
-        output = res["output_0"] || res["logits"]
-        score =
-          output[0].map do |e|
-            values = e.map { |v| Math.exp(v) }
-            sum = values.sum
-            values.map { |v| v / sum }
-          end
-
-        labels_idx = score.map { |s| s.each_with_index.max[1] }
-        labels = ["O", "B-MISC", "I-MISC", "B-PER", "I-PER", "B-ORG", "I-ORG", "B-LOC", "I-LOC"]
-
-        entities = []
-        filtered_label_idx = labels_idx.map.with_index.reject { |v, i| v == 0 }
-        filtered_label_idx.each do |label_idx, idx|
-          entities << {
-            score: score[idx][label_idx],
-            entity: labels[label_idx],
-            index: idx
-          }
-        end
-
-        result << group_entities(entities, text, start_offsets, end_offsets)
-      end
-
-      singular ? result.first : result
-    end
-
-    private
-
-    def group_entities(entities, text, start_offsets, end_offsets)
-      last_entity = {}
-      groups = []
-      entities.each do |entity|
-        if entity[:index] - 1 == last_entity[:index] && entity[:entity] == last_entity[:entity]
-          groups.last << entity
-        else
-          groups << [entity]
-        end
-        last_entity = entity
-      end
-
-      entity_map = {
-        "I-PER" => "person",
-        "I-ORG" => "org",
-        "I-LOC" => "location",
-        "I-MIS" => "misc"
-      }
-
-      groups.map do |group|
-        start_offset = start_offsets[group.first[:index] - 1]
-        end_offset = end_offsets[group.last[:index] - 1]
-
-        {
-          text: text[start_offset...end_offset],
-          tag: entity_map[group.first[:entity]],
-          score: group.map { |v| v[:score] }.sum / group.size,
-          start: start_offset,
-          end: end_offset
-        }
-      end
-    end
-  end
-end

data/lib/informers/question_answering.rb

@@ -1,197 +0,0 @@
-# Copyright 2018 The HuggingFace Inc. team.
-# Copyright 2020 Andrew Kane.
-#
-# 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.
-
-module Informers
-  class QuestionAnswering
-    def initialize(model_path)
-      tokenizer_path = File.expand_path("../../vendor/bert_base_cased_tok.bin", __dir__)
-      @tokenizer = BlingFire.load_model(tokenizer_path)
-      @model = OnnxRuntime::Model.new(model_path)
-    end
-
-    def predict(questions)
-      singular = !questions.is_a?(Array)
-      questions = [questions] if singular
-
-      topk = 1
-      max_answer_len = 15
-
-      sep_pos = []
-      cls_pos = []
-      context_offsets = []
-
-      # tokenize
-      input_ids =
-        questions.map do |question|
-          tokens = @tokenizer.text_to_ids(question[:question], nil, 100) # unk token
-          sep_pos << tokens.size
-          tokens << 102 # sep token
-          context_tokens, offsets = @tokenizer.text_to_ids_with_offsets(question[:context], nil, 100) # unk token
-          tokens.concat(context_tokens)
-          context_offsets << offsets
-          cls_pos << tokens.size
-          tokens.unshift(101) # cls token
-          tokens << 102 # sep token
-          tokens
-        end
-
-      max_tokens = 384
-      raise "Large text not supported yet" if input_ids.map(&:size).max > max_tokens
-
-      attention_mask = []
-      input_ids.each do |ids|
-        zeros = [0] * (max_tokens - ids.size)
-
-        mask = ([1] * ids.size) + zeros
-        attention_mask << mask
-
-        ids.concat(zeros)
-      end
-
-      # infer
-      input = {
-        input_ids: input_ids,
-        attention_mask: attention_mask
-      }
-      output = @model.predict(input)
-
-      start = output["output_0"] || output["start_logits"]
-      stop = output["output_1"] || output["end_logits"]
-
-      # transform
-      answers = []
-      start.zip(stop).each_with_index do |(start_, end_), i|
-        start_ = Numo::DFloat.cast(start_)
-        end_ = Numo::DFloat.cast(end_)
-
-        # Ensure padded tokens & question tokens cannot belong to the set of candidate answers.
-        feature_p_mask = Numo::Int64.new(max_tokens).fill(0)
-        feature_p_mask[1..sep_pos[i] + 1] = 1
-        feature_p_mask[cls_pos[i][1]] = 1
-        feature_attention_mask = Numo::Int64.cast(attention_mask[i])
-        undesired_tokens = (feature_p_mask - 1).abs & feature_attention_mask
-
-        # Generate mask
-        undesired_tokens_mask = undesired_tokens.eq(0)
-
-        # Make sure non-context indexes in the tensor cannot contribute to the softmax
-        start_[undesired_tokens_mask] = -10000
-        end_[undesired_tokens_mask] = -10000
-
-        # Normalize logits and spans to retrieve the answer
-        start_ = Numo::DFloat::Math.exp(start_ - Numo::DFloat::Math.log(Numo::DFloat::Math.exp(start_).sum(axis: -1)))
-        end_ = Numo::DFloat::Math.exp(end_ - Numo::DFloat::Math.log(Numo::DFloat::Math.exp(end_).sum(axis: -1)))
-
-        # Mask CLS
-        start_[0] = end_[0] = 0.0
-
-        starts, ends, scores = decode(start_, end_, topk, max_answer_len)
-
-        # char_to_word
-        doc_tokens, char_to_word_offset = send(:doc_tokens, questions[i][:context])
-        char_to_word = Numo::Int64.cast(char_to_word_offset)
-
-        # token_to_orig_map
-        token_to_orig_map = {}
-        map_pos = sep_pos[i] + 2
-        context_offsets[i].each do |offset|
-          token_to_orig_map[map_pos] = char_to_word_offset[offset]
-          map_pos += 1
-        end
-
-        # Convert the answer (tokens) back to the original text
-        starts.to_a.zip(ends.to_a, scores) do |s, e, score|
-          answers << {
-            answer: doc_tokens[token_to_orig_map[s]..token_to_orig_map[e]].join(" "),
-            score: score,
-            start: (char_to_word.eq(token_to_orig_map[s])).where[0],
-            end: (char_to_word.eq(token_to_orig_map[e])).where[-1]
-          }
-        end
-      end
-
-      singular ? answers.first : answers
-    end
-
-    private
-
-    def decode(start, stop, topk, max_answer_len)
-      # Ensure we have batch axis
-      if start.ndim == 1
-        start = start.expand_dims(0)
-      end
-
-      if stop.ndim == 1
-        stop = stop.expand_dims(0)
-      end
-
-      # Compute the score of each tuple(start, end) to be the real answer
-      outer = start.expand_dims(-1).dot(stop.expand_dims(1))
-
-      # Remove candidate with end < start and end - start > max_answer_len
-      candidates = outer.triu.tril(max_answer_len - 1)
-
-      # Inspired by Chen & al. (https://github.com/facebookresearch/DrQA)
-      scores_flat = candidates.flatten
-      if topk == 1
-        idx_sort = [scores_flat.argmax]
-      else
-        raise "Not implemented yet"
-      end
-
-      start, stop = unravel_index(idx_sort, candidates.shape)[1..-1]
-      [start, stop, candidates[0, start, stop]]
-    end
-
-    def unravel_index(indices, shape)
-      indices = Numo::NArray.cast(indices)
-      result = []
-      factor = 1
-      shape.size.times do |i|
-        result.unshift(indices / factor % shape[-1 - i])
-        factor *= shape[-1 - i]
-      end
-      result
-    end
-
-    def doc_tokens(text)
-      doc_tokens = []
-      char_to_word_offset = []
-      prev_is_whitespace = true
-
-      text.each_char do |c|
-        if whitespace?(c)
-          prev_is_whitespace = true
-        else
-          if prev_is_whitespace
-            doc_tokens << c
-          else
-            doc_tokens[-1] += c
-          end
-          prev_is_whitespace = false
-        end
-        char_to_word_offset << (doc_tokens.size - 1)
-      end
-      # ensure end is correct when answer includes last token
-      char_to_word_offset << (doc_tokens.size - 1)
-
-      [doc_tokens, char_to_word_offset]
-    end
-
-    def whitespace?(c)
-      c == " " || c == "\t" || c == "\r" || c == "\n" || c.ord == 0x202F
-    end
-  end
-end

data/lib/informers/sentiment_analysis.rb

@@ -1,72 +0,0 @@
-# Copyright 2018 The HuggingFace Inc. team.
-# Copyright 2020 Andrew Kane.
-#
-# 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.
-
-module Informers
-  class SentimentAnalysis
-    def initialize(model_path)
-      tokenizer_path = File.expand_path("../../vendor/bert_base_tok.bin", __dir__)
-      @tokenizer = BlingFire.load_model(tokenizer_path)
-      @model = OnnxRuntime::Model.new(model_path)
-    end
-
-    def predict(texts)
-      singular = !texts.is_a?(Array)
-      texts = [texts] if singular
-
-      # tokenize
-      input_ids =
-        texts.map do |text|
-          tokens = @tokenizer.text_to_ids(text, nil, 100) # unk token
-          tokens.unshift(101) # cls token
-          tokens << 102 # sep token
-          tokens
-        end
-
-      max_tokens = input_ids.map(&:size).max
-      attention_mask = []
-      input_ids.each do |ids|
-        zeros = [0] * (max_tokens - ids.size)
-
-        mask = ([1] * ids.size) + zeros
-        attention_mask << mask
-
-        ids.concat(zeros)
-      end
-
-      # infer
-      input = {
-        input_ids: input_ids,
-        attention_mask: attention_mask
-      }
-      res = @model.predict(input)
-      output = res["output_0"] || res["logits"]
-
-      # transform
-      scores =
-        output.map do |row|
-          mapped = row.map { |v| Math.exp(v) }
-          sum = mapped.sum
-          mapped.map { |v| v / sum }
-        end
-
-      labels = ["negative", "positive"]
-      scores.map! do |item|
-        {label: labels[item.each_with_index.max[1]], score: item.max}
-      end
-
-      singular ? scores.first : scores
-    end
-  end
-end

data/lib/informers/text_generation.rb

@@ -1,54 +0,0 @@
-# Copyright 2018 The HuggingFace Inc. team.
-# Copyright 2021 Andrew Kane.
-#
-# 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.
-
-module Informers
-  class TextGeneration
-    def initialize(model_path)
-      encoder_path = File.expand_path("../../vendor/gpt2.bin", __dir__)
-      @encoder = BlingFire.load_model(encoder_path, prefix: false)
-
-      decoder_path = File.expand_path("../../vendor/gpt2.i2w", __dir__)
-      @decoder = BlingFire.load_model(decoder_path)
-
-      @model = OnnxRuntime::Model.new(model_path)
-    end
-
-    def predict(text, max_length: 50)
-      tokens = @encoder.text_to_ids(text)
-
-      input = {
-        input_ids: [tokens]
-      }
-      if @model.inputs.any? { |i| i[:name] == "attention_mask" }
-        input[:attention_mask] = [[1] * tokens.size]
-      end
-
-      output_name =
-        if @model.outputs.any? { |o| o[:name] == "output_0" }
-          "output_0"
-        else
-          "logits"
-        end
-
-      (max_length - tokens.size).times do |i|
-        output = @model.predict(input, output_type: :numo, output_names: [output_name])
-        # passed to input_ids
-        tokens << output[output_name][0, true, true][-1, true].max_index
-      end
-
-      @decoder.ids_to_text(tokens)
-    end
-  end
-end

data/vendor/LICENSE-bert.txt

@@ -1,202 +0,0 @@
-
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright [yyyy] [name of copyright owner]
-
-   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.

data/vendor/LICENSE-blingfire.txt

@@ -1,21 +0,0 @@
-MIT License
-
-Copyright (c) Microsoft Corporation. All rights reserved.
-
-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:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-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

data/vendor/LICENSE-gpt2.txt

@@ -1,24 +0,0 @@
-Modified MIT License
-
-Software Copyright (c) 2019 OpenAI
-
-We don’t claim ownership of the content you create with GPT-2, so it is yours to do with as you please.
-We only ask that you use GPT-2 responsibly and clearly indicate your content was created using GPT-2.
-
-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:
-
-The above copyright notice and this permission notice shall be included
-in all copies or substantial portions of the Software.
-The above copyright notice and this permission notice need not be included
-with content created by the Software.
-
-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.