@huggingface/tasks 0.13.1 → 0.13.2

package/dist/esm/tasks/question-answering/inference.d.ts

@@ -0,0 +1,100 @@
+/**
+ * Inference code generated from the JSON schema spec in ./spec
+ *
+ * Using src/scripts/inference-codegen
+ */
+/**
+ * Inputs for Question Answering inference
+ */
+export interface QuestionAnsweringInput {
+    /**
+     * One (context, question) pair to answer
+     */
+    inputs: QuestionAnsweringInputData;
+    /**
+     * Additional inference parameters
+     */
+    parameters?: QuestionAnsweringParameters;
+    [property: string]: unknown;
+}
+/**
+ * One (context, question) pair to answer
+ */
+export interface QuestionAnsweringInputData {
+    /**
+     * The context to be used for answering the question
+     */
+    context: string;
+    /**
+     * The question to be answered
+     */
+    question: string;
+    [property: string]: unknown;
+}
+/**
+ * Additional inference parameters
+ *
+ * Additional inference parameters for Question Answering
+ */
+export interface QuestionAnsweringParameters {
+    /**
+     * Attempts to align the answer to real words. Improves quality on space separated
+     * languages. Might hurt on non-space-separated languages (like Japanese or Chinese)
+     */
+    align_to_words?: boolean;
+    /**
+     * If the context is too long to fit with the question for the model, it will be split in
+     * several chunks with some overlap. This argument controls the size of that overlap.
+     */
+    doc_stride?: number;
+    /**
+     * Whether to accept impossible as an answer.
+     */
+    handle_impossible_answer?: boolean;
+    /**
+     * The maximum length of predicted answers (e.g., only answers with a shorter length are
+     * considered).
+     */
+    max_answer_len?: number;
+    /**
+     * The maximum length of the question after tokenization. It will be truncated if needed.
+     */
+    max_question_len?: number;
+    /**
+     * The maximum length of the total sentence (context + question) in tokens of each chunk
+     * passed to the model. The context will be split in several chunks (using docStride as
+     * overlap) if needed.
+     */
+    max_seq_len?: number;
+    /**
+     * The number of answers to return (will be chosen by order of likelihood). Note that we
+     * return less than topk answers if there are not enough options available within the
+     * context.
+     */
+    top_k?: number;
+    [property: string]: unknown;
+}
+export type QuestionAnsweringOutput = QuestionAnsweringOutputElement[];
+/**
+ * Outputs of inference for the Question Answering task
+ */
+export interface QuestionAnsweringOutputElement {
+    /**
+     * The answer to the question.
+     */
+    answer: string;
+    /**
+     * The character position in the input where the answer ends.
+     */
+    end: number;
+    /**
+     * The probability associated to the answer.
+     */
+    score: number;
+    /**
+     * The character position in the input where the answer begins.
+     */
+    start: number;
+    [property: string]: unknown;
+}
+//# sourceMappingURL=inference.d.ts.map

package/dist/esm/tasks/question-answering/inference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inference.d.ts","sourceRoot":"","sources":["../../../../src/tasks/question-answering/inference.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACtC;;OAEG;IACH,MAAM,EAAE,0BAA0B,CAAC;IACnC;;OAEG;IACH,UAAU,CAAC,EAAE,2BAA2B,CAAC;IACzC,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B;AACD;;GAEG;AACH,MAAM,WAAW,0BAA0B;IAC1C;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B;AACD;;;;GAIG;AACH,MAAM,WAAW,2BAA2B;IAC3C;;;OAGG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;OAEG;IACH,wBAAwB,CAAC,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;OAEG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B;AACD,MAAM,MAAM,uBAAuB,GAAG,8BAA8B,EAAE,CAAC;AACvE;;GAEG;AACH,MAAM,WAAW,8BAA8B;IAC9C;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IACf;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;IACd;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;IACd,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B"}

package/dist/esm/tasks/question-answering/inference.js

@@ -0,0 +1 @@
+export {};

package/dist/esm/tasks/reinforcement-learning/data.d.ts

@@ -0,0 +1,4 @@
+import type { TaskDataCustom } from "../index.js";
+declare const taskData: TaskDataCustom;
+export default taskData;
+//# sourceMappingURL=data.d.ts.map

package/dist/esm/tasks/reinforcement-learning/data.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.d.ts","sourceRoot":"","sources":["../../../../src/tasks/reinforcement-learning/data.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAElD,QAAA,MAAM,QAAQ,EAAE,cAsEf,CAAC;AAEF,eAAe,QAAQ,CAAC"}

package/dist/esm/tasks/reinforcement-learning/data.js

@@ -0,0 +1,67 @@
+const taskData = {
+    datasets: [
+        {
+            description: "A curation of widely used datasets for Data Driven Deep Reinforcement Learning (D4RL)",
+            id: "edbeeching/decision_transformer_gym_replay",
+        },
+    ],
+    demo: {
+        inputs: [
+            {
+                label: "State",
+                content: "Red traffic light, pedestrians are about to pass.",
+                type: "text",
+            },
+        ],
+        outputs: [
+            {
+                label: "Action",
+                content: "Stop the car.",
+                type: "text",
+            },
+            {
+                label: "Next State",
+                content: "Yellow light, pedestrians have crossed.",
+                type: "text",
+            },
+        ],
+    },
+    metrics: [
+        {
+            description: "Accumulated reward across all time steps discounted by a factor that ranges between 0 and 1 and determines how much the agent optimizes for future relative to immediate rewards. Measures how good is the policy ultimately found by a given algorithm considering uncertainty over the future.",
+            id: "Discounted Total Reward",
+        },
+        {
+            description: "Average return obtained after running the policy for a certain number of evaluation episodes. As opposed to total reward, mean reward considers how much reward a given algorithm receives while learning.",
+            id: "Mean Reward",
+        },
+        {
+            description: "Measures how good a given algorithm is after a predefined time. Some algorithms may be guaranteed to converge to optimal behavior across many time steps. However, an agent that reaches an acceptable level of optimality after a given time horizon may be preferable to one that ultimately reaches optimality but takes a long time.",
+            id: "Level of Performance After Some Time",
+        },
+    ],
+    models: [
+        {
+            description: "A Reinforcement Learning model trained on expert data from the Gym Hopper environment",
+            id: "edbeeching/decision-transformer-gym-hopper-expert",
+        },
+        {
+            description: "A PPO agent playing seals/CartPole-v0 using the stable-baselines3 library and the RL Zoo.",
+            id: "HumanCompatibleAI/ppo-seals-CartPole-v0",
+        },
+    ],
+    spaces: [
+        {
+            description: "An application for a cute puppy agent learning to catch a stick.",
+            id: "ThomasSimonini/Huggy",
+        },
+        {
+            description: "An application to play Snowball Fight with a reinforcement learning agent.",
+            id: "ThomasSimonini/SnowballFight",
+        },
+    ],
+    summary: "Reinforcement learning is the computational approach of learning from action by interacting with an environment through trial and error and receiving rewards (negative or positive) as feedback",
+    widgetModels: [],
+    youtubeId: "q0BiUn5LiBc",
+};
+export default taskData;

package/dist/esm/tasks/sentence-similarity/data.d.ts

@@ -0,0 +1,4 @@
+import type { TaskDataCustom } from "../index.js";
+declare const taskData: TaskDataCustom;
+export default taskData;
+//# sourceMappingURL=data.d.ts.map

package/dist/esm/tasks/sentence-similarity/data.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.d.ts","sourceRoot":"","sources":["../../../../src/tasks/sentence-similarity/data.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAElD,QAAA,MAAM,QAAQ,EAAE,cAgGf,CAAC;AAEF,eAAe,QAAQ,CAAC"}

package/dist/esm/tasks/sentence-similarity/data.js

@@ -0,0 +1,93 @@
+const taskData = {
+    datasets: [
+        {
+            description: "Bing queries with relevant passages from various web sources.",
+            id: "ms_marco",
+        },
+    ],
+    demo: {
+        inputs: [
+            {
+                label: "Source sentence",
+                content: "Machine learning is so easy.",
+                type: "text",
+            },
+            {
+                label: "Sentences to compare to",
+                content: "Deep learning is so straightforward.",
+                type: "text",
+            },
+            {
+                label: "",
+                content: "This is so difficult, like rocket science.",
+                type: "text",
+            },
+            {
+                label: "",
+                content: "I can't believe how much I struggled with this.",
+                type: "text",
+            },
+        ],
+        outputs: [
+            {
+                type: "chart",
+                data: [
+                    {
+                        label: "Deep learning is so straightforward.",
+                        score: 0.623,
+                    },
+                    {
+                        label: "This is so difficult, like rocket science.",
+                        score: 0.413,
+                    },
+                    {
+                        label: "I can't believe how much I struggled with this.",
+                        score: 0.256,
+                    },
+                ],
+            },
+        ],
+    },
+    metrics: [
+        {
+            description: "Reciprocal Rank is a measure used to rank the relevancy of documents given a set of documents. Reciprocal Rank is the reciprocal of the rank of the document retrieved, meaning, if the rank is 3, the Reciprocal Rank is 0.33. If the rank is 1, the Reciprocal Rank is 1",
+            id: "Mean Reciprocal Rank",
+        },
+        {
+            description: "The similarity of the embeddings is evaluated mainly on cosine similarity. It is calculated as the cosine of the angle between two vectors. It is particularly useful when your texts are not the same length",
+            id: "Cosine Similarity",
+        },
+    ],
+    models: [
+        {
+            description: "This model works well for sentences and paragraphs and can be used for clustering/grouping and semantic searches.",
+            id: "sentence-transformers/all-mpnet-base-v2",
+        },
+        {
+            description: "A multilingual robust sentence similarity model..",
+            id: "BAAI/bge-m3",
+        },
+    ],
+    spaces: [
+        {
+            description: "An application that leverages sentence similarity to answer questions from YouTube videos.",
+            id: "Gradio-Blocks/Ask_Questions_To_YouTube_Videos",
+        },
+        {
+            description: "An application that retrieves relevant PubMed abstracts for a given online article which can be used as further references.",
+            id: "Gradio-Blocks/pubmed-abstract-retriever",
+        },
+        {
+            description: "An application that leverages sentence similarity to summarize text.",
+            id: "nickmuchi/article-text-summarizer",
+        },
+        {
+            description: "A guide that explains how Sentence Transformers can be used for semantic search.",
+            id: "sentence-transformers/Sentence_Transformers_for_semantic_search",
+        },
+    ],
+    summary: "Sentence Similarity is the task of determining how similar two texts are. Sentence similarity models convert input texts into vectors (embeddings) that capture semantic information and calculate how close (similar) they are between them. This task is particularly useful for information retrieval and clustering/grouping.",
+    widgetModels: ["BAAI/bge-small-en-v1.5"],
+    youtubeId: "VCZq5AkbNEU",
+};
+export default taskData;

package/dist/esm/tasks/sentence-similarity/inference.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Inference code generated from the JSON schema spec in ./spec
+ *
+ * Using src/scripts/inference-codegen
+ */
+export type SentenceSimilarityOutput = number[];
+/**
+ * Inputs for Sentence similarity inference
+ */
+export interface SentenceSimilarityInput {
+    inputs: SentenceSimilarityInputData;
+    /**
+     * Additional inference parameters
+     */
+    parameters?: {
+        [key: string]: unknown;
+    };
+    [property: string]: unknown;
+}
+export interface SentenceSimilarityInputData {
+    /**
+     * A list of strings which will be compared against the source_sentence.
+     */
+    sentences: string[];
+    /**
+     * The string that you wish to compare the other strings with. This can be a phrase,
+     * sentence, or longer passage, depending on the model being used.
+     */
+    sourceSentence: string;
+    [property: string]: unknown;
+}
+//# sourceMappingURL=inference.d.ts.map

package/dist/esm/tasks/sentence-similarity/inference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inference.d.ts","sourceRoot":"","sources":["../../../../src/tasks/sentence-similarity/inference.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,MAAM,MAAM,wBAAwB,GAAG,MAAM,EAAE,CAAC;AAEhD;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACvC,MAAM,EAAE,2BAA2B,CAAC;IACpC;;OAEG;IACH,UAAU,CAAC,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAA;KAAE,CAAC;IACxC,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B;AAED,MAAM,WAAW,2BAA2B;IAC3C;;OAEG;IACH,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB;;;OAGG;IACH,cAAc,EAAE,MAAM,CAAC;IACvB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B"}

package/dist/esm/tasks/sentence-similarity/inference.js

@@ -0,0 +1,6 @@
+/**
+ * Inference code generated from the JSON schema spec in ./spec
+ *
+ * Using src/scripts/inference-codegen
+ */
+export {};

package/dist/esm/tasks/summarization/data.d.ts

@@ -0,0 +1,4 @@
+import type { TaskDataCustom } from "../index.js";
+declare const taskData: TaskDataCustom;
+export default taskData;
+//# sourceMappingURL=data.d.ts.map

package/dist/esm/tasks/summarization/data.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.d.ts","sourceRoot":"","sources":["../../../../src/tasks/summarization/data.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAElD,QAAA,MAAM,QAAQ,EAAE,cAuEf,CAAC;AAEF,eAAe,QAAQ,CAAC"}

package/dist/esm/tasks/summarization/data.js

@@ -0,0 +1,67 @@
+const taskData = {
+    canonicalId: "text2text-generation",
+    datasets: [
+        {
+            description: "News articles in five different languages along with their summaries. Widely used for benchmarking multilingual summarization models.",
+            id: "mlsum",
+        },
+        {
+            description: "English conversations and their summaries. Useful for benchmarking conversational agents.",
+            id: "samsum",
+        },
+    ],
+    demo: {
+        inputs: [
+            {
+                label: "Input",
+                content: "The tower is 324 metres (1,063 ft) tall, about the same height as an 81-storey building, and the tallest structure in Paris. Its base is square, measuring 125 metres (410 ft) on each side. It was the first structure to reach a height of 300 metres. Excluding transmitters, the Eiffel Tower is the second tallest free-standing structure in France after the Millau Viaduct.",
+                type: "text",
+            },
+        ],
+        outputs: [
+            {
+                label: "Output",
+                content: "The tower is 324 metres (1,063 ft) tall, about the same height as an 81-storey building. It was the first structure to reach a height of 300 metres.",
+                type: "text",
+            },
+        ],
+    },
+    metrics: [
+        {
+            description: "The generated sequence is compared against its summary, and the overlap of tokens are counted. ROUGE-N refers to overlap of N subsequent tokens, ROUGE-1 refers to overlap of single tokens and ROUGE-2 is the overlap of two subsequent tokens.",
+            id: "rouge",
+        },
+    ],
+    models: [
+        {
+            description: "A strong summarization model trained on English news articles. Excels at generating factual summaries.",
+            id: "facebook/bart-large-cnn",
+        },
+        {
+            description: "A summarization model trained on medical articles.",
+            id: "Falconsai/medical_summarization",
+        },
+    ],
+    spaces: [
+        {
+            description: "An application that can summarize long paragraphs.",
+            id: "pszemraj/summarize-long-text",
+        },
+        {
+            description: "A much needed summarization application for terms and conditions.",
+            id: "ml6team/distilbart-tos-summarizer-tosdr",
+        },
+        {
+            description: "An application that summarizes long documents.",
+            id: "pszemraj/document-summarization",
+        },
+        {
+            description: "An application that can detect errors in abstractive summarization.",
+            id: "ml6team/post-processing-summarization",
+        },
+    ],
+    summary: "Summarization is the task of producing a shorter version of a document while preserving its important information. Some models can extract text from the original input, while other models can generate entirely new text.",
+    widgetModels: ["facebook/bart-large-cnn"],
+    youtubeId: "yHnr5Dk2zCI",
+};
+export default taskData;

package/dist/esm/tasks/summarization/inference.d.ts

@@ -0,0 +1,56 @@
+/**
+ * Inference code generated from the JSON schema spec in ./spec
+ *
+ * Using src/scripts/inference-codegen
+ */
+/**
+ * Inputs for Summarization inference
+ */
+export interface SummarizationInput {
+    /**
+     * The input text to summarize.
+     */
+    inputs: string;
+    /**
+     * Additional inference parameters.
+     */
+    parameters?: SummarizationParameters;
+    [property: string]: unknown;
+}
+/**
+ * Additional inference parameters.
+ *
+ * Additional inference parameters for summarization.
+ */
+export interface SummarizationParameters {
+    /**
+     * Whether to clean up the potential extra spaces in the text output.
+     */
+    clean_up_tokenization_spaces?: boolean;
+    /**
+     * Additional parametrization of the text generation algorithm.
+     */
+    generate_parameters?: {
+        [key: string]: unknown;
+    };
+    /**
+     * The truncation strategy to use.
+     */
+    truncation?: SummarizationTruncationStrategy;
+    [property: string]: unknown;
+}
+/**
+ * The truncation strategy to use.
+ */
+export type SummarizationTruncationStrategy = "do_not_truncate" | "longest_first" | "only_first" | "only_second";
+/**
+ * Outputs of inference for the Summarization task
+ */
+export interface SummarizationOutput {
+    /**
+     * The summarized text.
+     */
+    summary_text: string;
+    [property: string]: unknown;
+}
+//# sourceMappingURL=inference.d.ts.map

package/dist/esm/tasks/summarization/inference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inference.d.ts","sourceRoot":"","sources":["../../../../src/tasks/summarization/inference.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH;;GAEG;AACH,MAAM,WAAW,kBAAkB;IAClC;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IACf;;OAEG;IACH,UAAU,CAAC,EAAE,uBAAuB,CAAC;IACrC,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B;AAED;;;;GAIG;AACH,MAAM,WAAW,uBAAuB;IACvC;;OAEG;IACH,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC;;OAEG;IACH,mBAAmB,CAAC,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAA;KAAE,CAAC;IACjD;;OAEG;IACH,UAAU,CAAC,EAAE,+BAA+B,CAAC;IAC7C,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B;AAED;;GAEG;AACH,MAAM,MAAM,+BAA+B,GAAG,iBAAiB,GAAG,eAAe,GAAG,YAAY,GAAG,aAAa,CAAC;AAEjH;;GAEG;AACH,MAAM,WAAW,mBAAmB;IACnC;;OAEG;IACH,YAAY,EAAE,MAAM,CAAC;IACrB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B"}

package/dist/esm/tasks/summarization/inference.js

@@ -0,0 +1,6 @@
+/**
+ * Inference code generated from the JSON schema spec in ./spec
+ *
+ * Using src/scripts/inference-codegen
+ */
+export {};

package/dist/esm/tasks/table-question-answering/data.d.ts

@@ -0,0 +1,4 @@
+import type { TaskDataCustom } from "../index.js";
+declare const taskData: TaskDataCustom;
+export default taskData;
+//# sourceMappingURL=data.d.ts.map

package/dist/esm/tasks/table-question-answering/data.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.d.ts","sourceRoot":"","sources":["../../../../src/tasks/table-question-answering/data.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAElD,QAAA,MAAM,QAAQ,EAAE,cAsDf,CAAC;AAEF,eAAe,QAAQ,CAAC"}

package/dist/esm/tasks/table-question-answering/data.js

@@ -0,0 +1,52 @@
+const taskData = {
+    datasets: [
+        {
+            description: "The WikiTableQuestions dataset is a large-scale dataset for the task of question answering on semi-structured tables.",
+            id: "wikitablequestions",
+        },
+        {
+            description: "WikiSQL is a dataset of 80654 hand-annotated examples of questions and SQL queries distributed across 24241 tables from Wikipedia.",
+            id: "wikisql",
+        },
+    ],
+    demo: {
+        inputs: [
+            {
+                table: [
+                    ["Rank", "Name", "No.of reigns", "Combined days"],
+                    ["1", "lou Thesz", "3", "3749"],
+                    ["2", "Ric Flair", "8", "3103"],
+                    ["3", "Harley Race", "7", "1799"],
+                ],
+                type: "tabular",
+            },
+            { label: "Question", content: "What is the number of reigns for Harley Race?", type: "text" },
+        ],
+        outputs: [{ label: "Result", content: "7", type: "text" }],
+    },
+    metrics: [
+        {
+            description: "Checks whether the predicted answer(s) is the same as the ground-truth answer(s).",
+            id: "Denotation Accuracy",
+        },
+    ],
+    models: [
+        {
+            description: "A table question answering model that is capable of neural SQL execution, i.e., employ TAPEX to execute a SQL query on a given table.",
+            id: "microsoft/tapex-base",
+        },
+        {
+            description: "A robust table question answering model.",
+            id: "google/tapas-base-finetuned-wtq",
+        },
+    ],
+    spaces: [
+        {
+            description: "An application that answers questions based on table CSV files.",
+            id: "katanaml/table-query",
+        },
+    ],
+    summary: "Table Question Answering (Table QA) is the answering a question about an information on a given table.",
+    widgetModels: ["google/tapas-base-finetuned-wtq"],
+};
+export default taskData;

package/dist/esm/tasks/table-question-answering/inference.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Inference code generated from the JSON schema spec in ./spec
+ *
+ * Using src/scripts/inference-codegen
+ */
+/**
+ * Inputs for Table Question Answering inference
+ */
+export interface TableQuestionAnsweringInput {
+    /**
+     * One (table, question) pair to answer
+     */
+    inputs: TableQuestionAnsweringInputData;
+    /**
+     * Additional inference parameters
+     */
+    parameters?: {
+        [key: string]: unknown;
+    };
+    [property: string]: unknown;
+}
+/**
+ * One (table, question) pair to answer
+ */
+export interface TableQuestionAnsweringInputData {
+    /**
+     * The question to be answered about the table
+     */
+    question: string;
+    /**
+     * The table to serve as context for the questions
+     */
+    table: {
+        [key: string]: string[];
+    };
+    [property: string]: unknown;
+}
+export type TableQuestionAnsweringOutput = TableQuestionAnsweringOutputElement[];
+/**
+ * Outputs of inference for the Table Question Answering task
+ */
+export interface TableQuestionAnsweringOutputElement {
+    /**
+     * If the model has an aggregator, this returns the aggregator.
+     */
+    aggregator?: string;
+    /**
+     * The answer of the question given the table. If there is an aggregator, the answer will be
+     * preceded by `AGGREGATOR >`.
+     */
+    answer: string;
+    /**
+     * List of strings made up of the answer cell values.
+     */
+    cells: string[];
+    /**
+     * Coordinates of the cells of the answers.
+     */
+    coordinates: Array<number[]>;
+    [property: string]: unknown;
+}
+//# sourceMappingURL=inference.d.ts.map

package/dist/esm/tasks/table-question-answering/inference.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inference.d.ts","sourceRoot":"","sources":["../../../../src/tasks/table-question-answering/inference.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH;;GAEG;AACH,MAAM,WAAW,2BAA2B;IAC3C;;OAEG;IACH,MAAM,EAAE,+BAA+B,CAAC;IACxC;;OAEG;IACH,UAAU,CAAC,EAAE;QACZ,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;KACvB,CAAC;IACF,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B;AACD;;GAEG;AACH,MAAM,WAAW,+BAA+B;IAC/C;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,KAAK,EAAE;QACN,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;KACxB,CAAC;IACF,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B;AACD,MAAM,MAAM,4BAA4B,GAAG,mCAAmC,EAAE,CAAC;AACjF;;GAEG;AACH,MAAM,WAAW,mCAAmC;IACnD;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAC;IACf;;OAEG;IACH,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB;;OAEG;IACH,WAAW,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7B,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;CAC5B"}

package/dist/esm/tasks/table-question-answering/inference.js

@@ -0,0 +1 @@
+export {};

package/dist/esm/tasks/tabular-classification/data.d.ts

@@ -0,0 +1,4 @@
+import type { TaskDataCustom } from "../index.js";
+declare const taskData: TaskDataCustom;
+export default taskData;
+//# sourceMappingURL=data.d.ts.map

package/dist/esm/tasks/tabular-classification/data.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.d.ts","sourceRoot":"","sources":["../../../../src/tasks/tabular-classification/data.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAElD,QAAA,MAAM,QAAQ,EAAE,cA+Df,CAAC;AAEF,eAAe,QAAQ,CAAC"}