letters stringlengths 5 5 | answer stringlengths 3 5 | all_best listlengths 1 9 | length int64 3 5 | letters_length int64 5 5 | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ymiai | aim | [
"aim",
"ami",
"amy",
"ima",
"imi",
"may",
"mia",
"mya",
"yam"
] | 3 | 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... | letter_countdown | [
"<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using only the given letters. Let's analyze the input:\n\nInput: ['y', 'm', 'i', 'a', 'i']\n\nFirst, let's try combining some of these letters to see if we can form a meaningful word:\n\n1. **Combine 'y', 'm', and 'i':** ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:49463",
"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-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
true,
false,
true,
true
] | [
"mai",
"mayi",
"main",
"yami",
"ami",
"mayi",
"ami",
"aim"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "mai",
"span_end": 1206,
"span_start": 1203,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "mayi",
"span_end": 1835,
"span_start": 1829,
... | [
{
"details": "{'letters': 'ymiai', 'length': 3}",
"errors": [
"not_a_valid_word"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "mai",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'ymiai', 'lengt... | [
[
false,
false
],
[
false
],
[
false,
false
],
[
false,
false
],
[
true
],
[
false,
false
],
[
true,
true
],
[
true,
true
]
] | [
[
"mai",
"mai"
],
[
"mayi"
],
[
"main",
"main"
],
[
"yami",
"yami"
],
[
"ami"
],
[
"mayi",
"mayi"
],
[
"ami",
"ami"
],
[
"aim",
"aim"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "mai",
"pattern_used": "answer tag",
"position": 851,
"span_end": 856,
"span_start": 851,
"span_text": "mai"
},
{
"confidence": 1,
"extraction_type": "internal",
"origin... | [
[
{
"details": "{'letters': 'ymiai', 'length': 3}",
"errors": [
"not_a_valid_word"
],
"final_answer": "mai",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'ymiai', 'length': 3}",
"errors": [
"not_a_valid_word"
... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 3,
"pass_at_n": 1,
"percent_correct": 0.375,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
... |
ruziz | uri | [
"uri"
] | 3 | 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... | letter_countdown | [
"<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using the given letters 'r', 'u', 'z', 'i', and 'z'. Let's break down the process:\n\n1. **Identify Available Letters**: The available letters are 'r', 'u', 'z', 'i', and 'z'.\n2. **Consider Possible Words**:\n - Start ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:49463",
"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-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"rise",
"ruz",
"uiz",
"ruz",
"RuziZ",
"ruziru",
"rutz",
"ruler"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "rise",
"span_end": 4907,
"span_start": 4903,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "ruz",
"span_end": 1684,
"span_start": 1679,
... | [
{
"details": "{'letters': 'ruziz', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "rise",
"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
]
] | [
[
"cannot be determined",
"rise"
],
[
"ruz",
"ruz"
],
[
"zip",
"uiz"
],
[
"ruz",
"ruz"
],
[
"RuziZ",
"RuziZ"
],
[
"ruziru",
"ruziru"
],
[
"rutzi",
"rutz"
],
[
"ruler",
"ruler"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "cannot be determined",
"pattern_used": "answer tag",
"position": 1322,
"span_end": 1344,
"span_start": 1322,
"span_text": "cannot be determined"
},
{
"confidence": 1,
"extrac... | [
[
{
"details": "{'letters': 'ruziz', 'length': 18}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "cannotbedetermined",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'ruziz', 'leng... | {
"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,
... |
cjloe | cole | [
"cole",
"ecol",
"joel",
"jole"
] | 4 | 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... | letter_countdown | [
"<think>\n<sample>\nTo solve this problem, we need to find the longest possible word that can be formed using only the given letters. Let's start by listing the available letters:\n\nInput: ['c', 'j', 'l', 'o', 'e']\n\nNow, let's try combining these letters to see if we can form any meaningful words:\n\n1. **Combin... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:49463",
"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-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
true,
false,
false,
false,
false,
false
] | [
"cool",
"cool",
"cole",
null,
"clove",
"coolie",
"cool",
"close"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "cool",
"span_end": 2094,
"span_start": 2090,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "cool",
"span_end": 1140,
"span_start": 1136,
... | [
{
"details": "{'letters': 'cjloe', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "cool",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': '... | [
[
false,
false
],
[
false,
false
],
[
true,
true
],
[],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
]
] | [
[
"cool",
"cool"
],
[
"cool",
"cool"
],
[
"cole",
"cole"
],
[],
[
"clove",
"clove"
],
[
"coolie",
"coolie"
],
[
"cool",
"cool"
],
[
"close",
"close"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "cool",
"pattern_used": "answer tag",
"position": 1740,
"span_end": 1746,
"span_start": 1740,
"span_text": "cool"
},
{
"confidence": 1,
"extraction_type": "internal",
"o... | [
[
{
"details": "{'letters': 'cjloe', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "cool",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'cjloe', 'length': 4}",
"errors": [
"cannot... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 1,
"pass_at_n": 1,
"percent_correct": 0.125,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
... |
bvoeu | bove | [
"bove"
] | 4 | 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... | letter_countdown | [
"<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using the given letters ['b', 'v', 'o', 'e', 'u']. Let's break down the process:\n\n1. **Identify Possible Words**: We will try different combinations of the given letters to see if any form a meaningful word.\n \n - ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:49463",
"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-0903_rl_reflect__1e_3args__grpo_minibs32_lr1e-6_rollout16-rl",
"n_responses": 8
} | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"book",
"boeu",
"ovebu",
"bob",
"bote",
"book",
"bovue",
"boeveu"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 3,
"original_span": "book",
"span_end": 4186,
"span_start": 4180,
"total_spans_found": 3
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "boeu",
"span_end": 3814,
"span_start": 3810,
... | [
{
"details": "{'letters': 'bvoeu', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "book",
"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,
false
]
] | [
[
"book",
"Book",
"book"
],
[
"boeu",
"boeu"
],
[
"ovebu",
"ovobe",
"ovebu"
],
[
"bob",
"bob"
],
[
"bote"
],
[
"book",
"book"
],
[
"BOVUE",
"bovue"
],
[
"boeveu",
"boeveu"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "book",
"pattern_used": "answer tag",
"position": 1428,
"span_end": 1434,
"span_start": 1428,
"span_text": "book"
},
{
"confidence": 1,
"extraction_type": "internal",
"o... | [
[
{
"details": "{'letters': 'bvoeu', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "book",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'bvoeu', 'length': 4}",
"errors": [
"cannot... | {
"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,
... |
ukozc | coz | [
"coz",
"kou",
"ock"
] | 3 | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest possible word that can be fo(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:49463","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"cool",
"cook",
"uckoz",
"uzc",
"unknown",
null,
"UKZC",
"cuzo"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"cool","span_end":4583,"span_s(...TRUNCATED) | [{"details":"{'letters': 'ukozc', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED) | [[false,false],[false,false],[false,false,false,false],[false,false],[false,false,false],[],[false,f(...TRUNCATED) | [["cook","cool"],["cook","cook"],["uzc","uzc","uckoz","uckoz"],["uzc","uzc"],["unknown","unknown","u(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"cook","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'ukozc', 'length': 4}","errors":["cannot_be_formed_from_letters"],"final_a(...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) |
uwsox | sou | [
"sou",
"sow",
"sox",
"usw",
"wos",
"wus"
] | 3 | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed usin(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:49463","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"uwoxts",
"use",
"washout",
"usxo",
"world",
null,
"suoxw",
"uxos"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"uwoxts","span_end":1758,"span(...TRUNCATED) | [{"details":"{'letters': 'uwsox', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [[false],[false,false],[false,false,false],[false,false],[false,false,false,false],[],[false,false],(...TRUNCATED) | [["uwoxts"],["use","use"],["None of the above","washout","washout"],["usxo","usxo"],["world","world"(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"uwoxts","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'uwsox', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from(...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) |
odrli | droil | [
"droil"
] | 5 | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest possible word that can be fo(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:49463","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
true,
false,
false,
false,
false,
false,
false,
false
] | [
"oil",
"order",
"idlor",
"order",
"ordinari",
"dirty",
null,
"loader"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"oil","span_end":1655,"span_st(...TRUNCATED) | [{"details":"{'letters': 'odrli', 'length': 3}","errors":[],"evaluation_method":null,"extraction_res(...TRUNCATED) | [
[
true,
true
],
[
false
],
[
false,
false
],
[
false,
false
],
[
false
],
[
false
],
[],
[
false,
false
]
] | [["oil","oil"],["order"],["road","idlor"],["order","order"],["ordinari"],["dirty"],[],["loader","loa(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"oil","pattern_used":"answer tag","(...TRUNCATED) | [[{"details":"{'letters': 'odrli', 'length': 3}","errors":[],"final_answer":"oil","is_correct":true,(...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) |
ijhja | hajji | [
"hajji"
] | 5 | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed usin(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:49463","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
true,
false,
true,
false,
false
] | [
"ihaja",
"ijah",
"hjia",
"jah",
"heat",
"ja",
"ijah",
"ijjah"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"ihaja","span_end":1850,"span_(...TRUNCATED) | [{"details":"{'letters': 'ijhja', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [
[
false
],
[
false,
false
],
[
false,
false
],
[
true
],
[
false,
false
],
[
true,
true
],
[
false
],
[
false
]
] | [["ihaja"],["ijah","ijah"],["cannot be formed","hjia"],["jah"],["heat","heat"],["ja","ja"],["ijah"],(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"ihaja","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'ijhja', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":2,"pass_at_n":1,"percent_correct":0.25,"(...TRUNCATED) |
azoid | azido | [
"azido",
"diazo"
] | 5 | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest possible word that can be fo(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:49463","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"adizoo",
"aidz",
"adizoo",
"d",
"iodz",
"zoo",
"aiodo",
"adiz"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"adizoo","span_end":1512,"span(...TRUNCATED) | [{"details":"{'letters': 'azoid', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [[false],[false,false],[false,false],[false,false],[false,false],[false,false],[false,false],[false](...TRUNCATED) | [["adizoo"],["aidz","aidz"],["adizoo","adizoo"],["d","d"],["iodz","iodz"],["zoo","zoo"],["aio","aiod(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"adizoo","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'azoid', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from(...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) |
ufozi | fiz | [
"fiz",
"fou",
"iof",
"iou",
"ouf",
"oui",
"ufo"
] | 3 | 5 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo solve this problem, we need to find the longest possible word that can be fo(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:49463","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED) | {"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1e_3args__grpo_minibs32_l(...TRUNCATED) | [
false,
false,
false,
false,
false,
true,
false,
false
] | [
"UFOZI",
"foodzie",
"food",
"UFOZI",
"food",
"UFO",
"ufozi",
"zofiu"
] | [{"extraction_type":"final","non_overlapping_spans":4,"original_span":"UFOZI","span_end":4679,"span_(...TRUNCATED) | [{"details":"{'letters': 'ufozi', 'length': 5}","errors":["not_a_valid_word"],"evaluation_method":nu(...TRUNCATED) | [[false,false,false,false],[false],[false,false],[false,false],[false,false],[true,true],[false,fals(...TRUNCATED) | [["fozzi","zufo","zufo","UFOZI"],["foodzie"],["food","food"],["UFOZI","UFOZI"],["food","food"],["UFO(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"fozzi","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'ufozi', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,0,1],"flips_total":1,"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
- 4