{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/lexical-complexity-prediction","name":"Lexical Complexity Prediction","slug":"lexical-complexity-prediction","description_markdown":"Predicting the complexity of a word/multi-word expression in a sentence.","categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":44,"papers_with_code":11,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/lexical-analysis","name":"Lexical Analysis"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":44,"of":44,"of_with_code":11,"tagged_in_all":44,"counts":{"archive_papers_tagged":44,"with_a_code_link":11,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":44,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/japanese-lexical-complexity-for-non-native","slug":"japanese-lexical-complexity-for-non-native","title":"Japanese Lexical Complexity for Non-Native Readers: A New Dataset","date":"2023-06-30","arxiv_id":"2306.17399","repositories_listed":2,"syntology":null},{"url":"/paper/cs60075-team2-at-semeval-2021-task-1-lexical","slug":"cs60075-team2-at-semeval-2021-task-1-lexical","title":"cs60075_team2 at SemEval-2021 Task 1 : Lexical Complexity Prediction using Transformer-based Language Models pre-trained on various text corpora","date":"2021-06-04","arxiv_id":"2106.02340","repositories_listed":2,"syntology":null},{"url":"/paper/investigating-large-language-models-for-1","slug":"investigating-large-language-models-for-1","title":"Investigating Large Language Models for Complex Word Identification in Multilingual and Multidomain Setups","date":"2024-11-03","arxiv_id":"2411.01706","repositories_listed":1,"syntology":null},{"url":"/paper/difficult-for-whom-a-study-of-japanese","slug":"difficult-for-whom-a-study-of-japanese","title":"Difficult for Whom? A Study of Japanese Lexical Complexity","date":"2024-10-24","arxiv_id":"2410.18567","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-film-subtitles-is-youtube-the-best","slug":"beyond-film-subtitles-is-youtube-the-best","title":"Beyond Film Subtitles: Is YouTube the Best Approximation of Spoken Vocabulary?","date":"2024-10-04","arxiv_id":"2410.03240","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-readability-assessment-of-german-1","slug":"automatic-readability-assessment-of-german-1","title":"Automatic Readability Assessment of German Sentences with Transformer Ensembles","date":"2022-09-09","arxiv_id":"2209.04299","repositories_listed":1,"syntology":null},{"url":"/paper/andi-at-semeval-2021-task-1-predicting","slug":"andi-at-semeval-2021-task-1-predicting","title":"ANDI at SemEval-2021 Task 1: Predicting complexity in context using distributional models, behavioural norms, and lexical resources","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cs60075-team2-at-semeval-2021-task-1-lexical-1","slug":"cs60075-team2-at-semeval-2021-task-1-lexical-1","title":"cs60075\\_team2 at SemEval-2021 Task 1 : Lexical Complexity Prediction using Transformer-based Language Models pre-trained on various text corpora","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/biggreen-at-semeval-2021-task-1-lexical","slug":"biggreen-at-semeval-2021-task-1-lexical","title":"BigGreen at SemEval-2021 Task 1: Lexical Complexity Prediction with Assembly Models","date":"2021-04-19","arxiv_id":"2104.09040","repositories_listed":1,"syntology":null},{"url":"/paper/iitk-lcp-at-semeval-2021-task-1","slug":"iitk-lcp-at-semeval-2021-task-1","title":"IITK@LCP at SemEval 2021 Task 1: Classification for Lexical Complexity Regression Task","date":"2021-04-02","arxiv_id":"2104.01046","repositories_listed":1,"syntology":null},{"url":"/paper/complex-a-new-corpus-for-lexical-complexity","slug":"complex-a-new-corpus-for-lexical-complexity","title":"CompLex: A New Corpus for Lexical Complexity Prediction from Likert Scale Data","date":"2020-03-16","arxiv_id":"2003.07008","repositories_listed":1,"syntology":null},{"url":null,"slug":"multils-sp-ca-lexical-complexity-prediction","title":"MultiLS-SP/CA: Lexical Complexity Prediction and Lexical Simplification Resources for Catalan and Spanish","date":"2024-04-11","arxiv_id":"2404.07814","repositories_listed":0,"syntology":null},{"url":null,"slug":"multils-a-multi-task-lexical-simplification","title":"MultiLS: A Multi-task Lexical Simplification Framework","date":"2024-02-22","arxiv_id":"2402.14972","repositories_listed":0,"syntology":null},{"url":null,"slug":"lexical-complexity-prediction-an-overview","title":"Lexical Complexity Prediction: An Overview","date":"2023-03-08","arxiv_id":"2303.04851","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-evaluation-of-binary-comparative-lexical","title":"An Evaluation of Binary Comparative Lexical Complexity Models","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-adaptation-in-multilingual-and-multi-1","title":"Domain Adaptation in Multilingual and Multi-Domain Monolingual Settings for Complex Word Identification","date":"2022-05-15","arxiv_id":"2205.07283","repositories_listed":0,"syntology":null},{"url":null,"slug":"alejandro-mosquera-at-semeval-2021-task-1","title":"Alejandro Mosquera at SemEval-2021 Task 1: Exploring Sentence and Word Features for Lexical Complexity Prediction","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"archer-at-semeval-2021-task-1-contextualising","title":"archer at SemEval-2021 Task 1: Contextualising Lexical Complexity","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cambridge-at-semeval-2021-task-1-an-ensemble","title":"Cambridge at SemEval-2021 Task 1: An Ensemble of Feature-Based and Neural Models for Lexical Complexity Prediction","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"clulex-at-semeval-2021-task-1-a-simple-system","title":"CLULEX at SemEval-2021 Task 1: A Simple System Goes a Long Way","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"complex-words-identification-using-word-level","title":"Complex words identification using word-level features for SemEval-2020 Task 1","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"compna-at-semeval-2021-task-1-prediction-of","title":"CompNA at SemEval-2021 Task 1: Prediction of lexical complexity analyzing heterogeneous features","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cs-um6p-at-semeval-2021-task-1-a-deep","title":"CS-UM6P at SemEval-2021 Task 1: A Deep Learning Model-based Pre-trained Transformer Encoder for Lexical Complexity","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"csecu-dsg-at-semeval-2021-task-1-fusion-of","title":"CSECU-DSG at SemEval-2021 Task 1: Fusion of Transformer Models for Lexical Complexity Prediction","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deepblueai-at-semeval-2021-task-1-lexical","title":"DeepBlueAI at SemEval-2021 Task 1: Lexical Complexity Prediction with A Deep Ensemble Approach","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hub-at-semeval-2021-task-1-fusion-of-sentence","title":"hub at SemEval-2021 Task 1: Fusion of Sentence and Word Frequency to Predict Lexical Complexity","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"iapucp-at-semeval-2021-task-1-stacking-fine","title":"IAPUCP at SemEval-2021 Task 1: Stacking Fine-Tuned Transformers is Almost All You Need for Lexical Complexity Prediction","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"iitk-lcp-at-semeval-2021-task-1-1","title":"IITK@LCP at SemEval-2021 Task 1: Classification for Lexical Complexity Regression Task","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"jct-at-semeval-2021-task-1-context-aware","title":"JCT at SemEval-2021 Task 1: Context-aware Representation for Lexical Complexity Prediction","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"katildakat-at-semeval-2021-task-1-lexical","title":"katildakat at SemEval-2021 Task 1: Lexical Complexity Prediction of Single Words and Multi-Word Expressions in English","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"polyu-cbs-comp-at-semeval-2021-task-1-lexical","title":"PolyU CBS-Comp at SemEval-2021 Task 1: Lexical Complexity Prediction (LCP)","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rg-pa-at-semeval-2021-task-1-a-contextual","title":"RG PA at SemEval-2021 Task 1: A Contextual Attention-based Model with RoBERTa for Lexical Complexity Prediction","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rs-gv-at-semeval-2021-task-1-sense-relative","title":"RS\\_GV at SemEval-2021 Task 1: Sense Relative Lexical Complexity Prediction","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stanford-mlab-at-semeval-2021-task-1-tree","title":"Stanford MLab at SemEval-2021 Task 1: Tree-Based Modelling of Lexical Complexity using Word Embeddings","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unbnlp-at-semeval-2021-task-1-predicting","title":"UNBNLP at SemEval-2021 Task 1: Predicting lexical complexity with masked language models and character-level encoders","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"utfpr-at-semeval-2021-task-1-complexity","title":"UTFPR at SemEval-2021 Task 1: Complexity Prediction by Combining BERT Vectors and Classic Features","date":"2021-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semeval-2021-task-1-lexical-complexity","title":"SemEval-2021 Task 1: Lexical Complexity Prediction","date":"2021-06-01","arxiv_id":"2106.00473","repositories_listed":0,"syntology":null},{"url":null,"slug":"last-at-semeval-2021-task-1-improving-multi","title":"LAST at SemEval-2021 Task 1: Improving Multi-Word Complexity Prediction Using Bigram Association Measures","date":"2021-05-20","arxiv_id":"2105.09653","repositories_listed":0,"syntology":null},{"url":null,"slug":"lcp-rit-at-semeval-2021-task-1-exploring","title":"LCP-RIT at SemEval-2021 Task 1: Exploring Linguistic Features for Lexical Complexity Prediction","date":"2021-05-18","arxiv_id":"2105.08780","repositories_listed":0,"syntology":null},{"url":null,"slug":"ochadai-kyodai-at-semeval-2021-task-1","title":"OCHADAI-KYOTO at SemEval-2021 Task 1: Enhancing Model Generalization and Robustness for Lexical Complexity Prediction","date":"2021-05-12","arxiv_id":"2105.05535","repositories_listed":0,"syntology":null},{"url":null,"slug":"upb-at-semeval-2021-task-1-combining-deep","title":"UPB at SemEval-2021 Task 1: Combining Deep Learning and Hand-Crafted Features for Lexical Complexity Prediction","date":"2021-04-14","arxiv_id":"2104.06983","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-lexical-complexity-in-english","title":"Predicting Lexical Complexity in English Texts: The Complex 2.0 Dataset","date":"2021-02-17","arxiv_id":"2102.08773","repositories_listed":0,"syntology":null},{"url":null,"slug":"complex-a-new-corpus-for-lexical-complexity-1","title":"CompLex --- A New Corpus for Lexical Complexity Prediction from Likert Scale Data","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-single-word-lexical-complexity","title":"Towards Single Word Lexical Complexity Prediction","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"921bb4109748bcd93a3f6988e30553427ba80b756a09936e0c9c0c3bb2a1ae51","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}