Dataset Viewer
Auto-converted to Parquet Duplicate
letters
stringlengths
5
5
answer
stringlengths
3
5
all_best
listlengths
1
9
length
int64
3
5
letters_length
int64
5
5
prompt
listlengths
2
2
task_source
stringclasses
1 value
model_responses__example_annotation
listlengths
8
8
model_responses__example_annotation__finish_reason_length_flags
listlengths
8
8
model_responses__example_annotation__length_partial_responses
listlengths
8
8
prompt__example_annotation__metadata
dict
model_responses__example_annotation__metadata
dict
model_responses__example_annotation__eval_is_correct
listlengths
8
8
model_responses__example_annotation__eval_extracted_answers
listlengths
8
8
model_responses__example_annotation__eval_extraction_metadata
listlengths
8
8
model_responses__example_annotation__eval_evaluation_metadata
listlengths
8
8
model_responses__example_annotation__internal_answers__eval_is_correct
listlengths
8
8
model_responses__example_annotation__internal_answers__eval_extracted_answers
listlengths
8
8
model_responses__example_annotation__internal_answers__eval_extraction_metadata
listlengths
8
8
model_responses__example_annotation__internal_answers__eval_evaluation_metadata
listlengths
8
8
model_responses__example_annotation__metrics
dict
ymiai
aim
[ "aim", "ami", "amy", "ima", "imi", "may", "mia", "mya", "yam" ]
3
5
[ { "content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.", "role": "system" }, { "content": "Answer the following problem. E...
letter_countdown
[ "<think>\n<sample>\nTo solve this problem, we need to form the longest possible word using the given letters ['y', 'm', 'i', 'a', 'i']. Let's try different combinations:\n\n1. **Try forming \"amiya\"**: This uses all the letters exactly once.\n - amiya\n\n2. **Check if there's any other combination**:\n - Other...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:47121", "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, true, true, false, false, true ]
[ "amiya", "ami", "yama", "My", "aim", "yamina", "None of the above", "ima" ]
[ { "extraction_type": "final", "non_overlapping_spans": 2, "original_span": "amiya", "span_end": 822, "span_start": 815, "total_spans_found": 2 }, { "extraction_type": "final", "non_overlapping_spans": 2, "original_span": "ami", "span_end": 898, "span_start": 893, ...
[ { "details": "{'letters': 'ymiai', 'length': 5}", "errors": [ "not_a_valid_word", "cannot_be_formed_from_letters" ], "evaluation_method": null, "extraction_result": null, "final_answer": "amiya", "is_correct": false, "reason": null, "target_matches": false }, { ...
[ [ false, false ], [ true, true ], [ false, false, false, false ], [ false, true, true ], [ true, true ], [ false, false, false ], [ false, false ], [ false, false, false, true, true ] ]
[ [ "amiya", "amiya" ], [ "ami", "ami" ], [ "No valid word found", "yamii", "yama", "yama" ], [ "myaim", "My", "My" ], [ "aim", "aim" ], [ "yamaiia", "yamina", "yamina" ], [ "yami", "None of the above" ], [ "imposs...
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "amiya", "pattern_used": "answer tag", "position": 590, "span_end": 597, "span_start": 590, "span_text": "amiya" }, { "confidence": 1, "extraction_type": "internal", "or...
[ [ { "details": "{'letters': 'ymiai', 'length': 5}", "errors": [ "not_a_valid_word", "cannot_be_formed_from_letters" ], "final_answer": "amiya", "is_correct": false, "target_matches": false }, { "details": "{'letters': 'ymiai', 'length': 5}", ...
{ "flips_by": [ 0, 0, 0, 0, 0, 0, 0, 0 ], "flips_total": 0, "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,...
ruziz
uri
[ "uri" ]
3
5
[ { "content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.", "role": "system" }, { "content": "Answer the following problem. E...
letter_countdown
[ "<think>\n<sample>\nTo solve this problem, we need to form the longest possible word using the given letters ['r', 'u', 'z', 'i', 'z']. Let's try different combinations:\n\n1. **rzizu**: This combination doesn't make sense as it lacks vowels.\n2. **rizzi**: This also doesn't work because \"ri\" isn't a real word.\n...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:47121", "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 ]
[ "ruzz", "utilization", "rule", "registry", "users", "rizz", "izi", "river" ]
[ { "extraction_type": "final", "non_overlapping_spans": 3, "original_span": "ruzz", "span_end": 2499, "span_start": 2493, "total_spans_found": 3 }, { "extraction_type": "final", "non_overlapping_spans": 2, "original_span": "utilization", "span_end": 1134, "span_start":...
[ { "details": "{'letters': 'ruziz', 'length': 4}", "errors": [ "not_a_valid_word" ], "evaluation_method": null, "extraction_result": null, "final_answer": "ruzz", "is_correct": false, "reason": null, "target_matches": false }, { "details": "{'letters': 'ruziz', 'leng...
[ [ false, false, false ], [ false, false ], [ false, false, false ], [ false, false, false ], [ false, false ], [ false ], [ false, false, false, false ], [ false, false ] ]
[ [ "zucchini", "ruzz", "ruzz" ], [ "utilization", "utilization" ], [ "ruziuzi", "rule", "rule" ], [ "registry", "registry", "registry" ], [ "users", "users" ], [ "rizz" ], [ "rziu", "No valid word found", "izi", "izi" ]...
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "zucchini", "pattern_used": "answer tag", "position": 823, "span_end": 833, "span_start": 823, "span_text": "zucchini" }, { "confidence": 1, "extraction_type": "internal", ...
[ [ { "details": "{'letters': 'ruziz', 'length': 8}", "errors": [ "cannot_be_formed_from_letters" ], "final_answer": "zucchini", "is_correct": false, "target_matches": false }, { "details": "{'letters': 'ruziz', 'length': 4}", "errors": [ "no...
{ "flips_by": [ 0, 0, 0, 0, 0, 0, 0, 0 ], "flips_total": 0, "num_correct": 0, "pass_at_n": 0, "percent_correct": 0, "skill_count": { "answer_revision": [ 0, 0, 0, 0, 0, 0, 0, 0 ], "best_of_n": [ 0, 0, ...
cjloe
cole
[ "cole", "ecol", "joel", "jole" ]
4
5
[ { "content": "You like to solve problems by thinking step by step. Write out your reasoning then give your answer in \"<answer>\n(your answer)\n</answer>\". You always end with </answer>, you never ever end without giving an answer.", "role": "system" }, { "content": "Answer the following problem. E...
letter_countdown
[ "<think>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using the given letters 'c', 'j', 'l', 'o', and 'e'. Let's try combining these letters step by step:\n\n1. Start with 'c'.\n2. Add 'j': cj\n3. Add 'l': cjl\n4. Add 'o': cjo\n5. Add 'e': cje\n\nThe word \"cje\" uses all th...
[ false, false, false, false, false, false, false, false ]
[ "", "", "", "", "", "", "", "" ]
{ "api_url": "http://127.0.0.1:47121", "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, true, false, false ]
[ "cloe", "cat", "cool", "coolest", "cleoley", "cole", "college", "occult" ]
[ { "extraction_type": "final", "non_overlapping_spans": 3, "original_span": "cloe", "span_end": 2836, "span_start": 2832, "total_spans_found": 3 }, { "extraction_type": "final", "non_overlapping_spans": 3, "original_span": "cat", "span_end": 3005, "span_start": 3000, ...
[ { "details": "{'letters': 'cjloe', 'length': 4}", "errors": [ "not_a_valid_word" ], "evaluation_method": null, "extraction_result": null, "final_answer": "cloe", "is_correct": false, "reason": null, "target_matches": false }, { "details": "{'letters': 'cjloe', 'leng...
[ [ false, false, false ], [ false, false, false ], [ false, false, false ], [ false, false, false, false ], [ false, false ], [ false, false, true, true ], [ false, false, false ], [ false ] ]
[ [ "cje", "cleo", "cloe" ], [ "cje", "cat", "cat" ], [ "No valid word exists", "cool", "cool" ], [ "code", "clje", "coolest", "coolest" ], [ "cleoley", "cleoley" ], [ "joee", "cceede", "cole", "cole" ], [ "cooler"...
[ [ { "confidence": 1, "extraction_type": "internal", "original_span": "cje", "pattern_used": "answer tag", "position": 430, "span_end": 433, "span_start": 430, "span_text": "cje" }, { "confidence": 1, "extraction_type": "internal", "origin...
[ [ { "details": "{'letters': 'cjloe', 'length': 3}", "errors": [ "not_a_valid_word" ], "final_answer": "cje", "is_correct": false, "target_matches": false }, { "details": "{'letters': 'cjloe', 'length': 4}", "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, ...
bvoeu
bove
[ "bove" ]
4
5
[{"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:47121","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{ "backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl", "n_responses": 8 }
[ false, true, false, false, false, false, false, true ]
[ "boo", "bo", "BOVUE", "bvue", "over", "bvez", "rat", "bove" ]
[{"extraction_type":"final","non_overlapping_spans":3,"original_span":"boo","span_end":2745,"span_st(...TRUNCATED)
[{"details":"{'letters': 'bvoeu', 'length': 3}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED)
[[false,false,false],[false,true],[false,false,false,false,false],[false,false,false],[false,false,f(...TRUNCATED)
[["bovu","boo","boo"],["bow","bo"],["bevou","None","There is no valid word","BOVUE","BOVUE"],["boveu(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"bovu","pattern_used":"answer tag",(...TRUNCATED)
[[{"details":"{'letters': 'bvoeu', 'length': 4}","errors":["not_a_valid_word"],"final_answer":"bovu"(...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)
ukozc
coz
[ "coz", "kou", "ock" ]
3
5
[{"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:47121","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 ]
[ "ukocz", "cookbook", "ukocop", "None of the Above", "ukuco", "uc", "ukōzc", "ukcz" ]
[{"extraction_type":"final","non_overlapping_spans":3,"original_span":"ukocz","span_end":2851,"span_(...TRUNCATED)
[{"details":"{'letters': 'ukozc', 'length': 5}","errors":["not_a_valid_word"],"evaluation_method":nu(...TRUNCATED)
[[false,false,false],[false,false,false,false],[false,false,false],[false,false],[false,false,false,(...TRUNCATED)
[["ucokz","ukocz","ukocz"],["okoz","ukocz","cookbook","cookbook"],["cook","ukocop","ukocop"],["ukzoc(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"ucokz","pattern_used":"answer tag"(...TRUNCATED)
[[{"details":"{'letters': 'ukozc', 'length': 5}","errors":["not_a_valid_word"],"final_answer":"ucokz(...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)
uwsox
sou
[ "sou", "sow", "sox", "usw", "wos", "wus" ]
3
5
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\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:47121","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 ]
["word","usxo","xousw","feretrita","usxo","It is impossible to form a valid word using all the given(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":5,"original_span":"word","span_end":6398,"span_s(...TRUNCATED)
[{"details":"{'letters': 'uwsox', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED)
[[false,false,false,false,false],[false,false],[false,false,false,false,false],[false,false,false,fa(...TRUNCATED)
[["house","cow","uxso","word","word"],["usxo","usxo"],["words","wsoxox","swallow","xousw","xousw"],[(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"house","pattern_used":"answer tag"(...TRUNCATED)
[[{"details":"{'letters': 'uwsox', 'length': 5}","errors":["cannot_be_formed_from_letters"],"final_a(...TRUNCATED)
{"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED)
odrli
droil
[ "droil" ]
5
5
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\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:47121","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{ "backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl", "n_responses": 8 }
[ false, false, true, false, false, false, false, false ]
[ "dry", "doril", "oil", "odlr", "dolli", "door", "ordinarily", "loader" ]
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"dry","span_end":1053,"span_st(...TRUNCATED)
[{"details":"{'letters': 'odrli', 'length': 3}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED)
[[false,false],[true,false,false,false],[false,false,true,true],[false,false,false],[false],[false,f(...TRUNCATED)
[["dry","dry"],["lord","ili","doril","doril"],["ordril","ordinli","oil","oil"],["rolid","odlr","odlr(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"dry","pattern_used":"answer tag","(...TRUNCATED)
[[{"details":"{'letters': 'odrli', 'length': 3}","errors":["cannot_be_formed_from_letters"],"final_a(...TRUNCATED)
{"flips_by":[0,1,0,0,0,0,0,0],"flips_total":1,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED)
ijhja
hajji
[ "hajji" ]
5
5
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\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:47121","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, true, false, false, false ]
[ "aikjh", "ijjah", "hair", "hiaja", "ai", "ihjah", "faster", "ajjai" ]
[{"extraction_type":"final","non_overlapping_spans":2,"original_span":"aikjh","span_end":2404,"span_(...TRUNCATED)
[{"details":"{'letters': 'ijhja', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED)
[[false,false],[false,false,false],[false,false,false],[false,false],[false,true,true],[false,false,(...TRUNCATED)
[["ajihaa","aikjh"],["hjh","ijjah","ijjah"],["hair","None of the above","hair"],["hiaja","hiaja"],["(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"ajihaa","pattern_used":"answer tag(...TRUNCATED)
[[{"details":"{'letters': 'ijhja', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED)
{"flips_by":[0,0,0,0,0,1,0,0],"flips_total":1,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED)
azoid
azido
[ "azido", "diazo" ]
5
5
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\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:47121","backend":"litellm","chat_template_applied":true,"generation_par(...TRUNCATED)
{ "backend": "litellm", "model_name": "hosted_vllm/TAUR-dev/M-SFT_V2_RUN-rl", "n_responses": 8 }
[ false, false, false, true, false, false, false, false ]
["airplane","oid","None of the above","adz","aziod","None","None of the above words can be formed us(...TRUNCATED)
[{"extraction_type":"final","non_overlapping_spans":3,"original_span":"airplane","span_end":3145,"sp(...TRUNCATED)
[{"details":"{'letters': 'azoid', 'length': 8}","errors":["cannot_be_formed_from_letters"],"evaluati(...TRUNCATED)
[[false,false,false],[false,false,false],[false,false],[false,false,true,true],[false,false],[false,(...TRUNCATED)
[["aziod","airplane","airplane"],["aod","oid","oid"],["aoiz","None of the above"],["azoid","zoo","ad(...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"aziod","pattern_used":"answer tag"(...TRUNCATED)
[[{"details":"{'letters': 'azoid', 'length': 5}","errors":["not_a_valid_word"],"final_answer":"aziod(...TRUNCATED)
{"flips_by":[0,0,0,0,0,0,1,0],"flips_total":1,"num_correct":1,"pass_at_n":1,"percent_correct":0.125,(...TRUNCATED)
ufozi
fiz
[ "fiz", "fou", "iof", "iou", "ouf", "oui", "ufo" ]
3
5
[{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED)
letter_countdown
["<think>\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:47121","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 ]
[ "No valid word exists", "ii", "UFOZI", "focus", "zofui", "ufioz", "zuoif", "None" ]
[{"extraction_type":"final","non_overlapping_spans":3,"original_span":"No valid word exists","span_e(...TRUNCATED)
[{"details":"{'letters': 'ufozi', 'length': 17}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED)
[[false,false,false],[false,false,false],[false,false,false,false],[false],[false,false],[false,fals(...TRUNCATED)
[["No valid English word exists.","No valid word exists","No valid word exists"],["ufozi","ii","ii"](...TRUNCATED)
[[{"confidence":1.0,"extraction_type":"internal","original_span":"No valid English word exists.","pa(...TRUNCATED)
[[{"details":"{'letters': 'ufozi', 'length': 24}","errors":["not_a_valid_word","cannot_be_formed_fro(...TRUNCATED)
{"flips_by":[0,0,0,0,0,0,0,0],"flips_total":0,"num_correct":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
4