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>\nTo find the longest possible valid word using the given letters ['y', 'm', 'i', 'a', 'i'], we need to consider all possible combinations and see which one forms the largest word while adhering to the rules provided.\n\nFirstly, let’s try combining some of these letters:\n\n1. **yi**: This doesn't form a m... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:40593",
"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
} | [
true,
true,
false,
false,
false,
false,
false,
false
] | [
"amy",
"aim",
"myai",
"my or mai",
"aim , my",
"No valid word found",
"airplane",
"amiya"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "amy",
"span_end": 1444,
"span_start": 1441,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "aim",
"span_end": 1117,
"span_start": 1112,
... | [
{
"details": "{'letters': 'ymiai', 'length': 3}",
"errors": [],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "amy",
"is_correct": true,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'ymiai', 'length': 3}",
"errors": [],
... | [
[
true
],
[
true
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false
],
[
false,
false
],
[
false
]
] | [
[
"amy"
],
[
"aim"
],
[
"myai",
"myai"
],
[
"my or mai",
"my or mai"
],
[
"aim , my",
"aim , my"
],
[
"No valid word found"
],
[
"No valid word found.",
"airplane"
],
[
"amiya"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "amy",
"pattern_used": "answer tag",
"position": 1441,
"span_end": 1444,
"span_start": 1441,
"span_text": "amy"
}
],
[
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'ymiai', 'length': 3}",
"errors": [],
"final_answer": "amy",
"is_correct": true,
"target_matches": false
}
],
[
{
"details": "{'letters': 'ymiai', 'length': 3}",
"errors": [],
"final_answer": "aim",
"is_correct": true,... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"num_correct": 2,
"pass_at_n": 1,
"percent_correct": 0.25,
"skill_count": {
"answer_revision": [
0,
0,
0,
0,
0,
0,
0,
0
],
"best_of_n": [
0,
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>\nTo find the longest possible valid word using the given letters ('r', 'u', 'z', 'i', 'z'), we need to consider all combinations and ensure they form valid words according to standard English language rules (words must be five or more letters long).\n\nHere’s how I will approach it:\n\n1. **Identify Potent... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:40593",
"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
] | [
"rise",
"No definitive longword can be formed",
"run",
"No valid word",
"No valid word exists",
"riz",
"No valid longer word can be formed.",
"\"russian\""
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "rise",
"span_end": 1363,
"span_start": 1359,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "No definitive longword can be formed",
"span_end"... | [
{
"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,
false
]
] | [
[
"rise",
"rise"
],
[
"No definitive longword can be formed",
"No definitive longword can be formed"
],
[
"run"
],
[
"No valid word",
"No valid word"
],
[
"No valid word exists",
"No valid word exists"
],
[
"riz",
"riz"
],
[
"No valid longer wo... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "rise",
"pattern_used": "answer tag",
"position": 1285,
"span_end": 1291,
"span_start": 1285,
"span_text": "rise"
},
{
"confidence": 1,
"extraction_type": "internal",
"o... | [
[
{
"details": "{'letters': 'ruziz', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "rise",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'ruziz', '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,
... |
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>\nTo find the longest possible valid word using the given letters ['c', 'j', 'l', 'o', 'e'], we need to consider all combinations and see which ones form valid words according to standard English dictionary rules (i.e., no spaces between words).\n\nHere’s how I would approach it:\n\n1. **Identify potential ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:40593",
"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
] | [
"cool",
"closet",
"cleo",
null,
"college",
"clj",
"COOL",
"cloeoe"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "cool",
"span_end": 1158,
"span_start": 1152,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "closet",
"span_end": 1298,
"span_start": 1290... | [
{
"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
],
[],
[
false,
false
],
[
false,
false
],
[
false
],
[
false
]
] | [
[
"cool"
],
[
"closet",
"closet"
],
[
"cleo"
],
[],
[
"No valid word can be formed.",
"college"
],
[
"clj",
"clj"
],
[
"COOL"
],
[
"cloeoe"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "cool",
"pattern_used": "answer tag",
"position": 1152,
"span_end": 1158,
"span_start": 1152,
"span_text": "cool"
}
],
[
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'cjloe', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "cool",
"is_correct": false,
"target_matches": false
}
],
[
{
"details": "{'letters': 'cjloe', 'length': 6}",
"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,
... |
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>\nTo find the longest possible valid word using the given letters ['b', 'v', 'o', 'e', 'u'], we need to consider all combinations and see which ones form valid words according to standard English dictionary rules. Here’s how I would approach it:\n\n1. **Identify Valid Words**: We start by identifying any va... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:40593",
"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
] | [
"above",
"bvou",
"book",
"bove or overbu",
"ove",
"bvou",
"above",
"bovue"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "above",
"span_end": 1418,
"span_start": 1411,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "bvou",
"span_end": 448,
"span_start": 444,
... | [
{
"details": "{'letters': 'bvoeu', 'length': 5}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "above",
"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
]
] | [
[
"above",
"above"
],
[
"bvou",
"bvou"
],
[
"No valid word can be constructed.",
"book"
],
[
"bove or overbu",
"bove or overbu"
],
[
"ove",
"ove"
],
[
"bvou",
"bvou"
],
[
"above"
],
[
"bovue",
"bovue"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "above",
"pattern_used": "answer tag",
"position": 1346,
"span_end": 1353,
"span_start": 1346,
"span_text": "above"
},
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'bvoeu', 'length': 5}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "above",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'bvoeu', 'length': 5}",
"errors": [
"canno... | {
"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 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 ['u', 'k', 'o', 'z', 'c'], we need to consider all combinations and ensure they form meaningful words. Here’s how I would approach it:\n\n1. **Identify Potential Words**: We start by trying different permutations of these letters.\n - \"uko... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:40593",
"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
] | [
"zooku",
"KOK",
"uckaz",
"None of the above",
"ukaz",
"uncork",
"kuoz",
"ukocuz"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "zooku",
"span_end": 1423,
"span_start": 1416,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "KOK",
"span_end": 1440,
"span_start": 1437,
... | [
{
"details": "{'letters': 'ukozc', 'length': 5}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "zooku",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
... | [
[
false,
false
],
[
false
],
[
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
]
] | [
[
"zooku",
"zooku"
],
[
"KOK"
],
[
"uckaz"
],
[
"None of the above",
"None of the above"
],
[
"ukaz",
"ukaz"
],
[
"uncork",
"uncork"
],
[
"kuoz",
"kuoz"
],
[
"None of the above options provide a clear-cut valid word as per standard Engl... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "zooku",
"pattern_used": "answer tag",
"position": 1341,
"span_end": 1348,
"span_start": 1341,
"span_text": "zooku"
},
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'ukozc', 'length': 5}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "zooku",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'ukozc', 'length': 5}",
... | {
"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,
... |
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>\nTo find the longest valid word using the given letters ['u', 'w', 's', 'o', 'x'], we need(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:40593","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
] | [
"uxs",
"world",
null,
"ux",
"XBOX",
"usage",
"woxs",
"using"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"uxs","span_end":1382,"span_st(...TRUNCATED) | [{"details":"{'letters': 'uwsox', 'length': 3}","errors":["not_a_valid_word"],"evaluation_method":nu(...TRUNCATED) | [
[
false
],
[
false
],
[],
[
true,
true
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false
]
] | [["uxs"],["world"],[],["ux","ux"],["No valid word can be created.","XBOX"],["usage","usage"],["woxs"(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"uxs","pattern_used":"answer tag","(...TRUNCATED) | [[{"details":"{'letters': 'uwsox', 'length': 3}","errors":["not_a_valid_word"],"final_answer":"uxs",(...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) |
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>\nTo find the longest valid word using the given letters ['o', 'd', 'r', 'l', 'i'], we need(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:40593","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,
true,
false,
false,
false,
false,
false,
false
] | [
"rode",
"old",
"oirld",
"odrli",
"road",
null,
"ride",
"ridlo"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"rode","span_end":1191,"span_s(...TRUNCATED) | [{"details":"{'letters': 'odrli', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED) | [
[
false,
false
],
[
true
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[],
[
false,
false
],
[
false,
false
]
] | [["rode","rode"],["old"],["oirld","oirld"],["odrli","odrli"],["road","road"],[],["ride","ride"],["ri(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"rode","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'odrli', '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":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>\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:40593","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
] | ["ijhja","No valid word can be formed","iahja","ija",null,"No valid word can be formed","jhjah","jar(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"ijhja","span_end":1265,"span_(...TRUNCATED) | [{"details":"{'letters': 'ijhja', 'length': 5}","errors":["not_a_valid_word"],"evaluation_method":nu(...TRUNCATED) | [
[
false
],
[
false,
false
],
[
false
],
[
false,
false
],
[],
[
false
],
[
false,
false,
false,
false
],
[
false,
false
]
] | [["ijhja"],["No valid word can be formed","No valid word can be formed"],["iahja"],["ija","ija"],[],(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"ijhja","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'ijhja', 'length': 5}","errors":["not_a_valid_word"],"final_answer":"ijhja(...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) |
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>\nTo find the longest possible valid word using only the given letters ('a', 'z', 'o', 'i',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:40593","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
] | [
"aiodz",
"adiz",
"Airborne Zebra Ice",
"adiozie",
"aioz",
"adio",
"adizoo",
"zoo"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"aiodz","span_end":757,"span_s(...TRUNCATED) | [{"details":"{'letters': 'azoid', 'length': 5}","errors":["not_a_valid_word"],"evaluation_method":nu(...TRUNCATED) | [[false,false],[false,false],[false,false,false],[false],[false],[false],[false,false],[false,false](...TRUNCATED) | [["aiodz","aiodz"],["adiz","adiz"],["No valid word found","airplane","Airborne Zebra Ice"],["adiozie(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"aiodz","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'azoid', 'length': 5}","errors":["not_a_valid_word"],"final_answer":"aiodz(...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>\nTo find the longest possible valid word using the given letters ('u', 'f', 'o', 'z', 'i')(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:40593","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,
true,
false,
false,
true,
false,
false
] | [
"None of the above",
"fuzoi",
"UFO",
null,
"No such word exists",
"UFO",
"fox",
"ufozi"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"None of the above","span_end"(...TRUNCATED) | [{"details":"{'letters': 'ufozi', 'length': 14}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | [
[
false
],
[
false
],
[
true,
true
],
[],
[
false,
false
],
[
true,
true
],
[
false,
false
],
[
false,
false
]
] | [["None of the above"],["fuzoi"],["UFO","UFO"],[],["fuozi","No such word exists"],["UFO","UFO"],["fo(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"None of the above","pattern_used":(...TRUNCATED) | [[{"details":"{'letters': 'ufozi', 'length': 14}","errors":["not_a_valid_word","cannot_be_formed_fro(...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) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5