Dataset Viewer
Auto-converted to Parquet Duplicate
letters
stringlengths
7
7
answer
stringlengths
4
7
all_best
listlengths
1
10
length
int64
4
7
letters_length
int64
7
7
prompt
listlengths
2
2
task_source
stringclasses
1 value
model_responses__example_annotation
listlengths
8
8
model_responses__example_annotation__finish_reason_length_flags
listlengths
8
8
model_responses__example_annotation__length_partial_responses
listlengths
8
8
prompt__example_annotation__metadata
dict
model_responses__example_annotation__metadata
dict
model_responses__example_annotation__eval_is_correct
listlengths
8
8
model_responses__example_annotation__eval_extracted_answers
listlengths
8
8
model_responses__example_annotation__eval_extraction_metadata
listlengths
8
8
model_responses__example_annotation__eval_evaluation_metadata
listlengths
8
8
model_responses__example_annotation__internal_answers__eval_is_correct
listlengths
8
8
model_responses__example_annotation__internal_answers__eval_extracted_answers
listlengths
8
8
model_responses__example_annotation__internal_answers__eval_extraction_metadata
listlengths
8
8
model_responses__example_annotation__internal_answers__eval_evaluation_metadata
listlengths
8
8
model_responses__example_annotation__metrics
dict
ehpxgoi
ephoi
[ "ephoi", "pioxe" ]
5
7
[ { "content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.", "role": "system" }, { "content": "Answer the following problem. E...
letter_countdown
[ "<think>\n<sample>\nTo solve this problem, we need to form the longest possible word using the given letters ['e', 'h', 'p', 'x', 'g', 'o', 'i']. Let's try different combinations:\n\n1. **Combination**: ehoixpg\n - This combination uses all the letters exactly once.\n - The resulting word is \"ephoxipg\".\n \...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:56413", "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 ]
[ "ee", "efhsrt", "ehpoxgi", "expi", "None of the above", "ehpoistfgrio", "hoping", "hello" ]
[ { "extraction_type": "final", "non_overlapping_spans": 6, "original_span": "ee", "span_end": 6411, "span_start": 6407, "total_spans_found": 6 }, { "extraction_type": "final", "non_overlapping_spans": 5, "original_span": "efhsrt", "span_end": 7017, "span_start": 7011, ...
[ { "details": "{'letters': 'ehpxgoi', 'length': 2}", "errors": [ "cannot_be_formed_from_letters" ], "evaluation_method": null, "extraction_result": null, "final_answer": "ee", "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, false ], [ false, false ], [ false, false, false, false, false,...
[ [ "ehoixpg", "ehoxigp", "exist", "epohgi", "ee", "ee" ], [ "hepgxi", "egi", "ephoxxi", "efhsrt", "efhsrt" ], [ "ephpxghi", "epho", "ehpoxgi", "ehpoxgi" ], [ "expi", "expi", "expi" ], [ "ehpgio", "None of the above" ], ...
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "ehoixpg", "pattern_used": "answer tag", "position": 713, "span_end": 722, "span_start": 713, "span_text": "ehoixpg" }, { "confidence": 1, "extraction_type": "internal", ...
[ [ { "details": "{'letters': 'ehpxgoi', 'length': 7}", "errors": [ "not_a_valid_word" ], "final_answer": "ehoixpg", "is_correct": false, "target_matches": false }, { "details": "{'letters': 'ehpxgoi', 'length': 7}", "errors": [ "not_a_valid_...
{ "flips_by": [ 0, 0, 0, 0, 0, 0, 1, 0 ], "flips_total": 1, "num_correct": 0, "pass_at_n": 0, "percent_correct": 0, "skill_count": { "answer_revision": [ 0, 0, 0, 0, 0, 0, 0, 0 ], "best_of_n": [ 0, 0, ...
ipphuox
hippo
[ "hippo" ]
5
7
[ { "content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.", "role": "system" }, { "content": "Answer the following problem. E...
letter_countdown
[ "<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using the given letters 'i', 'p', 'p', 'h', 'u', 'o', 'x'. Let's try combining these letters step by step:\n\n1. Start with the longest possible combination.\n2. Check if it forms a valid word.\n3. If not, try shorter com...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:56413", "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, true, true, false, false, false ]
[ "hip", "piphuiox", "hippus", "hippo", "hi", "ipp", "FIRSTA", "hippopotomonstrophaeus" ]
[ { "extraction_type": "final", "non_overlapping_spans": 3, "original_span": "hip", "span_end": 2749, "span_start": 2744, "total_spans_found": 3 }, { "extraction_type": "final", "non_overlapping_spans": 5, "original_span": "piphuiox", "span_end": 7353, "span_start": 734...
[ { "details": "{'letters': 'ipphuox', 'length': 3}", "errors": [], "evaluation_method": null, "extraction_result": null, "final_answer": "hip", "is_correct": true, "reason": null, "target_matches": false }, { "details": "{'letters': 'ipphuox', 'length': 8}", "errors": [ ...
[ [ true, true, true ], [ true, false, false, false, false ], [ false, false ], [ true, true ], [ false, false, true, true ], [ false, false, false, false, false ], [ false, false, false, false ...
[ [ "hop", "hip", "hip" ], [ "phi", "No such word exists", "ixhuop", "piphuiox", "piphuiox" ], [ "hippus", "hippus" ], [ "hippo", "hippo" ], [ "ippuox", "phuox", "hi", "hi" ], [ "iox", "hiphop", "uhxoup", "ipp", "i...
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "hop", "pattern_used": "answer tag", "position": 1018, "span_end": 1023, "span_start": 1018, "span_text": "hop" }, { "confidence": 1, "extraction_type": "internal", "ori...
[ [ { "details": "{'letters': 'ipphuox', 'length': 3}", "errors": [], "final_answer": "hop", "is_correct": true, "target_matches": false }, { "details": "{'letters': 'ipphuox', 'length': 3}", "errors": [], "final_answer": "hip", "is_correct": true, ...
{ "flips_by": [ 0, 1, 0, 0, 0, 0, 0, 0 ], "flips_total": 1, "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, ...
xzaemne
axemen
[ "axemen", "examen" ]
6
7
[ { "content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.", "role": "system" }, { "content": "Answer the following problem. E...
letter_countdown
[ "<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using the given letters 'x', 'z', 'a', 'e', 'm', 'n', and 'e'. Let's try different combinations:\n\n1. **Combination**: xzeneme\n - This combination uses all the letters exactly once.\n - The word \"zeneme\" does not ...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:56413", "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, true, false, false, false, true, false ]
[ "examen", "maze", "ae", "examine", "ezxm", "ezenam", "xeme", "xzane" ]
[ { "extraction_type": "final", "non_overlapping_spans": 5, "original_span": "examen", "span_end": 8328, "span_start": 8322, "total_spans_found": 5 }, { "extraction_type": "final", "non_overlapping_spans": 2, "original_span": "maze", "span_end": 2076, "span_start": 2070...
[ { "details": "{'letters': 'xzaemne', 'length': 6}", "errors": [], "evaluation_method": null, "extraction_result": null, "final_answer": "examen", "is_correct": true, "reason": null, "target_matches": false }, { "details": "{'letters': 'xzaemne', 'length': 4}", "errors": [...
[ [ false, false, false, true, true ], [ false, true ], [ true, true ], [ false, false, false, false, false ], [ true, true, false, false ], [ false, false, false, false, false ], [ true, true, ...
[ [ "menace", "xemenae", "No such word exists.", "examen", "examen" ], [ "No valid word can be formed.", "maze" ], [ "ae", "ae" ], [ "zeaman", "emancipate", "examine", "examine", "examine" ], [ "exam", "ae", "ezxm", "ezxm" ], ...
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "menace", "pattern_used": "answer tag", "position": 1106, "span_end": 1114, "span_start": 1106, "span_text": "menace" }, { "confidence": 1, "extraction_type": "internal", ...
[ [ { "details": "{'letters': 'xzaemne', 'length': 6}", "errors": [ "cannot_be_formed_from_letters" ], "final_answer": "menace", "is_correct": false, "target_matches": false }, { "details": "{'letters': 'xzaemne', 'length': 7}", "errors": [ "...
{ "flips_by": [ 0, 0, 0, 0, 1, 0, 0, 0 ], "flips_total": 1, "num_correct": 4, "pass_at_n": 1, "percent_correct": 0.5, "skill_count": { "answer_revision": [ 0, 0, 0, 0, 0, 0, 0, 0 ], "best_of_n": [ 0, 0,...
oamasvs
amass
[ "amass", "assam", "massa", "omasa", "samas", "samoa", "somas", "vamos" ]
5
7
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...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:56413","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 ]
["amavs","osamvs","None of the above options were correct.","hope","omasv","omassvs","omass","massiv(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":4,"original_span":"amavs","span_end":4126,"span_(...TRUNCATED)
[{"details":"{'letters': 'oamasvs', 'length': 5}","errors":["not_a_valid_word"],"evaluation_method":(...TRUNCATED)
[[false,true,false,false],[false,false,false],[false,false],[false,false,false],[false,false,false,f(...TRUNCATED)
[["om'a","oms","amavs","amavs"],["omasvs","osamvs","osamvs"],["vacuum","None of the above options we(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"om'a","pattern_used":"answer tag",(...TRUNCATED)
[[{"details":"{'letters': 'oamasvs', 'length': 3}","errors":["not_a_valid_word"],"final_answer":"oma(...TRUNCATED)
{"flips_by":[1,0,0,0,0,0,0,0],"flips_total":1,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED)
faqloug
afoul
[ "afoul", "fugal" ]
5
7
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\n<sample>\nTo solve this problem, we need to form the longest possible word using the give(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:56413","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 ]
["flauguard","flow","fguaol","football","None of the above options are correct.","flauguoq","ftstar"(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":3,"original_span":"flauguard","span_end":2706,"s(...TRUNCATED)
[{"details":"{'letters': 'faqloug', 'length': 9}","errors":["not_a_valid_word","cannot_be_formed_fro(...TRUNCATED)
[[false,false,false],[false,false,false],[false,false,false,false],[false,false,false],[false,false](...TRUNCATED)
[["floodable","flauguard","flauguard"],["No valid word found","flow","flow"],["laufaqg","faqo","fgua(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"floodable","pattern_used":"answer (...TRUNCATED)
[[{"details":"{'letters': 'faqloug', 'length': 9}","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)
pogagll
gallop
[ "gallop", "glagol" ]
6
7
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\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:56413","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{ "backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl", "n_responses": 8 }
[ true, true, true, false, false, false, false, false ]
[ "go", "go", "poll", "play", "playgolf", "polling", "polla", "poggal" ]
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"go","span_end":1137,"span_sta(...TRUNCATED)
[{"details":"{'letters': 'pogagll', 'length': 2}","errors":[],"evaluation_method":null,"extraction_r(...TRUNCATED)
[[true,true],[false,true,true],[false,false,true,true],[false,false],[false,false,false,false],[true(...TRUNCATED)
[["go","go"],["No valid word can be formed.","go","go"],["poggal","pollg","poll","poll"],["play","pl(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"go","pattern_used":"answer tag","p(...TRUNCATED)
[[{"details":"{'letters': 'pogagll', 'length': 2}","errors":[],"final_answer":"go","is_correct":true(...TRUNCATED)
{"flips_by":[0,0,0,0,0,1,0,0],"flips_total":1,"num_correct":3,"pass_at_n":1,"percent_correct":0.375,(...TRUNCATED)
vuislua
uvulas
[ "uvulas", "visual" ]
6
7
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\n<sample>\nTo solve this problem, we need to form the longest possible word using the give(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:56413","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 ]
["villas","There is no valid English word that can be formed using the given letters.","visal","vsil(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":5,"original_span":"villas","span_end":6930,"span(...TRUNCATED)
[{"details":"{'letters': 'vuislua', 'length': 6}","errors":["cannot_be_formed_from_letters"],"evalua(...TRUNCATED)
[[false,false,false,false,false],[true,false,false,false,false],[false,true,false],[false,false,fals(...TRUNCATED)
[["villas","villa","vulisalua","villas","villas"],["visual","No valid word found.","suaves","vusla",(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"villas","pattern_used":"answer tag(...TRUNCATED)
[[{"details":"{'letters': 'vuislua', 'length': 6}","errors":["cannot_be_formed_from_letters"],"final(...TRUNCATED)
{"flips_by":[0,1,1,0,0,0,1,1],"flips_total":4,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED)
ohkauqe
kohua
[ "kohua", "quake", "queak" ]
5
7
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\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:56413","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, true ]
[ "ohaquke", "ook", "oquake", "ou", "queue", "abcde", "ookahwe", "qu" ]
[{"extraction_type":"final","non_overlapping_spans":3,"original_span":"ohaquke","span_end":2437,"spa(...TRUNCATED)
[{"details":"{'letters': 'ohkauqe', 'length': 7}","errors":["not_a_valid_word"],"evaluation_method":(...TRUNCATED)
[[false,false,false],[false,false,false,false,false,false],[false,false],[false,false,false,false],[(...TRUNCATED)
[["okhaqual","ohaquke","ohaquke"],["okhqwe","No specific word found meeting criteria","quack","oquac(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"okhaqual","pattern_used":"answer t(...TRUNCATED)
[[{"details":"{'letters': 'ohkauqe', 'length': 8}","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":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED)
kihaggv
giga
[ "giga", "hagi", "haik", "kavi", "kiva", "kvah", "vagi", "viga" ]
4
7
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\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:56413","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 ]
[ "gahvi", "gahi", "hat", null, "khaggv", "No valid word can be formed.", "akighvg", "give" ]
[{"extraction_type":"final","non_overlapping_spans":5,"original_span":"gahvi","span_end":5929,"span_(...TRUNCATED)
[{"details":"{'letters': 'kihaggv', 'length': 5}","errors":["not_a_valid_word"],"evaluation_method":(...TRUNCATED)
[[false,false,false,false,false],[false,false,false,false],[false,false,false],[],[false],[false,tru(...TRUNCATED)
[["khivag","ktv","khiavg","gahvi","gahvi"],["kkiihaggv","ghakiv","gahi","gahi"],["gihaagvk","hat","h(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"khivag","pattern_used":"answer tag(...TRUNCATED)
[[{"details":"{'letters': 'kihaggv', 'length': 6}","errors":["not_a_valid_word"],"final_answer":"khi(...TRUNCATED)
{"flips_by":[0,0,0,0,0,1,0,0],"flips_total":1,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...TRUNCATED)
taytzfo
azofy
[ "azofy", "fatty" ]
5
7
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\n<sample>\nTo 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:56413","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 ]
[ null, "typhoon", "ftsy", "None of the above options match the criteria.", "a", "toy", "tyotayo", "tazytf" ]
[{"extraction_type":"final","non_overlapping_spans":null,"original_span":null,"span_end":null,"span_(...TRUNCATED)
[{"details":null,"errors":null,"evaluation_method":"response_processor","extraction_result":"{'extra(...TRUNCATED)
[[],[false,false],[false,false,false],[false,false],[false,false,false,false],[false,false,true,true(...TRUNCATED)
[[],["typhoon","typhoon"],["taxify","ftsy","ftsy"],["tyz","None of the above options match the crite(...TRUNCATED)
[[],[{"confidence":1.0,"extraction_type":"internal","original_span":"typhoon","pattern_used":"answer(...TRUNCATED)
[[],[{"details":"{'letters': 'taytzfo', 'length': 7}","errors":["cannot_be_formed_from_letters"],"fi(...TRUNCATED)
{"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
4