letters stringlengths 4 4 | answer stringlengths 2 4 | all_best listlengths 1 8 | length int64 2 4 | letters_length int64 4 4 | 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
eanw | anew | [
"anew",
"wane",
"wean"
] | 4 | 4 | [
{
"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', 'a', 'n', and 'w'. Let's try different combinations:\n\n1. **ea**wn: This forms the word \"even\".\n2. **ena**: This does not form a valid word.\n3. **ewa**: This does not form a valid word.\n4. **wan**... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:52795",
"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
] | [
"even",
"enaew",
"aeaw",
"enew",
"ewanw",
"ewan",
"tears",
"wanew"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "even",
"span_end": 1234,
"span_start": 1228,
"total_spans_found": 2
},
{
"extraction_type": "final",
"non_overlapping_spans": 4,
"original_span": "enaew",
"span_end": 4633,
"span_start": 4628,... | [
{
"details": "{'letters': 'eanw', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "even",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'e... | [
[
false,
false
],
[
false,
false,
false,
false
],
[
true,
false
],
[
false,
false
],
[
false,
false,
false,
false
],
[
false,
false,
false
],
[
true,
false,
true,
false,
false
],
[
false,
fals... | [
[
"even",
"even"
],
[
"eaawn",
"None",
"enaew",
"enaew"
],
[
"aw",
"aeaw"
],
[
"enew",
"enew"
],
[
"No valid word can be formed",
"No valid word can be formed",
"ewanw",
"ewanw"
],
[
"enewed",
"ewan",
"ewan"
],
[
"ew",
... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "even",
"pattern_used": "answer tag",
"position": 715,
"span_end": 721,
"span_start": 715,
"span_text": "even"
},
{
"confidence": 1,
"extraction_type": "internal",
"orig... | [
[
{
"details": "{'letters': 'eanw', 'length': 4}",
"errors": [
"cannot_be_formed_from_letters"
],
"final_answer": "even",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'eanw', 'length': 4}",
"errors": [
"cannot_b... | {
"flips_by": [
0,
0,
1,
0,
0,
0,
2,
0
],
"flips_total": 3,
"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,
... |
opmm | mom | [
"mom",
"mop",
"pom"
] | 3 | 4 | [
{
"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 'o', 'p', 'm', and 'm'. Let's try different combinations:\n\n1. **Combining all three letters**: \"ompm\"\n - This forms the word \"opomp\", which has 5 letters.\n \n2. **Trying other combinati... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:52795",
"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
] | [
"ommm",
"mm",
"top",
"omm",
"None",
"None",
"opmm",
"mom"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 4,
"original_span": "ommm",
"span_end": 5038,
"span_start": 5032,
"total_spans_found": 4
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "mm",
"span_end": 1035,
"span_start": 1031,
... | [
{
"details": "{'letters': 'opmm', 'length': 4}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "ommm",
"is_correct": false,
"reason": null,
"target_matches": false
},
{
... | [
[
false,
false,
false,
false
],
[
true,
true
],
[
true,
false,
false
],
[
true,
false,
false
],
[
false,
false
],
[
false,
false
],
[
false,
false,
false
],
[
false,
true,
true
]
] | [
[
"ommm",
"omm",
"ommm",
"ommm"
],
[
"mm",
"mm"
],
[
"mop",
"top",
"top"
],
[
"mom",
"omm",
"omm"
],
[
"moom",
"None"
],
[
"ompp",
"None"
],
[
"opomp",
"opmm",
"opmm"
],
[
"opomp",
"mom",
"mom"
]
] | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "ommm",
"pattern_used": "answer tag",
"position": 1050,
"span_end": 1056,
"span_start": 1050,
"span_text": "ommm"
},
{
"confidence": 1,
"extraction_type": "internal",
"o... | [
[
{
"details": "{'letters': 'opmm', 'length': 4}",
"errors": [
"not_a_valid_word",
"cannot_be_formed_from_letters"
],
"final_answer": "ommm",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'opmm', 'length': 3}",
"... | {
"flips_by": [
0,
0,
1,
1,
0,
0,
0,
0
],
"flips_total": 2,
"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... |
iwhj | hi | [
"hi",
"hw",
"iw",
"ji",
"wh",
"wi"
] | 2 | 4 | [
{
"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', 'w', 'h', and 'j'. Let's try different combinations:\n\n1. **ihwj**: This does not form a valid word.\n2. **ijhw**: This also does not form a valid word.\n3. **iwjh**: This forms the word \"hi... | [
false,
false,
false,
false,
false,
false,
false,
false
] | [
"",
"",
"",
"",
"",
"",
"",
""
] | {
"api_url": "http://127.0.0.1:52795",
"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,
true,
false,
false,
false,
true,
false
] | [
"wi",
"who",
"hw",
"No valid word can be created",
"himself",
"white",
"wh",
"hijack"
] | [
{
"extraction_type": "final",
"non_overlapping_spans": 3,
"original_span": "wi",
"span_end": 3068,
"span_start": 3064,
"total_spans_found": 3
},
{
"extraction_type": "final",
"non_overlapping_spans": 2,
"original_span": "who",
"span_end": 949,
"span_start": 944,
"... | [
{
"details": "{'letters': 'iwhj', 'length': 2}",
"errors": [],
"evaluation_method": null,
"extraction_result": null,
"final_answer": "wi",
"is_correct": true,
"reason": null,
"target_matches": false
},
{
"details": "{'letters': 'iwhj', 'length': 3}",
"errors": [
"ca... | [
[
false,
true,
true
],
[
false,
false
],
[
true,
true
],
[
false,
false,
false
],
[
false,
false
],
[
false,
false
],
[
true,
true
],
[
false,
false,
false
]
] | [
[
"iwhj",
"wi",
"wi"
],
[
"who",
"who"
],
[
"hw",
"hw"
],
[
"him",
"No valid word can be created.",
"No valid word can be created"
],
[
"himself",
"himself"
],
[
"white",
"white"
],
[
"wh",
"wh"
],
[
"wind",
"hijack"... | [
[
{
"confidence": 1,
"extraction_type": "internal",
"original_span": "iwhj",
"pattern_used": "answer tag",
"position": 1374,
"span_end": 1380,
"span_start": 1374,
"span_text": "iwhj"
},
{
"confidence": 1,
"extraction_type": "internal",
"o... | [
[
{
"details": "{'letters': 'iwhj', 'length': 4}",
"errors": [
"not_a_valid_word"
],
"final_answer": "iwhj",
"is_correct": false,
"target_matches": false
},
{
"details": "{'letters': 'iwhj', 'length': 2}",
"errors": [],
"final_answer": "wi",
... | {
"flips_by": [
0,
0,
0,
0,
0,
0,
0,
0
],
"flips_total": 0,
"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,
... |
uumf | fum | [
"fum",
"umu"
] | 3 | 4 | [{"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:52795","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,
false
] | [
"uumf",
"fum",
"fumu",
"umbrella",
"uum",
"uufm",
"fruit",
"utfm"
] | [{"extraction_type":"final","non_overlapping_spans":3,"original_span":"uumf","span_end":2663,"span_s(...TRUNCATED) | [{"details":"{'letters': 'uumf', 'length': 4}","errors":["not_a_valid_word"],"evaluation_method":nul(...TRUNCATED) | [[false,false,false],[true],[false,false],[false,false,false],[false,false],[false,false,false,false(...TRUNCATED) | [["fim","uumf","uumf"],["fum"],["fumu","fumu"],["uuuf","umbrella","umbrella"],["uum","uum"],["uff","(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"fim","pattern_used":"answer tag","(...TRUNCATED) | [[{"details":"{'letters': 'uumf', 'length': 3}","errors":["not_a_valid_word","cannot_be_formed_from_(...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) |
oakl | kalo | [
"kalo",
"kola",
"loka"
] | 4 | 4 | [{"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:52795","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,
true,
false,
false,
false,
false
] | [
"okla",
"o",
"koa",
"ka",
"fortress",
"okla",
"oakl",
"aa"
] | [{"extraction_type":"final","non_overlapping_spans":4,"original_span":"okla","span_end":4415,"span_s(...TRUNCATED) | [{"details":"{'letters': 'oakl', 'length': 4}","errors":["not_a_valid_word"],"evaluation_method":nul(...TRUNCATED) | [[true,false,false,false],[true,false,false],[true,true,true],[false,false,false,true,true],[false,f(...TRUNCATED) | [["kalo","okay","okla","okla"],["ok","'o'","o"],["oak","koa","koa"],["okal","No valid word can be fo(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"kalo","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'oakl', 'length': 4}","errors":[],"final_answer":"kalo","is_correct":true,(...TRUNCATED) | {"flips_by":[1,1,0,0,0,0,1,1],"flips_total":4,"num_correct":2,"pass_at_n":1,"percent_correct":0.25,"(...TRUNCATED) |
avnh | avn | [
"avn",
"han",
"hav",
"nav",
"van"
] | 3 | 4 | [{"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:52795","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 english word can be formed from the given letters.","haven",null,"avenue","No valid word (...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":3,"original_span":"no valid english word can be (...TRUNCATED) | [{"details":"{'letters': 'avnh', 'length': 48}","errors":["not_a_valid_word","cannot_be_formed_from_(...TRUNCATED) | [[false,false,false],[false,false,false],[],[false,false],[false,false,false],[false,false,false,fal(...TRUNCATED) | [["animal","No valid English word can be formed from the given letters.","no valid english word can (...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"animal","pattern_used":"answer tag(...TRUNCATED) | [[{"details":"{'letters': 'avnh', 'length': 6}","errors":["cannot_be_formed_from_letters"],"final_an(...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) |
ejfh | feh | [
"feh",
"jef"
] | 3 | 4 | [{"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:52795","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
] | ["None of these words can be made.","hjefe","fejh","sheep","ehf","ejhf","ejfh","None of the above op(...TRUNCATED) | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"None of these words can be ma(...TRUNCATED) | [{"details":"{'letters': 'ejfh', 'length': 25}","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 such word exists.","None of these words can be made."],["hjefe"],["fejh"],["feed","sheep","she(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"No such word exists.","pattern_use(...TRUNCATED) | [[{"details":"{'letters': 'ejfh', 'length': 16}","errors":["not_a_valid_word","cannot_be_formed_from(...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) |
itzt | tit | [
"tit",
"zit"
] | 3 | 4 | [{"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:52795","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
] | [
"itzt",
"itzt",
"iti",
"No valid word can be formed.",
"faster",
"ti",
"itz",
"itzt"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"itzt","span_end":2449,"span_s(...TRUNCATED) | [{"details":"{'letters': 'itzt', 'length': 4}","errors":["not_a_valid_word"],"evaluation_method":nul(...TRUNCATED) | [[false,false],[false,false,false,false,false],[false,false,false,false],[false],[false,false,false,(...TRUNCATED) | [["itzt","itzt"],["its","itz","itz","itzt","itzt"],["itzzt","itt","iti","iti"],["No valid word can b(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"itzt","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'itzt', 'length': 4}","errors":["not_a_valid_word"],"final_answer":"itzt",(...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) |
rwuz | wur | [
"wur"
] | 3 | 4 | [{"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:52795","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
] | [
"word",
"rule",
"pushy",
"uwrr",
"aaaa",
"No valid word",
"rwuz",
"rusher"
] | [{"extraction_type":"final","non_overlapping_spans":2,"original_span":"word","span_end":1359,"span_s(...TRUNCATED) | [{"details":"{'letters': 'rwuz', 'length': 4}","errors":["cannot_be_formed_from_letters"],"evaluatio(...TRUNCATED) | [[false,false],[false,false,false],[false,false,false],[false,false,false],[false,false],[false,fals(...TRUNCATED) | [["word","word"],["cannot be made","rule","rule"],["rwuz","wrusz","pushy"],["wurz","uwrr","uwrr"],["(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"word","pattern_used":"answer tag",(...TRUNCATED) | [[{"details":"{'letters': 'rwuz', 'length': 4}","errors":["cannot_be_formed_from_letters"],"final_an(...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) |
unig | gin | [
"gin",
"gnu",
"gun",
"ign",
"ing",
"nig",
"ung",
"uni"
] | 3 | 4 | [{"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:52795","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
] | [
"niuge",
"ugni",
"unit",
"inguu",
"gniguiug",
"uniguu",
"gini",
"ugni"
] | [{"extraction_type":"final","non_overlapping_spans":4,"original_span":"niuge","span_end":3470,"span_(...TRUNCATED) | [{"details":"{'letters': 'unig', 'length': 5}","errors":["not_a_valid_word","cannot_be_formed_from_l(...TRUNCATED) | [[false,false,false,false],[false,false,false],[false,false],[false,false],[false,true,false,false,f(...TRUNCATED) | [["No valid word found","No valid word found","niuge","niuge"],["unig","ugni","ugni"],["unit","unit"(...TRUNCATED) | [[{"confidence":1.0,"extraction_type":"internal","original_span":"No valid word found","pattern_used(...TRUNCATED) | [[{"details":"{'letters': 'unig', 'length': 16}","errors":["not_a_valid_word","cannot_be_formed_from(...TRUNCATED) | {"flips_by":[0,0,0,0,1,0,0,0],"flips_total":1,"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