letters stringlengths 6 6 | answer stringlengths 3 6 | all_best listlengths 1 9 | length int64 3 6 | letters_length int64 6 6 | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
mrtuob | rumbo | [
"rumbo",
"tumor",
"turbo"
] | 5 | 6 | [
{
"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 ('m', 'r', 't', 'u', 'o', 'b'), we need to consider all combinations and ensure they form valid words according to standard English language rules.\n\nFirstly, let’s try combining these letters into one word:\n\n- mrtuo - This doesn't seem to... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:36805",
"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
] | [
"mortubo",
"No valid word exists.",
"No valid word can be formed",
"mother",
"moortub",
"motrubu",
"browutm",
"mountain"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "mortubo",
"span_end": 1338,
"span_start": 1329,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "No valid word exists.",
"span_end": 1406,
... | [
{
"details": "{'letters': 'mrtuob', 'length': 7}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "mortubo",
"is_correct": false,
"reason": null,
"target_matches": false
},
{... | [
[
false
],
[
false,
false
],
[
false
],
[
false
],
[
false,
false
],
[
false
],
[
false,
false
],
[
false,
false
]
] | [
[
"mortubo"
],
[
"No valid word exists.",
"No valid word exists."
],
[
"No valid word can be formed"
],
[
"mother"
],
[
"moortub",
"moortub"
],
[
"motrubu"
],
[
"browutm",
"browutm"
],
[
"mountain",
"mountain"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "mortubo",
"pattern_used": "answer tag",
"position": 1329,
"span_end": 1338,
"span_start": 1329,
"span_text": "mortubo"
}
],
[
{
"confidence": 1,
"extraction_type": "inter... | [
[
{
"details": "{'letters': 'mrtuob', 'length': 7}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "mortubo",
"is_correct": false,
"target_matches": false
}
],
[
{
"details": "{'letters': 'mrtuob', 'length... | {
"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,
... |
gaoqce | cage | [
"cage"
] | 4 | 6 | [
{
"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 ['g', 'a', 'o', 'q', 'c', 'e'], we need to consider all combinations and ensure they form valid words according to standard English dictionary rules.\n\nFirstly, let’s try combining some of these letters:\n\n1. **Combining 'g', 'a', 'o':**\n ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:36805",
"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,
false,
true
] | [
"geo",
"gate",
"gee",
"go away",
"gaoceq",
"goat",
"queue",
"ago"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "geo",
"span_end": 1140,
"span_start": 1135,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "gate",
"span_end": 1189,
"span_start": 1183,
... | [
{
"details": "{'letters': 'gaoqce', 'length': 3}",
"errors": [],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "geo",
"is_correct": true,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'gaoqce', 'length': 4}",
"errors": [
... | [
[
true
],
[
false,
false
],
[
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
true
]
] | [
[
"geo"
],
[
"gate",
"gate"
],
[
"gee"
],
[
"go away",
"go away"
],
[
"gaoceq",
"gaoceq"
],
[
"goat",
"goat"
],
[
"queue",
"queue"
],
[
"ago"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "geo",
"pattern_used": "answer tag",
"position": 1135,
"span_end": 1140,
"span_start": 1135,
"span_text": "geo"
}
],
[
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'gaoqce', 'length': 3}",
"errors": [],
"final_answer": "geo",
"is_correct": true,
"target_matches": false
}
],
[
{
"details": "{'letters': 'gaoqce', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
... | {
"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... |
ylfufi | iffy | [
"iffy",
"luff",
"uily"
] | 4 | 6 | [
{
"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', 'l', 'f', 'u', 'f', 'i'], we need to consider all combinations and ensure they form valid words according to standard English dictionary rules. Here’s how I would approach it:\n\n1. **Identify Possible Words**: Start by looking at small... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:36805",
"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,
false,
false,
false,
false
] | [
"flyfisher",
"fly",
"fluffy",
"fluffy",
"flight",
"ylliu",
"flyufi",
"ifuyl"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "flyfisher",
"span_end": 872,
"span_start": 861,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "fly",
"span_end": 2038,
"span_start": 2033... | [
{
"details": "{'letters': 'ylfufi', 'length': 9}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "flyfisher",
"is_correct": false,
"reason": null,
"target_matches": false
},
... | [
[
false
],
[
true,
true
],
[
false
],
[
false,
false
],
[
false,
false
],
[
false
],
[
false
],
[
false,
false
]
] | [
[
"flyfisher"
],
[
"fly",
"fly"
],
[
"fluffy"
],
[
"fluffy",
"fluffy"
],
[
"flight",
"flight"
],
[
"ylliu"
],
[
"flyufi"
],
[
"ifuyl",
"ifuyl"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "flyfisher",
"pattern_used": "answer tag",
"position": 861,
"span_end": 872,
"span_start": 861,
"span_text": "flyfisher"
}
],
[
{
"confidence": 1,
"extraction_type": "inte... | [
[
{
"details": "{'letters': 'ylfufi', 'length': 9}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "flyfisher",
"is_correct": false,
"target_matches": false
}
],
[
{
"details": "{'letters': 'ylfufi', 'leng... | {
"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,
... |
athtuv | tuath | [
"tuath"
] | 5 | 6 | [
{
"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>\nFirst, I'll try to understand the problem better by writing out a plan and go really deep into detail about how I should solve this.\nThe goal is to find the longest possible valid word using only the given letters. To achieve this, we need to consider all possible combinations of the provided letters and... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:36805",
"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,
true,
false,
false,
false
] | [
"hat",
"avthu",
"thautuv",
"hatu",
"hat",
"hatuv",
"thu",
"hatuv"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "hat",
"span_end": 3114,
"span_start": 3109,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "avthu",
"span_end": 1358,
"span_start": 1351,
... | [
{
"details": "{'letters': 'athtuv', 'length': 3}",
"errors": [],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "hat",
"is_correct": true,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'athtuv', 'length': 5}",
"errors": [
... | [
[
true,
true
],
[
false
],
[
false,
false
],
[
false,
false
],
[
true,
true
],
[
false
],
[
false,
false
],
[
false,
false,
false,
false
]
] | [
[
"hat",
"hat"
],
[
"avthu"
],
[
"thautuv",
"thautuv"
],
[
"hatu",
"hatu"
],
[
"hat",
"hat"
],
[
"hatuv"
],
[
"thu",
"thu"
],
[
"\"hatuv\"",
"hatuv",
"hatuv",
"hatuv"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "hat",
"pattern_used": "answer tag",
"position": 3036,
"span_end": 3041,
"span_start": 3036,
"span_text": "hat"
},
{
"confidence": 1,
"extraction_type": "internal",
"ori... | [
[
{
"details": "{'letters': 'athtuv', 'length': 3}",
"errors": [],
"final_answer": "hat",
"is_correct": true,
"target_matches": false
},
{
"details": "{'letters': 'athtuv', 'length': 3}",
"errors": [],
"final_answer": "hat",
"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... |
awskie | askew | [
"askew",
"kiswa",
"waise",
"wakes",
"wekas"
] | 5 | 6 | [
{
"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', 'w', 's', 'k', 'i', 'e'), we need to consider all 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 would approach it:\n\n1. **Identif... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:36805",
"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,
false,
false,
false,
true
] | [
"accessory",
"wake",
"skie",
"whales",
"cake",
"keep",
"access",
"ake"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "accessory",
"span_end": 1731,
"span_start": 1720,
"total_spans_found": 1
},
{
"extraction_type": "final",
"non_overlapping_spans": 1,
"original_span": "wake",
"span_end": 787,
"span_start": 78... | [
{
"details": "{'letters': 'awskie', 'length': 9}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "accessory",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'lette... | [
[
false
],
[
true
],
[
false
],
[
false
],
[
false,
false
],
[
false
],
[
false,
false
],
[
true
]
] | [
[
"accessory"
],
[
"wake"
],
[
"skie"
],
[
"whales"
],
[
"cake",
"cake"
],
[
"keep"
],
[
"access",
"access"
],
[
"ake"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "accessory",
"pattern_used": "answer tag",
"position": 1720,
"span_end": 1731,
"span_start": 1720,
"span_text": "accessory"
}
],
[
{
"confidence": 1,
"extraction_type": "i... | [
[
{
"details": "{'letters': 'awskie', 'length': 9}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "accessory",
"is_correct": false,
"target_matches": false
}
],
[
{
"details": "{'letters': 'awskie', 'length': 4}",
"errors": []... | {
"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... |
wsuigf | figs | [
"figs",
"fugs",
"sufi",
"sugi",
"swig",
"wigs"
] | 4 | 6 | [
{
"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 ('w', 's', 'u', 'i', 'g', 'f'), we need to consider all combinations and ensure they form meaningful words. Here’s how I will approach it:\n\n1. **Identify Possible Words**: Start by trying different combinations of these letters.\n2. **Check... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:36805",
"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
] | [
"wishful",
"No valid word can be formed.",
"wish",
"fix",
"wiseguy",
"wish",
"gisufga or gisufgs",
"supercalifragilisticexpialidocious"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "wishful",
"span_end": 932,
"span_start": 923,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "No valid word can be formed.",
"span_end": 1684,... | [
{
"details": "{'letters': 'wsuigf', 'length': 7}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "wishful",
"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
]
] | [
[
"wishful",
"wishful"
],
[
"No valid word can be formed.",
"No valid word can be formed."
],
[
"wish"
],
[
"fix",
"fix"
],
[
"No valid longer word found",
"wiseguy"
],
[
"wish",
"wish"
],
[
"gisufga or gisufgs",
"gisufga or gisufgs"
],
... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "wishful",
"pattern_used": "answer tag",
"position": 846,
"span_end": 855,
"span_start": 846,
"span_text": "wishful"
},
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'wsuigf', 'length': 7}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "wishful",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'wsuigf', 'length': 7}",
"errors": [
"c... | {
"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,
... |
qentur | enrut | [
"enrut",
"quent",
"quern",
"tuner",
"urent"
] | 5 | 6 | [
{
"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 ['q', 'e', 'n', 't', 'u', 'r'], we need to consider all combinations and see which ones form meaningful 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. ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:36805",
"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
] | [
"rant",
"quarantined",
"quinternary",
"No valid word can be formed using the exact set of letters provided.",
"No valid word can be formed",
"quennen",
"nut",
"unquert"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "rant",
"span_end": 1944,
"span_start": 1938,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "quarantined",
"span_end": 1192,
"span_start":... | [
{
"details": "{'letters': 'qentur', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "rant",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': ... | [
[
true,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
false
],
[
true,
true
],
[
false
]
] | [
[
"run",
"rant"
],
[
"quarantined",
"quarantined"
],
[
"quinternary",
"quinternary"
],
[
"No valid word can be formed using the exact set of letters provided.",
"No valid word can be formed using the exact set of letters provided."
],
[
"None of the above options ... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "run",
"pattern_used": "answer tag",
"position": 1848,
"span_end": 1853,
"span_start": 1848,
"span_text": "run"
},
{
"confidence": 1,
"extraction_type": "internal",
"ori... | [
[
{
"details": "{'letters': 'qentur', 'length': 3}",
"errors": [],
"final_answer": "run",
"is_correct": true,
"target_matches": false
},
{
"details": "{'letters': 'qentur', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_... | {
"flips_by": [
1,
0,
0,
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,
... |
attxba | batta | [
"batta"
] | 5 | 6 | [{"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 ['a', 't', 't', 'x', 'b',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:36805","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,
true,
false,
false
] | [
"batx",
"atxab",
"apple",
"aab",
"abxtb",
"bat",
"table",
"hat"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"batx","span_end":2142,"span_s(...TRUNCATED) | [{"details":"{'letters': 'attxba', 'length': 4}","errors":["not_a_valid_word"],"evaluation_method":n(...TRUNCATED) | [
[
false,
false
],
[
false
],
[
false,
false
],
[
false,
false
],
[
false,
false
],
[
true
],
[
false
],
[
false
]
] | [["batx","batx"],["atxab"],["apple","apple"],["No valid four-letter word can be formed","aab"],["abx(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"batx","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'attxba', 'length': 4}","errors":["not_a_valid_word"],"final_answer":"batx(...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) |
ocrgeu | courge | [
"courge"
] | 6 | 6 | [{"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', 'c', 'r', 'g', 'e',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:36805","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
] | [
"orange",
"ocregu",
"ocruge",
"urgency",
"No valid word found",
"ocullo",
"ugliest",
"no valid word"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"orange","span_end":2084,"span(...TRUNCATED) | [{"details":"{'letters': 'ocrgeu', 'length': 6}","errors":["cannot_be_formed_from_letters"],"evaluat(...TRUNCATED) | [[false,false],[false],[false,false],[false,false],[false],[false,false,false,false],[false,false],[(...TRUNCATED) | [["None of the above options form a valid English word using solely the given letters.","orange"],["(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"None of the above options form a v(...TRUNCATED) | [[{"details":"{'letters': 'ocrgeu', 'length': 68}","errors":["not_a_valid_word","cannot_be_formed_fr(...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) |
uobkax | abox | [
"abox",
"baku",
"bauk",
"bouk",
"kobu",
"kuba"
] | 4 | 6 | [{"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', 'o', 'b', 'k', 'a',(...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:36805","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
] | ["book","auo","No valid word can be created.","aba","bookax","No valid word can be formed","axu","oo(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"book","span_end":1324,"span_s(...TRUNCATED) | [{"details":"{'letters': 'uobkax', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluat(...TRUNCATED) | [[false,false],[false,false],[false,false],[false],[false,false],[false,false],[false,false],[false,(...TRUNCATED) | [["book","book"],["auo","auo"],["No valid word can be created.","No valid word can be created."],["a(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"book","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'uobkax', 'length': 4}","errors":["cannot_be_formed_from_letters"],"final_(...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