letters stringlengths 5 7 | source stringlengths 3 6 | possible_answers listlengths 1 25 | length int64 5 7 | prompt listlengths 2 2 | __index_level_0__ int64 0 293 | task_source stringclasses 1
value | model_responses__example_annotation listlengths 10 10 | model_responses__example_annotation__finish_reason_length_flags listlengths 10 10 | model_responses__example_annotation__length_partial_responses listlengths 10 10 | prompt__example_annotation__metadata dict | model_responses__example_annotation__metadata dict | model_responses__example_annotation__eval_is_correct listlengths 10 10 | model_responses__example_annotation__eval_extracted_answers listlengths 10 10 | model_responses__example_annotation__eval_extraction_metadata listlengths 10 10 | model_responses__example_annotation__eval_evaluation_metadata listlengths 10 10 | model_responses__example_annotation__internal_answers__eval_is_correct listlengths 10 10 | model_responses__example_annotation__internal_answers__eval_extracted_answers listlengths 10 10 | model_responses__example_annotation__internal_answers__eval_extraction_metadata listlengths 10 10 | model_responses__example_annotation__internal_answers__eval_evaluation_metadata listlengths 10 10 | model_responses__example_annotation__metrics dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
iplno | lion | [
"pilon"
] | 5 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | 83 | letter_countdown | [
"To find the longest valid word that can be created from the given letters 'iplno', we need to follow these steps:\n\n1. **Identify Unique Letters**: First, let's identify all unique letters in the input string.\n - The unique letters are: i, p, l, n, o, and e.\n\n2. **Create Words Using Each Letter**:\n - We w... | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:54857",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/Qwe... | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
false,
false,
false,
false,
false,
false,
false,
true,
false,
false
] | [
"electronic",
"poll",
"ilopono",
"player",
null,
"pip",
null,
"in",
"iplno",
"ilpona"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "electronic",
"span_end": 1832,
"span_start": 1820,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "poll",
"span_end": 971,
"span_start": 9... | [
{
"details": "{'letters': 'iplno', 'length': 10}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "electronic",
"is_correct": false,
"reason": null,
"target_matches": null
},
{
"details": "{'lette... | [
[
false
],
[
false
],
[
false
],
[
false
],
[],
[
false
],
[],
[
true
],
[
false
],
[
false
]
] | [
[
"electronic"
],
[
"poll"
],
[
"ilopono"
],
[
"player"
],
[],
[
"pip"
],
[],
[
"in"
],
[
"iplno"
],
[
"ilpona"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "electronic",
"pattern_used": "answer tag",
"position": 1820,
"span_end": 1832,
"span_start": 1820,
"span_text": "electronic"
}
],
[
{
"confidence": 1,
"extraction_type": ... | [
[
{
"details": "{'letters': 'iplno', 'length': 10}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "electronic",
"is_correct": false,
"target_matches": null
}
],
[
{
"details": "{'letters': 'iplno', 'length': 4}",
"errors": [
... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 1,
"pass_at_n": 1,
"percent_correct": 0.1,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
],
... |
rdank | dark | [
"drank"
] | 5 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | 53 | letter_countdown | [
"To solve this problem, we need to find the longest word that can be formed using only the given letters. Let's start by examining each letter and determining how many times it appears in the input string \"rdank\".\n\n1. Count the occurrences of 'r': r = 2\n2. Count the occurrences of 'd': d = 1\n3. Count the occu... | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:54857",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/Qwe... | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
true,
false,
true,
false,
false,
false,
true,
true,
false,
true
] | [
"drank",
null,
"rank",
"radd",
"ndk",
null,
"rank",
"rank",
"rdank",
"drank"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "drank",
"span_end": 1133,
"span_start": 1126,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": null,
"original_span": null,
"span_end": null,
"span_start": null... | [
{
"details": "{'letters': 'rdank', 'length': 5}",
"errors": [],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "drank",
"is_correct": true,
"reason": null,
"target_matches": null
},
{
"details": null,
"errors": null,
"evaluation_method": "respon... | [
[
true
],
[],
[
true
],
[
false
],
[
false
],
[],
[
true
],
[
true
],
[
false
],
[
true
]
] | [
[
"drank"
],
[],
[
"rank"
],
[
"radd"
],
[
"ndk"
],
[],
[
"rank"
],
[
"rank"
],
[
"rdank"
],
[
"drank"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "drank",
"pattern_used": "answer tag",
"position": 1126,
"span_end": 1133,
"span_start": 1126,
"span_text": "drank"
}
],
[],
[
{
"confidence": 1,
"extraction_type": "int... | [
[
{
"details": "{'letters': 'rdank', 'length': 5}",
"errors": [],
"final_answer": "drank",
"is_correct": true,
"target_matches": null
}
],
[],
[
{
"details": "{'letters': 'rdank', 'length': 4}",
"errors": [],
"final_answer": "rank",
"is_correct... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 5,
"pass_at_n": 1,
"percent_correct": 0.5,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
],
... |
utcsl | cuts | [
"cults",
"scult"
] | 5 | [
{
"content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.",
"role": "system"
},
{
"content": "Answer the following problem. E... | 70 | letter_countdown | [
"To find the longest valid word that can be created from the given letters 'utcsl', we need to consider all possible combinations and ensure each letter is used exactly once.\n\n1. **Identify the letters**: The available letters are 'u', 't', 'c', 's', 'l'.\n2. **Check combinations**:\n - Start with 'u': Can't fo... | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:54857",
"backend": "litellm",
"chat_template_applied": true,
"generation_params": {
"chat_template_applied": true,
"max_tokens": 4096,
"n": 3,
"repetition_penalty": 1.1,
"temperature": 0.7,
"top_k": 20,
"top_p": 0.8
},
"model_name": "hosted_vllm/Qwe... | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
true,
false,
false,
false,
true,
false,
false,
false,
false,
false
] | [
"cut",
"best",
"No valid word",
"No valid word",
"cut",
"utclse",
"sculpt",
"truck",
"No valid word",
null
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "cut",
"span_end": 846,
"span_start": 841,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "best",
"span_end": 1911,
"span_start": 1905,
... | [
{
"details": "{'letters': 'utcsl', 'length': 3}",
"errors": [],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "cut",
"is_correct": true,
"reason": null,
"target_matches": null
},
{
"details": "{'letters': 'utcsl', 'length': 4}",
"errors": [
"... | [
[
true
],
[
false
],
[
false
],
[
false
],
[
true
],
[
false,
false
],
[
false
],
[
false
],
[
false
],
[]
] | [
[
"cut"
],
[
"best"
],
[
"No valid word"
],
[
"No valid word"
],
[
"cut"
],
[
"utclse",
"utclse"
],
[
"sculpt"
],
[
"truck"
],
[
"No valid word"
],
[]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "cut",
"pattern_used": "answer tag",
"position": 841,
"span_end": 846,
"span_start": 841,
"span_text": "cut"
}
],
[
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'utcsl', 'length': 3}",
"errors": [],
"final_answer": "cut",
"is_correct": true,
"target_matches": null
}
],
[
{
"details": "{'letters': 'utcsl', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"f... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 2,
"pass_at_n": 1,
"percent_correct": 0.2,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
],
... |
elgno | long | [
"elong",
"longe"
] | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | 45 | letter_countdown | ["To solve this problem, we need to find the longest valid word that can be formed using only the gi(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:54857","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
true,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"go",
null,
null,
"engol",
"language",
"gang",
"longer",
null,
"england",
"government"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"go","span_end":1510,"span_sta(...TRUNCATED) | [{"details":"{'letters': 'elgno', 'length': 2}","errors":[],"evaluation_method":null,"extraction_res(...TRUNCATED) | [
[
true
],
[],
[],
[
false
],
[
false
],
[
false
],
[
false
],
[],
[
false
],
[
false
]
] | [
[
"go"
],
[],
[],
[
"engol"
],
[
"language"
],
[
"gang"
],
[
"longer"
],
[],
[
"england"
],
[
"government"
]
] | [[{"confidence":1.0,"extraction_type":"internal","original_span":"go","pattern_used":"answer tag","p(...TRUNCATED) | [[{"details":"{'letters': 'elgno', 'length': 2}","errors":[],"final_answer":"go","is_correct":true,"(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.(...TRUNCATED) |
bmqye | bye | [
"bey",
"bye",
"meq"
] | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | 44 | letter_countdown | ["To find the longest possible valid word using only the given letters 'b', 'm', 'q', 'y', and 'e', (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:54857","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | ["No word can be created.","No valid word can be formed using the given letters.","meem","bymq","buy(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"No word can be created.","spa(...TRUNCATED) | [{"details":"{'letters': 'bmqye', 'length': 18}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | [
[
false
],
[
false
],
[
false
],
[
false,
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
]
] | [["No word can be created."],["No valid word can be formed using the given letters."],["meem"],["bym(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"No word can be created.","pattern_(...TRUNCATED) | [[{"details":"{'letters': 'bmqye', 'length': 18}","errors":["not_a_valid_word","cannot_be_formed_fro(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.(...TRUNCATED) |
aslih | lisa | [
"alish",
"hails",
"hilsa"
] | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | 39 | letter_countdown | ["To find the longest valid word using the given letters 'aslih', we need to consider all possible c(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:54857","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
false,
false,
false,
true,
false,
false,
false,
false,
false,
false
] | ["ashlih","No valid word can be formed","No valid word can be formed.","ash",null,"aslih",null,null,(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"ashlih","span_end":1373,"span(...TRUNCATED) | [{"details":"{'letters': 'aslih', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [
[
false
],
[
false
],
[
false
],
[
true
],
[],
[
false
],
[],
[],
[],
[
false
]
] | [["ashlih"],["No valid word can be formed"],["No valid word can be formed."],["ash"],[],["aslih"],[](...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"ashlih","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'aslih', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.(...TRUNCATED) |
oniim | mini | [
"imino"
] | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | 22 | letter_countdown | ["To solve this problem, we need to find the longest word that can be formed from the given letters (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:54857","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
false,
false,
true,
false,
false,
true,
true,
false,
false,
false
] | ["None of the provided letters can form a valid word when combined.","onomatopoeia","oni","onnim","o(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"None of the provided letters (...TRUNCATED) | [{"details":"{'letters': 'oniim', 'length': 53}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | [
[
false
],
[
false
],
[
true
],
[
false
],
[
false
],
[
true
],
[
true
],
[
false
],
[
false
],
[
false
]
] | [["None of the provided letters can form a valid word when combined."],["onomatopoeia"],["oni"],["on(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"None of the provided letters can f(...TRUNCATED) | [[{"details":"{'letters': 'oniim', 'length': 53}","errors":["not_a_valid_word","cannot_be_formed_fro(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":3,"pass_at_n":1,"percent_correct":0.(...TRUNCATED) |
kplil | kill | [
"kill",
"kilp",
"klip",
"pill"
] | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | 80 | letter_countdown | ["To find the longest valid word that can be created from the given letters 'k', 'p', 'l', 'i', 'l',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:54857","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
true
] | [
"kllipl",
"kilpi",
null,
"kilpil",
"kilip",
"killick",
"killed",
"kilip",
"player",
"kil"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"kllipl","span_end":1071,"span(...TRUNCATED) | [{"details":"{'letters': 'kplil', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [
[
false
],
[
false
],
[],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
true
]
] | [
[
"kllipl"
],
[
"kilpi"
],
[],
[
"kilpil"
],
[
"kilip"
],
[
"killick"
],
[
"killed"
],
[
"kilip"
],
[
"player"
],
[
"kil"
]
] | [[{"confidence":1.0,"extraction_type":"internal","original_span":"kllipl","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'kplil', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.(...TRUNCATED) |
whawo | wow | [
"whoa"
] | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | 10 | letter_countdown | ["### Step-by-Step Reasoning:\n\n1. **Identify Unique Letters**: First, we need to identify all uniq(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:54857","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"whoo",
"None",
"whow",
"word",
"world",
"whole",
"whoo",
"whohoo",
"watch",
null
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"whoo","span_end":1086,"span_s(...TRUNCATED) | [{"details":"{'letters': 'whawo', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED) | [
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[]
] | [
[
"whoo"
],
[
"None"
],
[
"whow"
],
[
"word"
],
[
"world"
],
[
"whole"
],
[
"whoo"
],
[
"whohoo"
],
[
"watch"
],
[]
] | [[{"confidence":1.0,"extraction_type":"internal","original_span":"whoo","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'whawo', 'length': 4}","errors":["cannot_be_formed_from_letters"],"final_a(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.(...TRUNCATED) |
neetc | teen | [
"ctene"
] | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | 0 | letter_countdown | ["To find the longest possible valid word using only the given letters 'neetc', we need to consider (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:54857","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/Qwen/Qwen2.5-1.5B-Instruct",
"n_responses": 10
} | [
false,
false,
false,
true,
false,
false,
true,
false,
false,
false
] | [
"nonect",
"netc",
"netctc",
"etc",
"engine",
"netce",
"etc",
null,
null,
"nest"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"nonect","span_end":1221,"span(...TRUNCATED) | [{"details":"{'letters': 'neetc', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [
[
false
],
[
false
],
[
false
],
[
true
],
[
false
],
[
false
],
[
true
],
[],
[],
[
false
]
] | [
[
"nonect"
],
[
"netc"
],
[
"netctc"
],
[
"etc"
],
[
"engine"
],
[
"netce"
],
[
"etc"
],
[],
[],
[
"nest"
]
] | [[{"confidence":1.0,"extraction_type":"internal","original_span":"nonect","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'neetc', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":2,"pass_at_n":1,"percent_correct":0.(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6