letters stringlengths 7 7 | answer stringlengths 4 7 | all_best listlengths 1 10 | length int64 4 7 | letters_length int64 7 7 | prompt listlengths 2 2 | task_source stringclasses 1
value | model_responses__example_annotation listlengths 8 8 | model_responses__example_annotation__finish_reason_length_flags listlengths 8 8 | model_responses__example_annotation__length_partial_responses listlengths 8 8 | prompt__example_annotation__metadata dict | model_responses__example_annotation__metadata dict | model_responses__example_annotation__eval_is_correct listlengths 8 8 | model_responses__example_annotation__eval_extracted_answers listlengths 8 8 | model_responses__example_annotation__eval_extraction_metadata listlengths 8 8 | model_responses__example_annotation__eval_evaluation_metadata listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_is_correct listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_extracted_answers listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_extraction_metadata listlengths 8 8 | model_responses__example_annotation__internal_answers__eval_evaluation_metadata listlengths 8 8 | model_responses__example_annotation__metrics dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ehpxgoi | ephoi | [
"ephoi",
"pioxe"
] | 5 | 7 | [
{
"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... | letter_countdown | [
"<think>\nTo find the longest possible valid word using the given letters ['e', 'h', 'p', 'x', 'g', 'o', 'i'], we need to consider all possible combinations and ensure they form valid words according to standard English language rules (words must be five or more letters long). Here’s how I will approach it:\n\n1. *... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:56781",
"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/TAU... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"ehpoix",
"ehpxgoi",
"No valid word can be formed.",
"ee",
"ghioxi",
"element",
"ehpxgoi",
"No valid word can be formed."
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "ehpoix",
"span_end": 1227,
"span_start": 1221,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "ehpxgoi",
"span_end": 2368,
"span_start": 2... | [
{
"details": "{'letters': 'ehpxgoi', 'length': 6}",
"errors": [
"not_a_valid_word"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "ehpoix",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'ehpxgoi',... | [
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
]
] | [
[
"ehpoix",
"ehpoix"
],
[
"ehpxgoi",
"ehpxgoi"
],
[
"ephigram",
"No valid word can be formed."
],
[
"hero",
"ee",
"ee"
],
[
"ghioxi",
"ghioxi"
],
[
"element",
"element"
],
[
"ehpxgoi",
"ehpxgoi"
],
[
"No valid word can be fo... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "ehpoix",
"pattern_used": "answer tag",
"position": 1188,
"span_end": 1194,
"span_start": 1188,
"span_text": "ehpoix"
},
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'ehpxgoi', 'length': 6}",
"errors": [
"not_a_valid_word"
],
"final_answer": "ehpoix",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'ehpxgoi', 'length': 6}",
"errors": [
"not_a_valid_w... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 0,
"pass_at_n": 0,
"percent_correct": 0,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
... |
ipphuox | hippo | [
"hippo"
] | 5 | 7 | [
{
"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... | letter_countdown | [
"<think>\nTo find the longest possible valid word using the given letters ['i', 'p', 'p', 'h', 'u', 'o', 'x'], we need to consider all combinations and see which one forms a meaningful word. Let's break down the process:\n\n1. **Identify potential words**: We will try different sequences of these letters.\n - \"h... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:56781",
"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/TAU... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"No valid word can be formed.",
"fish",
"hiphop",
"happypup",
"hioppuox",
"hiphop",
"hip hop",
"physics"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "No valid word can be formed.",
"span_end": 1340,
"span_start": 1312,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "fish",
"span_end": 975,
... | [
{
"details": "{'letters': 'ipphuox', 'length': 22}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "Novalidwordcanbeformed",
"is_correct": false,
"reason": null,
"target_matches... | [
[
false,
false
],
[
false,
false
],
[
false,
false,
false
],
[
false
],
[
false,
false
],
[
false
],
[
false,
false
],
[
false,
false
]
] | [
[
"No valid word can be formed.",
"No valid word can be formed."
],
[
"fish",
"fish"
],
[
"hypo",
"hypo",
"hiphop"
],
[
"happypup"
],
[
"hioppuox",
"hioppuox"
],
[
"hiphop"
],
[
"hip hop",
"hip hop"
],
[
"physics",
"physics"
]... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "No valid word can be formed.",
"pattern_used": "answer tag",
"position": 1257,
"span_end": 1285,
"span_start": 1257,
"span_text": "No valid word can be formed."
},
{
"confidence": ... | [
[
{
"details": "{'letters': 'ipphuox', 'length': 22}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "Novalidwordcanbeformed",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'ipphuox... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 0,
"pass_at_n": 0,
"percent_correct": 0,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
... |
xzaemne | axemen | [
"axemen",
"examen"
] | 6 | 7 | [
{
"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... | letter_countdown | [
"<think>\n<sample>\nTo find the longest possible valid word using the given letters ['x', 'z', 'a', 'e', 'm', 'n', 'e'], we need to consider all combinations of these letters and see which one forms the longest meaningful word.\n\nFirstly, let's try combining some of the letters:\n\n- \"xe\" (not valid as it doesn'... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:56781",
"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/TAU... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"zebra",
"None of these",
"emne",
"feehgh",
"axezmnea",
"xemnax",
null,
"xanemenee"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 4,
"original_span": "zebra",
"span_end": 7711,
"span_start": 7704,
"total_spans_found": 4
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "None of these",
"span_end": 1410,
"span_star... | [
{
"details": "{'letters': 'xzaemne', 'length': 5}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "zebra",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters'... | [
[
false,
false,
false,
false
],
[
false,
false
],
[
false
],
[
false,
false,
false
],
[
false
],
[
false,
false,
false,
false
],
[],
[
false
]
] | [
[
"No such word exists",
"zebra",
"Exhaustively explore all possible combinations of the given letters and evaluate them against English language standards.",
"zebra"
],
[
"examined",
"None of these"
],
[
"emne"
],
[
"xenazine",
"feehgh",
"feehgh"
],
[
"ax... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "No such word exists",
"pattern_used": "answer tag",
"position": 1327,
"span_end": 1348,
"span_start": 1327,
"span_text": "No such word exists"
},
{
"confidence": 1,
"extracti... | [
[
{
"details": "{'letters': 'xzaemne', 'length': 16}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "Nosuchwordexists",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'xzaemne', 'le... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 0,
"pass_at_n": 0,
"percent_correct": 0,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
... |
oamasvs | amass | [
"amass",
"assam",
"massa",
"omasa",
"samas",
"samoa",
"somas",
"vamos"
] | 5 | 7 | [
{
"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... | letter_countdown | [
"<think>\nTo find the longest possible valid word using the given letters, we need to consider all possible combinations and their lengths. Here’s how I will approach it:\n\n1. **List the available letters**: o, a, m, a, s, v, s.\n2. **Identify unique characters**: The distinct characters are o, a, m, s, v.\n3. **C... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:56781",
"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/TAU... | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"automatized",
"vsvs",
"osmasvs",
null,
"ovmas",
"foossil",
"oamas",
"fast"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "automatized",
"span_end": 1474,
"span_start": 1463,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "vsvs",
"span_end": 1048,
"span_start":... | [
{
"details": "{'letters': 'oamasvs', 'length': 11}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "automatized",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'l... | [
[
false
],
[
false
],
[
false,
false
],
[],
[
false
],
[
false,
false,
false
],
[
false
],
[
false,
false
]
] | [
[
"automatized"
],
[
"vsvs"
],
[
"osmasvs",
"osmasvs"
],
[],
[
"ovmas"
],
[
"No valid word can be formed.",
"fossils",
"foossil"
],
[
"oamas"
],
[
"osma vsms",
"fast"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "automatized",
"pattern_used": "answer tag",
"position": 1463,
"span_end": 1474,
"span_start": 1463,
"span_text": "automatized"
}
],
[
{
"confidence": 1,
"extraction_type"... | [
[
{
"details": "{'letters': 'oamasvs', 'length': 11}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "automatized",
"is_correct": false,
"target_matches": false
}
],
[
{
"details": "{'letters': 'oamasvs', 'length': 4}",
"errors... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 0,
"pass_at_n": 0,
"percent_correct": 0,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
0,
... |
faqloug | afoul | [
"afoul",
"fugal"
] | 5 | 7 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo find the longest possible valid word using the given letters ['f', 'a', 'q',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:56781","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"fasrer",
null,
"No valid word can be formed.",
"qualify",
"None",
"ace",
"glufa",
"fertile"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"fasrer","span_end":2884,"span(...TRUNCATED) | [{"details":"{'letters': 'faqloug', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_fro(...TRUNCATED) | [[false,false],[],[false,false],[false],[false],[false,false,false,false],[false,false],[false,false(...TRUNCATED) | [["logfaq","fasrer"],[],["No valid word can be formed.","No valid word can be formed."],["qualify"],(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"logfaq","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'faqloug', 'length': 6}","errors":["not_a_valid_word"],"final_answer":"log(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
pogagll | gallop | [
"gallop",
"glagol"
] | 6 | 7 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\nTo find the longest possible valid word using the given letters, we need to consider all (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:56781","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
true,
false,
false,
false
] | ["gladly","poagga","None of the above options work.","pole","gall","None of these options form a val(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"gladly","span_end":1201,"span(...TRUNCATED) | [{"details":"{'letters': 'pogagll', 'length': 6}","errors":["cannot_be_formed_from_letters"],"evalua(...TRUNCATED) | [[false],[false,false],[false,false],[false,false],[true],[false],[false,false,false],[false,false,f(...TRUNCATED) | [["gladly"],["poagga","poagga"],["gallant","None of the above options work."],["pole","pole"],["gall(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"gladly","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'pogagll', 'length': 6}","errors":["cannot_be_formed_from_letters"],"final(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED) |
vuislua | uvulas | [
"uvulas",
"visual"
] | 6 | 7 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo find the longest possible valid word using the given letters ['v', 'u', 'i',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:56781","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
false,
false,
false,
true,
false,
false,
false,
false
] | [
"uvvisla",
"uisla",
"vussual",
"visual",
"avisulus",
"villablack",
"ultrasound",
"ul"
] | [{"extraction_type":"final","non_overlapping_spans":5,"original_span":"uvvisla","span_end":9224,"spa(...TRUNCATED) | [{"details":"{'letters': 'vuislua', 'length': 7}","errors":["not_a_valid_word","cannot_be_formed_fro(...TRUNCATED) | [[false,false,true,false,false],[false,false],[false,false],[true,true],[false,true,false,false,fals(...TRUNCATED) | [["fluff","There isn't enough information to determine a unique longest valid word under the given c(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"fluff","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'vuislua', 'length': 5}","errors":["cannot_be_formed_from_letters"],"final(...TRUNCATED) | {"flips_by":[1,0,0,0,1,0,0,0],"flips_total":2,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED) |
ohkauqe | kohua | [
"kohua",
"quake",
"queak"
] | 5 | 7 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\nTo find the longest possible valid word using the given letters ['o', 'h', 'k', 'a', 'u',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:56781","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"ookuahe",
null,
"ook",
"ohkuqe",
null,
"ohakue",
"hat",
"haquke"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"ookuahe","span_end":931,"span(...TRUNCATED) | [{"details":"{'letters': 'ohkauqe', 'length': 7}","errors":["not_a_valid_word","cannot_be_formed_fro(...TRUNCATED) | [[false,false],[],[true,false,false],[false,false],[],[false,false],[false,false],[false,false,false(...TRUNCATED) | [["ookuahe","ookuahe"],[],["QUAKE","None of the above options meet the criteria as they do not repre(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"ookuahe","pattern_used":"answer ta(...TRUNCATED) | [[{"details":"{'letters': 'ohkauqe', 'length': 7}","errors":["not_a_valid_word","cannot_be_formed_fr(...TRUNCATED) | {"flips_by":[0,0,1,0,0,0,0,0],"flips_total":1,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
kihaggv | giga | [
"giga",
"hagi",
"haik",
"kavi",
"kiva",
"kvah",
"vagi",
"viga"
] | 4 | 7 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\nTo solve this problem, we need to find the longest possible word that can be formed using(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:56781","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"khaviagava",
"None Found",
"kiahgiv",
"kick",
"kiahv",
"key",
"gaghikva",
"game"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"khaviagava","span_end":1791,"(...TRUNCATED) | [{"details":"{'letters': 'kihaggv', 'length': 10}","errors":["not_a_valid_word","cannot_be_formed_fr(...TRUNCATED) | [[false,false],[false,false],[false],[false,false],[false,false],[false,false,false,false,false,fals(...TRUNCATED) | [["No valid word formed","khaviagava"],["None Found","None Found"],["kiahgiv"],["kick","kick"],["kia(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"No valid word formed","pattern_use(...TRUNCATED) | [[{"details":"{'letters': 'kihaggv', 'length': 17}","errors":["not_a_valid_word","cannot_be_formed_f(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
taytzfo | azofy | [
"azofy",
"fatty"
] | 5 | 7 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo find the longest possible valid word using the given letters ['t', 'a', 'y',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:56781","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {
"backend": "litellm",
"model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl",
"n_responses": 8
} | [
true,
false,
false,
false,
false,
false,
false,
false
] | [
"toy",
"foot",
"tyozfat",
"talk",
"fly",
"typhoon",
"tyzftoa",
"tatzyfo"
] | [{"extraction_type":"final","non_overlapping_spans":6,"original_span":"toy","span_end":8978,"span_st(...TRUNCATED) | [{"details":"{'letters': 'taytzfo', 'length': 3}","errors":[],"evaluation_method":null,"extraction_r(...TRUNCATED) | [[false,false,false,false,true,true],[false,false],[false,false],[false,false,false,false,false],[fa(...TRUNCATED) | [["inconclusive","pqrsuvwx","foztaty","faothy","toy","toy"],["foot","foot"],["tyozfat","tyozfat"],["(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"inconclusive","pattern_used":"answ(...TRUNCATED) | [[{"details":"{'letters': 'taytzfo', 'length': 12}","errors":["cannot_be_formed_from_letters"],"fina(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6