letters stringlengths 4 4 | answer stringlengths 2 4 | all_best listlengths 1 8 | length int64 2 4 | letters_length int64 4 4 | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
eanw | anew | [
"anew",
"wane",
"wean"
] | 4 | 4 | [
{
"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 only the given letters ['e', 'a', 'n', 'w'], we need to consider all combinations of these letters 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. **ea**: This doesn't ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48407",
"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
] | [
"eawn",
"ena",
"eawan",
"enew",
"awesome",
"wanew",
"enough",
"enough"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 4,
"original_span": "eawn",
"span_end": 3739,
"span_start": 3735,
"total_spans_found": 4
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "ena",
"span_end": 1030,
"span_start": 1025,
... | [
{
"details": "{'letters': 'eanw', 'length': 4}",
"errors": [
"not_a_valid_word"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "eawn",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'eanw', 'length... | [
[
false,
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.",
"eawn",
"eawn"
],
[
"ena",
"ena"
],
[
"eawan",
"eawan"
],
[
"enew",
"enew"
],
[
"awesome"
],
[
"wanew",
"wanew"
],
[
"enough",
"enough"
],
[
"enough"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "No valid word can be formed.",
"pattern_used": "answer tag",
"position": 1272,
"span_end": 1300,
"span_start": 1272,
"span_text": "No valid word can be formed."
},
{
"confidence": ... | [
[
{
"details": "{'letters': 'eanw', 'length': 22}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "Novalidwordcanbeformed",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'eanw', '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,
... |
opmm | mom | [
"mom",
"mop",
"pom"
] | 3 | 4 | [
{
"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 valid word using the given letters ['o', 'p', 'm', 'm'], we need to consider all possible combinations and ensure they form valid words according to standard English language rules (words must be at least three letters long).\n\nHere’s how I will approach it:\n\n1. **Identify potential... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48407",
"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,
true,
false
] | [
"optimum",
"pop",
"opampo",
"mother",
"optima",
"pop mom",
"pm",
"None of the provided letters can form a longer than two-letter word."
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "optimum",
"span_end": 2074,
"span_start": 2067,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "pop",
"span_end": 1223,
"span_start": 1218... | [
{
"details": "{'letters': 'opmm', 'length': 7}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "optimum",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters':... | [
[
false,
false
],
[
false
],
[
false,
false,
false,
false,
true,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
true
],
[
false,
false
]
] | [
[
"No valid word can be formed",
"optimum"
],
[
"pop"
],
[
"No valid word can be formed.",
"No valid word can be formed.",
"ompm",
"ompm",
"mom",
"opampo"
],
[
"mother",
"mother"
],
[
"impossible",
"optima"
],
[
"pop mom",
"pop mom"
]... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "No valid word can be formed",
"pattern_used": "answer tag",
"position": 1953,
"span_end": 1982,
"span_start": 1953,
"span_text": "No valid word can be formed"
},
{
"confidence": 1,... | [
[
{
"details": "{'letters': 'opmm', 'length': 22}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "Novalidwordcanbeformed",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'opmm', 'le... | {
"flips_by": [
0,
0,
1,
0,
0,
0,
0,
0
],
"flips_total": 1,
"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,
... |
iwhj | hi | [
"hi",
"hw",
"iw",
"ji",
"wh",
"wi"
] | 2 | 4 | [
{
"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', 'w', 'h', 'j'], we need to consider all combinations and their lengths. Here’s how I would approach it:\n\n1. **Identify all possible words** that can be formed from these four letters.\n - iwj\n - ihw\n - ihj\n - iwj\n - ijw\... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48407",
"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,
true,
false,
false,
false,
false
] | [
"ijw",
"shywig",
"whij",
"hi",
"heat",
"hiwj",
"ihwj",
"house"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "ijw",
"span_end": 828,
"span_start": 823,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "shywig",
"span_end": 1318,
"span_start": 1310,
... | [
{
"details": "{'letters': 'iwhj', 'length': 3}",
"errors": [
"not_a_valid_word"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "ijw",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'iwhj', 'length'... | [
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
true
],
[
false
],
[
false
],
[
false
],
[
false,
false
]
] | [
[
"ijw",
"ijw"
],
[
"shywig",
"shywig"
],
[
"No valid word exists",
"whij"
],
[
"hi"
],
[
"heat"
],
[
"hiwj"
],
[
"ihwj"
],
[
"house",
"house"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "ijw",
"pattern_used": "answer tag",
"position": 770,
"span_end": 775,
"span_start": 770,
"span_text": "ijw"
},
{
"confidence": 1,
"extraction_type": "internal",
"origin... | [
[
{
"details": "{'letters': 'iwhj', 'length': 3}",
"errors": [
"not_a_valid_word"
],
"final_answer": "ijw",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'iwhj', 'length': 3}",
"errors": [
"not_a_valid_word"
... | {
"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,
... |
uumf | fum | [
"fum",
"umu"
] | 3 | 4 | [
{
"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', 'u', 'm', 'f'], we need to consider all combinations and see which ones form valid words according to standard English dictionary rules (words must be at least three letters long).\n\nHere’s how I will approach it:\n\n1. **Identify Vali... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48407",
"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
] | [
"undefined",
"uff",
"fun",
"unfurled",
"umbrella",
"No valid word can be formed.",
"No valid word can be formed.",
"umm"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "undefined",
"span_end": 2042,
"span_start": 2033,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "uff",
"span_end": 2436,
"span_start": 24... | [
{
"details": "{'letters': 'uumf', 'length': 9}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "undefined",
"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
]
] | [
[
"No valid three-word phrase can be created using the given letters.",
"undefined"
],
[
"uff"
],
[
"No valid word can be formed.",
"fuu",
"fun"
],
[
"fun",
"unfurled"
],
[
"umbrella",
"umbrella"
],
[
"No valid word can be formed.",
"No valid word ... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "No valid three-word phrase can be created using the given letters.",
"pattern_used": "answer tag",
"position": 1892,
"span_end": 1958,
"span_start": 1892,
"span_text": "No valid three-word phras... | [
[
{
"details": "{'letters': 'uumf', 'length': 54}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "Novalidthreewordphrasecanbecreatedusingthegivenletters",
"is_correct": false,
"target_matches": false
},
{
"de... | {
"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,
... |
oakl | kalo | [
"kalo",
"kola",
"loka"
] | 4 | 4 | [
{
"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 ['o', 'a', 'k', 'l'], we need to consider all combinations of these letters and see which ones form words that make sense according to standard English dictionary rules.\n\n1. **Start with individual letters**: \n - o\n - a\n - k\n - ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48407",
"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,
false,
false,
false,
false,
false,
true,
false
] | [
"oka",
"all",
"No valid word found",
"oalkoalk",
"No valid word can be formed",
"No valid word",
"oka",
"agent"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "oka",
"span_end": 1700,
"span_start": 1695,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "all",
"span_end": 877,
"span_start": 872,
... | [
{
"details": "{'letters': 'oakl', 'length': 3}",
"errors": [],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "oka",
"is_correct": true,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'oakl', 'length': 3}",
"errors": [
"c... | [
[
true
],
[
false
],
[
false
],
[
false
],
[
false,
false
],
[
false
],
[
false,
true
],
[
false
]
] | [
[
"oka"
],
[
"all"
],
[
"No valid word found"
],
[
"oalkoalk"
],
[
"No valid word can be formed",
"No valid word can be formed"
],
[
"No valid word"
],
[
"No valid word can be formed",
"oka"
],
[
"agent"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "oka",
"pattern_used": "answer tag",
"position": 1695,
"span_end": 1700,
"span_start": 1695,
"span_text": "oka"
}
],
[
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'oakl', 'length': 3}",
"errors": [],
"final_answer": "oka",
"is_correct": true,
"target_matches": false
}
],
[
{
"details": "{'letters': 'oakl', 'length': 3}",
"errors": [
"cannot_be_formed_from_letters"
],
"fi... | {
"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... |
avnh | avn | [
"avn",
"han",
"hav",
"nav",
"van"
] | 3 | 4 | [
{
"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 ['a', 'v', 'n', 'h'], we need to consider all combinations and ensure they form valid words according to standard English dictionary rules.\n\nFirstly, let's try combining these letters:\n\n1. **avnh**: This doesn't make sense as \"annihilate... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:48407",
"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,
true,
false,
false,
true,
false,
false,
false
] | [
"None of the provided letters ('a', 'v', 'n', 'h') form a valid English word when combined.",
"avn",
"naveh",
"annihilate",
"van",
"nineteen",
"avanh",
"avatar"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "None of the provided letters ('a', 'v', 'n', 'h') form a valid English word when combined.",
"span_end": 1890,
"span_start": 1800,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_... | [
{
"details": "{'letters': 'avnh', 'length': 61}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "NoneoftheprovidedlettersavnhformavalidEnglishwordwhencombined",
"is_correct": false,
... | [
[
false,
false
],
[
true
],
[
false,
false,
false
],
[
false,
false
],
[
true
],
[
false
],
[
false,
false,
false
],
[
false
]
] | [
[
"None of the provided letters ('a', 'v', 'n', 'h') form a valid English word when combined.",
"None of the provided letters ('a', 'v', 'n', 'h') form a valid English word when combined."
],
[
"avn"
],
[
"No valid word can be formed.",
"nah",
"naveh"
],
[
"annihilate",
"... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "None of the provided letters ('a', 'v', 'n', 'h') form a valid English word when combined.",
"pattern_used": "answer tag",
"position": 1652,
"span_end": 1742,
"span_start": 1652,
"span_text": "N... | [
[
{
"details": "{'letters': 'avnh', 'length': 61}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "NoneoftheprovidedlettersavnhformavalidEnglishwordwhencombined",
"is_correct": false,
"target_matches": false
},
{
... | {
"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... |
ejfh | feh | [
"feh",
"jef"
] | 3 | 4 | [{"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 ['e', 'j', 'f', 'h'], we (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48407","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
] | [
"heffe",
"eff",
"foot",
"friend",
"efhj",
"No valid word can be created.",
"heat",
"ehfhj"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"heffe","span_end":2226,"span_(...TRUNCATED) | [{"details":"{'letters': 'ejfh', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from_l(...TRUNCATED) | [[false,false],[false],[false],[false,false],[false,false],[false,false],[false,false],[false,false,(...TRUNCATED) | [["heffe","heffe"],["eff"],["foot"],["friend","friend"],["efhj","efhj"],["No valid word can be creat(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"heffe","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'ejfh', '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":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED) |
itzt | tit | [
"tit",
"zit"
] | 3 | 4 | [{"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 ['i', 't', 'z', 't'], we (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48407","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
] | [
"itzitzt",
"itz",
"itz",
"i zt",
"No such word exists",
"tittiz",
"its",
"itz"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"itzitzt","span_end":1585,"spa(...TRUNCATED) | [{"details":"{'letters': 'itzt', 'length': 7}","errors":["not_a_valid_word","cannot_be_formed_from_l(...TRUNCATED) | [[false,false],[false,false],[false,false],[false,false,false,false,false],[false],[false],[false,fa(...TRUNCATED) | [["itzitzt","itzitzt"],["itz","itz"],["itz","itz"],["None found","No valid word can be formed.","itz(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"itzitzt","pattern_used":"answer ta(...TRUNCATED) | [[{"details":"{'letters': 'itzt', 'length': 7}","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) |
rwuz | wur | [
"wur"
] | 3 | 4 | [{"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 ['r', 'w', 'u', 'z'], we (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48407","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
] | [
"rule",
"ruler",
"workroom",
"No valid word can be formed.",
"No valid word",
"ruzu",
"Rules",
"rutz"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"rule","span_end":1356,"span_s(...TRUNCATED) | [{"details":"{'letters': 'rwuz', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluatio(...TRUNCATED) | [
[
false,
false
],
[
false
],
[
false
],
[
false,
false
],
[
false
],
[
false,
false
],
[
false
],
[
false
]
] | [["rule","rule"],["ruler"],["workroom"],["No valid word can be formed","No valid word can be formed.(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"rule","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'rwuz', 'length': 4}","errors":["cannot_be_formed_from_letters"],"final_an(...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) |
unig | gin | [
"gin",
"gnu",
"gun",
"ign",
"ing",
"nig",
"ung",
"uni"
] | 3 | 4 | [{"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', 'n', 'i', 'g'], we (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:48407","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
] | [
"ignu",
"ungni",
"No valid word",
"unit ; igniter",
"gungi",
"unitag",
"unit",
"ugly"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"ignu","span_end":1340,"span_s(...TRUNCATED) | [{"details":"{'letters': 'unig', 'length': 4}","errors":["not_a_valid_word"],"evaluation_method":nul(...TRUNCATED) | [
[
false,
false
],
[
false,
false
],
[
false
],
[
false,
false,
false
],
[
false
],
[
false
],
[
false
],
[
false
]
] | [["ignu","ignu"],["ungini","ungni"],["No valid word"],["No valid word can be formed.","unit ; ignite(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"ignu","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'unig', 'length': 4}","errors":["not_a_valid_word"],"final_answer":"ignu",(...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) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6