{"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":"/paper/supervised-and-unsupervised-neural-approaches","title":"Supervised and Unsupervised Neural Approaches to Text Readability","arxiv_id":"1907.11779","date":"2019-07-26","proceeding":"CL (ACL) 2021 3","authors":["Matej Martinc","Senja Pollak","Marko Robnik-Šikonja"],"abstract":"We present a set of novel neural supervised and unsupervised approaches for determining the readability of documents. In the unsupervised setting, we leverage neural language models, whereas in the supervised setting, three different neural classification architectures are tested. We show that the proposed neural unsupervised approach is robust, transferable across languages and allows adaptation to a specific readability task and data set. By systematic comparison of several neural architectures on a number of benchmark and new labelled readability datasets in two languages, this study also offers a comprehensive analysis of different neural approaches to readability classification. We expose their strengths and weaknesses, compare their performance to current state-of-the-art classification approaches to readability, which in most cases still rely on extensive feature engineering, and propose possibilities for improvements.","url_abs":"https://arxiv.org/abs/1907.11779v3","url_pdf":"https://arxiv.org/pdf/1907.11779v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"supervised-and-unsupervised-neural-approaches","repo_url":"https://github.com/jbrew/readability","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"supervised-and-unsupervised-neural-approaches","repo_url":"https://github.com/kinimod23/GRANT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"feature-engineering","task_name":"Feature Engineering"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"text-classification","task_name":"Text Classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/text-classification-on-onestopenglish","task":"Text Classification","dataset":"OneStopEnglish (Readability Assessment)","model":"HAN (Hierarchical Attention Network)","rank_in_archive_order":3,"of":5,"metrics":{"Accuracy (5-fold)":"0.787"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-weebit-readability","task":"Text Classification","dataset":"WeeBit (Readability Assessment)","model":"BERT","rank_in_archive_order":3,"of":5,"metrics":{"Accuracy (5-fold)":"0.857"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1907.11779","atlas_url":"https://app.syntology.ai/?focus=1907.11779","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1907.11779"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1907.11779\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1907.11779"},"call":"get_concepts_for_paper(arxiv_id=\"1907.11779\")"}],"by_repo":[{"repo":"jbrew/readability","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kinimod23/GRANT","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2604.24470"],"harvested_for_calls":[{"arxiv_id":"2604.24470","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2604.24470"},"call":"get_harvested_code_for_paper(arxiv_id=\"2604.24470\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ff69517fcc579d6373e279fad68602390b1c7e9588bdcb364fec6cc8436e77a8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}