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 find the longest possible word that can be formed using only the given letters. Let's break down the process:\n\n1. **Identify available letters**: The input consists of the letters `['e', 'h', 'p', 'x', 'g', 'o', 'i']`.\n \n2. **Consider all permutations**: W...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:40943", "backend": "litellm", "chat_template_applied": true, "generation_params": { "chat_template_applied": true, "max_tokens": 4096, "n": 3, "repetition_penalty": 1.1, "temperature": 0.7, "top_k": 20, "top_p": 0.8 }, "model_name": "hosted_vllm/TAU...
{ "backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_lr1e-6_rollout16-rl", "n_responses": 8 }
[ false, false, true, false, false, false, true, false ]
[ null, "ephig", "ghi", "ghip", "ehphi", "hello", "hope", "heeoixg" ]
[ { "extraction_type": "final", "non_overlapping_spans": null, "original_span": null, "span_end": null, "span_start": null, "total_spans_found": null }, { "extraction_type": "final", "non_overlapping_spans": 1, "original_span": "ephig", "span_end": 6067, "span_start": 6...
[ { "details": null, "errors": null, "evaluation_method": "response_processor", "extraction_result": "{'extraction_type': 'final'}", "final_answer": null, "is_correct": null, "reason": "no_extracted_answer", "target_matches": null }, { "details": "{'letters': 'ehpxgoi', 'length...
[ [], [ false ], [ true, true ], [ true, false ], [ false, false ], [ false, false ], [ true, true ], [ false ] ]
[ [], [ "ephig" ], [ "ghi", "ghi" ], [ "ghi", "ghip" ], [ "ehphi", "ehphi" ], [ "hello", "hello" ], [ "hope", "hope" ], [ "heeoixg" ] ]
[ [], [ { "confidence": 1, "extraction_type": "internal", "original_span": "ephig", "pattern_used": "answer tag", "position": 6062, "span_end": 6067, "span_start": 6062, "span_text": "ephig" } ], [ { "confidence": 1, "extraction_type": "int...
[ [], [ { "details": "{'letters': 'ehpxgoi', 'length': 5}", "errors": [ "not_a_valid_word" ], "final_answer": "ephig", "is_correct": false, "target_matches": false } ], [ { "details": "{'letters': 'ehpxgoi', 'length': 3}", "errors": [], "...
{ "flips_by": [ 0, 0, 0, 1, 0, 0, 0, 0 ], "flips_total": 1, "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...
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 only the given letters. Let's break down the process:\n\n1. **Identify Available Letters**: The available letters are: `['i', 'p', 'p', 'h', 'u', 'o', 'x']`.\n \n2. **Consider Possible Words**: We will try differe...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:40943", "backend": "litellm", "chat_template_applied": true, "generation_params": { "chat_template_applied": true, "max_tokens": 4096, "n": 3, "repetition_penalty": 1.1, "temperature": 0.7, "top_k": 20, "top_p": 0.8 }, "model_name": "hosted_vllm/TAU...
{ "backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_lr1e-6_rollout16-rl", "n_responses": 8 }
[ false, true, false, false, false, false, true, false ]
[ "hipphonix", "hop", "phoenix", "house", "hope", "phoenix", "hip", null ]
[ { "extraction_type": "final", "non_overlapping_spans": 2, "original_span": "hipphonix", "span_end": 1933, "span_start": 1922, "total_spans_found": 2 }, { "extraction_type": "final", "non_overlapping_spans": 2, "original_span": "hop", "span_end": 1795, "span_start": 17...
[ { "details": "{'letters': 'ipphuox', 'length': 9}", "errors": [ "not_a_valid_word", "cannot_be_formed_from_letters" ], "evaluation_method": null, "extraction_result": null, "final_answer": "hipphonix", "is_correct": false, "reason": null, "target_matches": false }, ...
[ [ false, false ], [ true, true ], [ false, false ], [ false, false ], [ false, false ], [ false, false ], [ true, true ], [] ]
[ [ "hipphonix", "hipphonix" ], [ "hop", "hop" ], [ "phoenix", "phoenix" ], [ "house", "house" ], [ "hope", "hope" ], [ "phoenix", "phoenix" ], [ "hip", "hip" ], [] ]
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "hipphonix", "pattern_used": "answer tag", "position": 1638, "span_end": 1649, "span_start": 1638, "span_text": "hipphonix" }, { "confidence": 1, "extraction_type": "internal"...
[ [ { "details": "{'letters': 'ipphuox', 'length': 9}", "errors": [ "not_a_valid_word", "cannot_be_formed_from_letters" ], "final_answer": "hipphonix", "is_correct": false, "target_matches": false }, { "details": "{'letters': 'ipphuox', 'length': 9...
{ "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...
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'. We will try different combinations to see which one forms the longest valid word.\n\n1. **Combine all letters**: Start by combining all the letters together.\...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:40943", "backend": "litellm", "chat_template_applied": true, "generation_params": { "chat_template_applied": true, "max_tokens": 4096, "n": 3, "repetition_penalty": 1.1, "temperature": 0.7, "top_k": 20, "top_p": 0.8 }, "model_name": "hosted_vllm/TAU...
{ "backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_lr1e-6_rollout16-rl", "n_responses": 8 }
[ false, false, false, true, true, false, false, true ]
[ "zeam", "xn", "mention", "amen", "men", "team", "extendable", "exam" ]
[ { "extraction_type": "final", "non_overlapping_spans": 7, "original_span": "zeam", "span_end": 8778, "span_start": 8774, "total_spans_found": 7 }, { "extraction_type": "final", "non_overlapping_spans": 5, "original_span": "xn", "span_end": 4705, "span_start": 4703, ...
[ { "details": "{'letters': 'xzaemne', 'length': 4}", "errors": [ "not_a_valid_word" ], "evaluation_method": null, "extraction_result": null, "final_answer": "zeam", "is_correct": false, "reason": null, "target_matches": false }, { "details": "{'letters': 'xzaemne', '...
[ [ false, false, false, false, false, false, false ], [ true, false, false, false, false ], [ false, false ], [ true, true ], [ true, true ], [ false, false ], [ false, false ], [ false, false,...
[ [ "No valid word found.", "No valid word was found.", "zealous", "Manchester", "mention", "zeam", "zeam" ], [ "eme", "eee", "xzmanen", "xn", "xn" ], [ "mention", "mention" ], [ "amen", "amen" ], [ "men", "men" ], [ "team...
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "No valid word found.", "pattern_used": "answer tag", "position": 2117, "span_end": 2137, "span_start": 2117, "span_text": "No valid word found." }, { "confidence": 1, "extrac...
[ [ { "details": "{'letters': 'xzaemne', 'length': 16}", "errors": [ "not_a_valid_word", "cannot_be_formed_from_letters" ], "final_answer": "Novalidwordfound", "is_correct": false, "target_matches": false }, { "details": "{'letters': 'xzaemne', 'le...
{ "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, ...
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:40943","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED)
[ false, false, false, false, true, false, false, false ]
[ "omass", "avamos", "overmassive", "massive", "mass", "asma", "mosas", null ]
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"omass","span_end":1464,"span_(...TRUNCATED)
[{"details":"{'letters': 'oamasvs', 'length': 5}","errors":["not_a_valid_word"],"evaluation_method":(...TRUNCATED)
[[false,false],[false,false,false,false,false],[false,false],[false,false],[true,true],[false,false](...TRUNCATED)
[["omass","omass"],["osama","osama","o","avamos","avamos"],["overmassive","overmassive"],["massive",(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"omass","pattern_used":"answer tag"(...TRUNCATED)
[[{"details":"{'letters': 'oamasvs', 'length': 5}","errors":["not_a_valid_word"],"final_answer":"oma(...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)
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 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:40943","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED)
[ false, true, false, false, false, false, false, false ]
[ null, "fog", "flow", "glorious", "flaug", "flaugured", "flourage", "flake" ]
[{"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,true,true],[false,false],[false,false,false],[false,false],[false],[false,false],[false,f(...TRUNCATED)
[[],["floog","fog","fog"],["flow","flow"],["None found","glorious","glorious"],["flaug","flaug"],["f(...TRUNCATED)
[[],[{"confidence":1.0,"extraction_type":"internal","original_span":"floog","pattern_used":"answer t(...TRUNCATED)
[[],[{"details":"{'letters': 'faqloug', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed(...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)
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 possible word that can be fo(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{"api_url":"http://127.0.0.1:40943","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED)
[ false, false, true, true, false, false, true, false ]
[ "pological", null, "gal", "poll", "pagalgl", "plumber", "poll", "polling" ]
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"pological","span_end":1722,"s(...TRUNCATED)
[{"details":"{'letters': 'pogagll', 'length': 9}","errors":["not_a_valid_word","cannot_be_formed_fro(...TRUNCATED)
[ [ false, false ], [], [ true, true ], [ true, true ], [ false, false ], [ false, false ], [ true, true ], [ false, false ] ]
[["pological","pological"],[],["gal","gal"],["poll","poll"],["pagalgl","pagalgl"],["play","plumber"](...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"pological","pattern_used":"answer (...TRUNCATED)
[[{"details":"{'letters': 'pogagll', 'length': 9}","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":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 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:40943","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED)
[ false, false, false, true, false, true, false, false ]
[ "sli", null, "villa", "visual", "ulsa", "visual", "visul", "viola" ]
[{"extraction_type":"final","non_overlapping_spans":1,"original_span":"sli","span_end":1189,"span_st(...TRUNCATED)
[{"details":"{'letters': 'vuislua', 'length': 3}","errors":["not_a_valid_word"],"evaluation_method":(...TRUNCATED)
[[false],[],[false,false],[false,true,true],[false,false,false,false],[true,true],[false,false],[fal(...TRUNCATED)
[["sli"],[],["villa","villa"],["No valid word found.","visual","visual"],["No valid word found.","su(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"sli","pattern_used":"answer tag","(...TRUNCATED)
[[{"details":"{'letters': 'vuislua', 'length': 3}","errors":["not_a_valid_word"],"final_answer":"sli(...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)
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:40943","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "haqueuo", null, "oakeh", "okh", "oukea", "ookuae", "cook", "auque" ]
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"haqueuo","span_end":1193,"spa(...TRUNCATED)
[{"details":"{'letters': 'ohkauqe', 'length': 7}","errors":["not_a_valid_word","cannot_be_formed_fro(...TRUNCATED)
[[false,false],[],[false,false],[false,false,false,false],[false,false],[false,false],[false,false],(...TRUNCATED)
[["haqueuo","haqueuo"],[],["oakeh","oakeh"],["ough","okh","okh","okh"],["oukea","oukea"],["ookuae","(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"haqueuo","pattern_used":"answer ta(...TRUNCATED)
[[{"details":"{'letters': 'ohkauqe', 'length': 7}","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)
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:40943","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED)
[ false, false, false, false, false, false, false, false ]
[ "gift", null, "game", "gighav", "ghida", "khiva", "kigha", "ghag" ]
[{"extraction_type":"final","non_overlapping_spans":5,"original_span":"gift","span_end":3318,"span_s(...TRUNCATED)
[{"details":"{'letters': 'kihaggv', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evalua(...TRUNCATED)
[[true,true,false,false,false],[],[false,false],[true,false],[false,false],[false,false,false,false,(...TRUNCATED)
[["ghi","ghi","gift","gift","gift"],[],["game","game"],["hi","gighav"],["ghida","ghida"],["None","ki(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"ghi","pattern_used":"answer tag","(...TRUNCATED)
[[{"details":"{'letters': 'kihaggv', 'length': 3}","errors":[],"final_answer":"ghi","is_correct":tru(...TRUNCATED)
{"flips_by":[1,0,0,1,0,0,0,0],"flips_total":2,"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:40943","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{"backend":"litellm","model_name":"hosted_vllm/TAUR-dev/M-0903_rl_reflect__1b_3args__grpo_minibs32_l(...TRUNCATED)
[ false, true, false, false, false, true, false, true ]
[ "taoz", "toy", "aty", "toyfat", "toafy", "toy", "tafit", "fo" ]
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"taoz","span_end":1733,"span_s(...TRUNCATED)
[{"details":"{'letters': 'taytzfo', 'length': 4}","errors":["not_a_valid_word"],"evaluation_method":(...TRUNCATED)
[[false,false],[true,true,true,true],[false,false],[false,false],[false,false],[true,true,true],[fal(...TRUNCATED)
[["taoz","taoz"],["toy","toy","toy","toy"],["aty","aty"],["No valid word found","toyfat"],["toafy","(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"taoz","pattern_used":"answer tag",(...TRUNCATED)
[[{"details":"{'letters': 'taytzfo', 'length': 4}","errors":["not_a_valid_word"],"final_answer":"tao(...TRUNCATED)
{"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":3,"pass_at_n":1,"percent_correct":0.375,(...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
6