Criado usando o Colaboratory

Author: jpmedras

inferencia.ipynb

@@ -4,7 +4,7 @@
   "metadata": {
     "colab": {
       "provenance": [],
-      "authorship_tag": "ABX9TyO/C/y91/l1n1Q9EbJgcVZs",
+      "authorship_tag": "ABX9TyNpmoMMAv3zFn4M37G2JF4s",
       "include_colab_link": true
     },
     "kernelspec": {
@@ -101,7 +101,7 @@
         "id": "YKV1yw4Av1zV",
         "cellView": "form"
       },
-      "execution_count": 1,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -260,7 +260,7 @@
         "id": "lsYZX7w9v7uJ",
         "cellView": "form"
       },
-      "execution_count": 2,
+      "execution_count": null,
       "outputs": []
     },
     {
@@ -503,8 +503,8 @@
         "model = BERTModule(n_classes = 3)\n",
         "model.load_state_dict(load(model_path))\n",
         "\n",
-        "text = \"\"\"Given an integer x, return true if x is a palindrome, and false otherwise.\"\"\"\"\n",
-        "# text = \"\"\"You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it.\"\"\",\n",
+        "text = \"\"\"Given an integer x, return true if x is a palindrome, and false otherwise.\"\"\"\n",
+        "# text = \"\"\"You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it.\"\"\"\n",
         "\n",
         "model.predict(text=text)"
       ],