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>\n<sample>\nTo solve this problem, we need to form the longest possible word using the given letters ['m', 'r', 't', 'u', 'o', 'b']. Let's try different combinations:\n\n1. **Combination**: mruob\n - This combination uses all the letters exactly once.\n - The word formed is \"murbo\".\n\n2. **Alternativ... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:51151",
"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
] | [
"motur",
"mortu",
"mother",
"None of these",
"mmrtbuob",
"mrtubo",
"mount",
"mrob"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 3,
"original_span": "motur",
"span_end": 3088,
"span_start": 3081,
"total_spans_found": 3
},
{
"extraction_type": "final",
"non_overlapping_spans": 3,
"original_span": "mortu",
"span_end": 2577,
"span_start": 2570... | [
{
"details": "{'letters': 'mrtuob', 'length': 5}",
"errors": [
"not_a_valid_word"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "motur",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'mrtuob', 'l... | [
[
false,
false,
false
],
[
false,
false,
false
],
[
false,
false,
false,
false
],
[
false,
false
],
[
false,
false,
false
],
[
false,
false
],
[
false,
false,
false
],
[
false,
false,
false,
f... | [
[
"murbo mortub",
"mortu",
"motur"
],
[
"mount",
"mortu",
"mortu"
],
[
"motrub",
"moortub",
"book",
"mother"
],
[
"unbont",
"None of these"
],
[
"mother",
"mmrtbuob",
"mmrtbuob"
],
[
"mrtubo",
"mrtubo"
],
[
"mother",
... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "murbo mortub",
"pattern_used": "answer tag",
"position": 1094,
"span_end": 1108,
"span_start": 1094,
"span_text": "murbo mortub"
},
{
"confidence": 1,
"extraction_type": "int... | [
[
{
"details": "{'letters': 'mrtuob', 'length': 11}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "murbomortub",
"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>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using the given letters 'g', 'a', 'o', 'q', 'c', and 'e'. Let's try different combinations:\n\n1. **GOCAQE**: This combination forms the word \"quality\".\n2. **GAOCQE**: This also forms the word \"quality\".\n\nBoth word... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:51151",
"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,
true,
false,
false,
false,
true,
false
] | [
"quality",
"queue",
"geo",
"great",
"aaaaaa",
"government or cooperative",
"aq",
null
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "quality",
"span_end": 921,
"span_start": 912,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 3,
"original_span": "queue",
"span_end": 2080,
"span_start": 2073... | [
{
"details": "{'letters': 'gaoqce', 'length': 7}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "quality",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters... | [
[
false,
false
],
[
false,
false,
false
],
[
true,
true
],
[
false,
false,
false,
false,
false
],
[
false,
false,
false,
false,
false
],
[
false,
false,
false
],
[
false,
false,
true,
true
],
... | [
[
"quality",
"quality"
],
[
"gocaeo",
"queue",
"queue"
],
[
"geo",
"geo"
],
[
"GOCAQE",
"gaoce",
"gaoce",
"gastere",
"great"
],
[
"No valid word",
"glorious",
"gaocqequecg",
"aaaaaa",
"aaaaaa"
],
[
"GAACOE",
"government ... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "quality",
"pattern_used": "answer tag",
"position": 606,
"span_end": 615,
"span_start": 606,
"span_text": "quality"
},
{
"confidence": 1,
"extraction_type": "internal",
... | [
[
{
"details": "{'letters': 'gaoqce', 'length': 7}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "quality",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'gaoqce', 'length': 7}",
"errors": [
"c... | {
"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>\n<sample>\nTo solve this problem, we need to find the longest word that can be formed using the given letters ['y', 'l', 'f', 'u', 'f', 'i']. Let's try different combinations:\n\n1. **Try forming \"fly\"**: \n - We have 'f', 'y', and 'l'.\n - This gives us the word \"fly\".\n \n2. **Check other possi... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:51151",
"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
] | [
"fluffy",
"ylflu",
"yulfiu",
"yufli",
"yields",
"fly",
"full",
"yiluf"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 3,
"original_span": "fluffy",
"span_end": 3512,
"span_start": 3504,
"total_spans_found": 3
},
{
"extraction_type": "final",
"non_overlapping_spans": 3,
"original_span": "ylflu",
"span_end": 2600,
"span_start": 259... | [
{
"details": "{'letters': 'ylfufi', 'length': 6}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "fluffy",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters'... | [
[
true,
false,
false
],
[
false,
false,
false
],
[
false,
false,
false
],
[
false,
false,
false,
false
],
[
false,
false,
false,
false
],
[
true,
true
],
[
false,
false,
false,
false,
false,
f... | [
[
"fly",
"fluffy",
"fluffy"
],
[
"ylfiuf",
"ylflu",
"ylflu"
],
[
"yufi",
"yulfiu",
"yulfiu"
],
[
"fluffy",
"ylfu",
"yufli",
"yufli"
],
[
"No valid English word can be formed.",
"uu",
"There is no valid word that can be formed using the ... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "fly",
"pattern_used": "answer tag",
"position": 599,
"span_end": 604,
"span_start": 599,
"span_text": "fly"
},
{
"confidence": 1,
"extraction_type": "internal",
"origin... | [
[
{
"details": "{'letters': 'ylfufi', 'length': 3}",
"errors": [],
"final_answer": "fly",
"is_correct": true,
"target_matches": false
},
{
"details": "{'letters': 'ylfufi', 'length': 6}",
"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,
... |
athtuv | tuath | [
"tuath"
] | 5 | 6 | [{"content":"You like to solve problems by thinking step by step. Write out your reasoning then give(...TRUNCATED) | letter_countdown | ["<thought> First, I'll consider combining the letters to form the longest possible word. Let's try (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:51151","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
] | [
"autovat",
"hatu",
"thuv",
"thutuv",
"athutv",
"athuthuthuv",
"athuthuv",
"athuv"
] | [{"extraction_type":"final","non_overlapping_spans":1,"original_span":"autovat","span_end":536,"span(...TRUNCATED) | [{"details":"{'letters': 'athtuv', 'length': 7}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | [
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
],
[
false
]
] | [
[
"autovat"
],
[
"hatu"
],
[
"thuv"
],
[
"thutuv"
],
[
"athutv"
],
[
"athuthuthuv"
],
[
"athuthuv"
],
[
"athuv"
]
] | [[{"confidence":1.0,"extraction_type":"internal","original_span":"autovat","pattern_used":"answer ta(...TRUNCATED) | [[{"details":"{'letters': 'athtuv', 'length': 7}","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) |
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(...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:51151","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,
true
] | [
"aisle",
"swine",
"ae",
"akey",
"ee",
"aksei",
"abcdefghijklmnopqrstuvwxyz",
"ais"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"aisle","span_end":807,"span_s(...TRUNCATED) | [{"details":"{'letters': 'awskie', 'length': 5}","errors":["cannot_be_formed_from_letters"],"evaluat(...TRUNCATED) | [[false,false],[false,false],[true,true,true],[false,false,false],[false,false,false,false,false,fal(...TRUNCATED) | [["aisle","aisle"],["swine","swine"],["wake","ae","ae"],["awesike","akey","akey"],["awesike","aikswe(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"aisle","pattern_used":"answer tag"(...TRUNCATED) | [[{"details":"{'letters': 'awskie', 'length': 5}","errors":["cannot_be_formed_from_letters"],"final_(...TRUNCATED) | {"flips_by":[0,0,0,0,0,0,1,0],"flips_total":1,"num_correct":2,"pass_at_n":1,"percent_correct":0.25,"(...TRUNCATED) |
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(...TRUNCATED) | letter_countdown | ["<think>\n<sample>\nTo find the longest possible word using the given letters ['w', 's', 'u', 'i', (...TRUNCATED) | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {"api_url":"http://127.0.0.1:51151","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
] | [
"sigifi",
"wishufgs",
"fishing",
"swigau",
"fuiguws",
"fusig",
"ABC",
"impossible"
] | [{"extraction_type":"final","non_overlapping_spans":5,"original_span":"sigifi","span_end":12422,"spa(...TRUNCATED) | [{"details":"{'letters': 'wsuigf', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | [[false,false,false,false,false],[false],[false,false,false],[false,false,false],[false,false,false,(...TRUNCATED) | [["No such word exists.","wiseguy","No valid word can be formed","sigifi","sigifi"],["wishufgs"],["w(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"No such word exists.","pattern_use(...TRUNCATED) | [[{"details":"{'letters': 'wsuigf', 'length': 16}","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) |
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(...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:51151","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
] | [
"quench",
"entrepreneur",
"None of the above",
"ferret",
"qenter",
"uu",
"quantum",
"qenteru"
] | [{"extraction_type":"final","non_overlapping_spans":3,"original_span":"quench","span_end":2699,"span(...TRUNCATED) | [{"details":"{'letters': 'qentur', 'length': 6}","errors":["cannot_be_formed_from_letters"],"evaluat(...TRUNCATED) | [[false,false,false],[false,false,false],[false,false],[false,false,false,false,false],[false,false,(...TRUNCATED) | [["Quentur","quench","quench"],["quantumumuter","entrepreneur","entrepreneur"],["quint","None of the(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"Quentur","pattern_used":"answer ta(...TRUNCATED) | [[{"details":"{'letters': 'qentur', 'length': 7}","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) |
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>\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:51151","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
] | [
"atanxb",
"aat",
"axbta",
"abtx",
"batxa",
"attaxba",
"atext",
"fest"
] | [{"extraction_type":"final","non_overlapping_spans":3,"original_span":"atanxb","span_end":2951,"span(...TRUNCATED) | [{"details":"{'letters': 'attxba', 'length': 6}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | [[false,false,false],[false,false,false],[false,false,false],[true,false,false],[false,false],[false(...TRUNCATED) | [["No valid word exists","atanxb","atanxb"],["atxtbx","aat","aat"],["atxb","axbta","axbta"],["at","a(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"No valid word exists","pattern_use(...TRUNCATED) | [[{"details":"{'letters': 'attxba', 'length': 17}","errors":["not_a_valid_word","cannot_be_formed_fr(...TRUNCATED) | {"flips_by":[0,0,0,1,0,0,0,0],"flips_total":1,"num_correct":0,"pass_at_n":0,"percent_correct":0.0,"s(...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>\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:51151","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","oracle","occurrence","oucrge","ocregua","None of the above options form a valid word","og(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"orange","span_end":2025,"span(...TRUNCATED) | [{"details":"{'letters': 'ocrgeu', 'length': 6}","errors":["cannot_be_formed_from_letters"],"evaluat(...TRUNCATED) | [[false,false],[true,false,false],[false,false,false],[false,false],[false,false],[false,false],[fal(...TRUNCATED) | [["orange","orange"],["core","oracle","oracle"],["orcut","occurrence","occurrence"],["oucrge","oucrg(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"orange","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'ocrgeu', 'length': 6}","errors":["cannot_be_formed_from_letters"],"final_(...TRUNCATED) | {"flips_by":[0,1,0,0,0,0,0,0],"flips_total":1,"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>\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:51151","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,
false,
false,
false,
false,
false,
false,
false
] | [
"ux",
"uxbao",
"abkuox",
"oxford",
"None of the above options work",
"uuoba",
"uba",
"None of these"
] | [{"extraction_type":"final","non_overlapping_spans":4,"original_span":"ux","span_end":5548,"span_sta(...TRUNCATED) | [{"details":"{'letters': 'uobkax', 'length': 2}","errors":[],"evaluation_method":null,"extraction_re(...TRUNCATED) | [[false,false,true,true],[false,false,false],[false,false,false],[false,false,false],[false,false],[(...TRUNCATED) | [["okbaux","kuoba","ux","ux"],["ubo","No valid word can be formed","uxbao"],["ubakxa","abkuox","abku(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"okbaux","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'uobkax', 'length': 6}","errors":["not_a_valid_word"],"final_answer":"okba(...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
- 6