{"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/constituency-parsing","name":"Constituency Parsing","slug":"constituency-parsing","description_markdown":"Constituency parsing aims to extract a constituency-based parse tree from a sentence that\r\nrepresents its syntactic structure according to a [phrase structure grammar](https://en.wikipedia.org/wiki/Phrase_structure_grammar).\r\n\r\nExample:\r\n\r\n                 Sentence (S)\r\n                     |\r\n       +-------------+------------+\r\n       |                          |\r\n     Noun (N)                Verb Phrase (VP)\r\n       |                          |\r\n     John                 +-------+--------+\r\n                          |                |\r\n                        Verb (V)         Noun (N)\r\n                          |                |\r\n                        sees              Bill\r\n\r\n[Recent approaches](https://papers.nips.cc/paper/5635-grammar-as-a-foreign-language.pdf)\r\nconvert the parse tree into a sequence following a depth-first traversal in order to\r\nbe able to apply sequence-to-sequence models to it. The linearized version of the\r\nabove parse tree looks as follows: (S (N) (VP V N)).","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":"archive_url"},"counts":{"papers_tagged":204,"papers_with_code":81,"benchmarks":4,"benchmark_tables_in_archive":4,"benchmark_tables_shown":4,"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":6,"subtasks":1,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/constituency-parsing-on-penn-treebank","slug":"constituency-parsing-on-penn-treebank","dataset":"Penn Treebank","dataset_url":"/dataset/penn-treebank","rows_in_archive":27,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"Hashing + XLNet","paper_title":"To be Continuous, or to be Discrete, Those are Bits of Questions","paper_url":"/paper/to-be-continuous-or-to-be-discrete-those-are","paper_date":"2024-06-12","arxiv_id":"2406.07812","code_links":[{"title":"speedcell4/parserker","url":"https://github.com/speedcell4/parserker"}],"syntology":null}},{"leaderboard":"/sota/constituency-parsing-on-ctb5","slug":"constituency-parsing-on-ctb5","dataset":"CTB5","dataset_url":null,"rows_in_archive":9,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"Attach-Juxtapose Parser + BERT","paper_title":"Strongly Incremental Constituency Parsing with Graph Neural Networks","paper_url":"/paper/strongly-incremental-constituency-parsing","paper_date":"2020-10-27","arxiv_id":"2010.14568","code_links":[{"title":"yzhangcs/parser","url":"https://github.com/yzhangcs/parser"},{"title":"princeton-vl/attach-juxtapose-parser","url":"https://github.com/princeton-vl/attach-juxtapose-parser"},{"title":"anaezquerro/incpar","url":"https://github.com/anaezquerro/incpar"}],"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/strongly-incremental-constituency-parsing#ran","syntology_url":"https://syntology.ai/paper/2010.14568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14568"}},"official":{"repos":["princeton-vl/attach-juxtapose-parser"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/constituency-parsing-on-ctb7","slug":"constituency-parsing-on-ctb7","dataset":"CTB7","dataset_url":null,"rows_in_archive":3,"metrics":["F1 score"],"first_row_in_archive_order":{"model":"CRF Parser + Electra","paper_title":"Fast and Accurate Neural CRF Constituency Parsing","paper_url":"/paper/fast-and-accurate-neural-crf-constituency-1","paper_date":"2020-08-09","arxiv_id":"2008.03736","code_links":[{"title":"yzhangcs/parser","url":"https://github.com/yzhangcs/parser"},{"title":"yzhangcs/crfpar","url":"https://github.com/yzhangcs/crfpar"}],"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-neural-crf-constituency-1#ran","syntology_url":"https://syntology.ai/paper/2008.03736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.03736"}},"official":{"repos":["yzhangcs/crfpar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}}},{"leaderboard":"/sota/constituency-parsing-on-atb","slug":"constituency-parsing-on-atb","dataset":"ATB","dataset_url":null,"rows_in_archive":1,"metrics":["F1"],"first_row_in_archive_order":{"model":"SAPar","paper_title":"Improving Constituency Parsing with Span Attention","paper_url":"/paper/improving-constituency-parsing-with-span","paper_date":"2020-10-15","arxiv_id":"2010.07543","code_links":[{"title":"cuhksz-nlp/SAPar","url":"https://github.com/cuhksz-nlp/SAPar"}],"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/improving-constituency-parsing-with-span#ran","syntology_url":"https://syntology.ai/paper/2010.07543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07543"}},"official":{"repos":["cuhksz-nlp/SAPar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}}],"datasets":[{"url":"/dataset/penn-treebank","name":"Penn Treebank","full_name":"","num_papers_in_archive":1006},{"url":"/dataset/flue-french-language-understanding-evaluation","name":"FLUE","full_name":"French Language Understanding Evaluation","num_papers_in_archive":12},{"url":"/dataset/taiga-corpus","name":"Taiga Corpus","full_name":"An open-source corpus for machine learning.","num_papers_in_archive":5},{"url":"/dataset/pcc","name":"PCC","full_name":"Potsdam Commentary Corpus","num_papers_in_archive":2},{"url":"/dataset/alexa-point-of-view","name":"Alexa Point of View","full_name":null,"num_papers_in_archive":1},{"url":"/dataset/masc","name":"MASC","full_name":"Manually Annotated Sub-Corpus","num_papers_in_archive":1}],"subtasks":[{"url":"/task/constituency-grammar-induction","name":"Constituency Grammar Induction"}],"parent_tasks":[],"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":3,"rows_per_page":100,"shown":100,"of":204,"of_with_code":81,"tagged_in_all":204,"counts":{"archive_papers_tagged":204,"with_a_code_link":81,"where_syntology_ran_a_sample":24,"not_listed_spam_title":0,"listed":204,"listed_where_code_ran":24,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":20,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":20,"listed_every_run_a_failure_of_syntologys_instrument":4,"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/scheduled-sampling-for-sequence-prediction","slug":"scheduled-sampling-for-sequence-prediction","title":"Scheduled Sampling for Sequence Prediction with Recurrent Neural Networks","date":"2015-06-09","arxiv_id":"1506.03099","repositories_listed":9,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/scheduled-sampling-for-sequence-prediction#ran","syntology_url":"https://syntology.ai/paper/1506.03099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.03099"}},"official":null}},{"url":"/paper/grammar-as-a-foreign-language","slug":"grammar-as-a-foreign-language","title":"Grammar as a Foreign Language","date":"2014-12-23","arxiv_id":"1412.7449","repositories_listed":7,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/grammar-as-a-foreign-language#ran","syntology_url":"https://syntology.ai/paper/1412.7449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.7449"}},"official":null}},{"url":"/paper/recurrent-neural-network-grammars","slug":"recurrent-neural-network-grammars","title":"Recurrent Neural Network Grammars","date":"2016-02-25","arxiv_id":"1602.07776","repositories_listed":6,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/recurrent-neural-network-grammars#ran","syntology_url":"https://syntology.ai/paper/1602.07776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07776"}},"official":{"repos":["clab/rnng"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"url":"/paper/constituency-parsing-with-a-self-attentive","slug":"constituency-parsing-with-a-self-attentive","title":"Constituency Parsing with a Self-Attentive Encoder","date":"2018-05-02","arxiv_id":"1805.01052","repositories_listed":5,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/constituency-parsing-with-a-self-attentive#ran","syntology_url":"https://syntology.ai/paper/1805.01052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01052"}},"official":{"repos":["nikitakit/self-attentive-parser"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/multilingual-constituency-parsing-with-self","slug":"multilingual-constituency-parsing-with-self","title":"Multilingual Constituency Parsing with Self-Attention and Pre-Training","date":"2018-12-31","arxiv_id":"1812.11760","repositories_listed":4,"syntology":{"n":28,"n_ran":22,"n_constructed":0,"n_ran_checked":19,"n_instrument":3,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":3,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 3 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/multilingual-constituency-parsing-with-self#ran","syntology_url":"https://syntology.ai/paper/1812.11760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.11760"}},"official":{"repos":["nikitakit/self-attentive-parser"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/strongly-incremental-constituency-parsing","slug":"strongly-incremental-constituency-parsing","title":"Strongly Incremental Constituency Parsing with Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.14568","repositories_listed":3,"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/strongly-incremental-constituency-parsing#ran","syntology_url":"https://syntology.ai/paper/2010.14568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14568"}},"official":{"repos":["princeton-vl/attach-juxtapose-parser"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/generalizing-natural-language-analysis-1","slug":"generalizing-natural-language-analysis-1","title":"Generalizing Natural Language Analysis through Span-relation Representations","date":"2019-11-10","arxiv_id":"1911.03822","repositories_listed":3,"syntology":null},{"url":"/paper/unsupervised-latent-tree-induction-with-deep","slug":"unsupervised-latent-tree-induction-with-deep","title":"Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoders","date":"2019-04-03","arxiv_id":"1904.02142","repositories_listed":3,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-latent-tree-induction-with-deep#ran","syntology_url":"https://syntology.ai/paper/1904.02142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.02142"}},"official":{"repos":["iesl/diora"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/flexible-grammar-based-constrained-decoding","slug":"flexible-grammar-based-constrained-decoding","title":"Grammar-Constrained Decoding for Structured NLP Tasks without Finetuning","date":"2023-05-23","arxiv_id":"2305.13971","repositories_listed":2,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/flexible-grammar-based-constrained-decoding#ran","syntology_url":"https://syntology.ai/paper/2305.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13971"}},"official":{"repos":["epfl-dlab/gcd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/challenges-to-open-domain-constituency","slug":"challenges-to-open-domain-constituency","title":"Challenges to Open-Domain Constituency Parsing","date":"2022-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/structformer-joint-unsupervised-induction-of-1","slug":"structformer-joint-unsupervised-induction-of-1","title":"StructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language Modeling","date":"2020-12-01","arxiv_id":"2012.00857","repositories_listed":2,"syntology":null},{"url":"/paper/converting-the-point-of-view-of-messages","slug":"converting-the-point-of-view-of-messages","title":"Converting the Point of View of Messages Spoken to Virtual Assistants","date":"2020-10-06","arxiv_id":"2010.02600","repositories_listed":2,"syntology":null},{"url":"/paper/fast-and-accurate-neural-crf-constituency-1","slug":"fast-and-accurate-neural-crf-constituency-1","title":"Fast and Accurate Neural CRF Constituency Parsing","date":"2020-08-09","arxiv_id":"2008.03736","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-neural-crf-constituency-1#ran","syntology_url":"https://syntology.ai/paper/2008.03736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.03736"}},"official":{"repos":["yzhangcs/crfpar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/rethinking-self-attention-an-interpretable","slug":"rethinking-self-attention-an-interpretable","title":"Rethinking Self-Attention: Towards Interpretability in Neural Parsing","date":"2019-11-10","arxiv_id":"1911.03875","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rethinking-self-attention-an-interpretable#ran","syntology_url":"https://syntology.ai/paper/1911.03875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03875"}},"official":{"repos":["KhalilMrini/LAL-Parser"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tetra-tagging-word-synchronous-parsing-with","slug":"tetra-tagging-word-synchronous-parsing-with","title":"Tetra-Tagging: Word-Synchronous Parsing with Linear-Time Inference","date":"2019-04-22","arxiv_id":"1904.09745","repositories_listed":2,"syntology":null},{"url":"/paper/straight-to-the-tree-constituency-parsing","slug":"straight-to-the-tree-constituency-parsing","title":"Straight to the Tree: Constituency Parsing with Neural Syntactic Distance","date":"2018-06-11","arxiv_id":"1806.04168","repositories_listed":2,"syntology":null},{"url":"/paper/yellowfin-and-the-art-of-momentum-tuning","slug":"yellowfin-and-the-art-of-momentum-tuning","title":"YellowFin and the Art of Momentum Tuning","date":"2017-06-12","arxiv_id":"1706.03471","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/yellowfin-and-the-art-of-momentum-tuning#ran","syntology_url":"https://syntology.ai/paper/1706.03471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03471"}},"official":null}},{"url":"/paper/automatic-extraction-of-clausal-embedding","slug":"automatic-extraction-of-clausal-embedding","title":"Automatic Extraction of Clausal Embedding Based on Large-Scale English Text Data","date":"2025-06-16","arxiv_id":"2506.14064","repositories_listed":1,"syntology":null},{"url":"/paper/improving-unsupervised-constituency-parsing","slug":"improving-unsupervised-constituency-parsing","title":"Improving Unsupervised Constituency Parsing via Maximizing Semantic Information","date":"2024-10-03","arxiv_id":"2410.02558","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-unsupervised-constituency-parsing#ran","syntology_url":"https://syntology.ai/paper/2410.02558","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02558"}},"official":{"repos":["junjiechen-chris/improving-unsupervised-constituency-parsing-via-maximizing-semantic-information"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structural-optimization-ambiguity-and","slug":"structural-optimization-ambiguity-and","title":"Structural Optimization Ambiguity and Simplicity Bias in Unsupervised Neural Grammar Induction","date":"2024-07-23","arxiv_id":"2407.16181","repositories_listed":1,"syntology":null},{"url":"/paper/to-be-continuous-or-to-be-discrete-those-are","slug":"to-be-continuous-or-to-be-discrete-those-are","title":"To be Continuous, or to be Discrete, Those are Bits of Questions","date":"2024-06-12","arxiv_id":"2406.07812","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-based-unsupervised-discontinuous","slug":"ensemble-based-unsupervised-discontinuous","title":"Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsing","date":"2024-02-29","arxiv_id":"2403.00143","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":3,"n_pointer_only":10,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ensemble-based-unsupervised-discontinuous#ran","syntology_url":"https://syntology.ai/paper/2403.00143","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00143"}},"official":{"repos":["manga-uofa/taa4eudcp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-tree-alignment-for-evaluation-of","slug":"structured-tree-alignment-for-evaluation-of","title":"Structured Tree Alignment for Evaluation of (Speech) Constituency Parsing","date":"2024-02-21","arxiv_id":"2402.13433","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-tree-alignment-for-evaluation-of#ran","syntology_url":"https://syntology.ai/paper/2402.13433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13433"}},"official":{"repos":["explorerfreda/struct-iou"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sketch-guided-constrained-decoding-for","slug":"sketch-guided-constrained-decoding-for","title":"Sketch-Guided Constrained Decoding for Boosting Blackbox Large Language Models without Logit Access","date":"2024-01-18","arxiv_id":"2401.09967","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/sketch-guided-constrained-decoding-for#ran","syntology_url":"https://syntology.ai/paper/2401.09967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09967"}},"official":{"repos":["epfl-dlab/sketchgcd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/multistage-collaborative-knowledge","slug":"multistage-collaborative-knowledge","title":"Multistage Collaborative Knowledge Distillation from a Large Language Model for Semi-Supervised Sequence Generation","date":"2023-11-15","arxiv_id":"2311.08640","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multistage-collaborative-knowledge#ran","syntology_url":"https://syntology.ai/paper/2311.08640","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.08640"}},"official":{"repos":["andotalao24/multistage-collaborative-knowledge-distillation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/llm-enhanced-self-training-for-cross-domain","slug":"llm-enhanced-self-training-for-cross-domain","title":"LLM-enhanced Self-training for Cross-domain Constituency Parsing","date":"2023-11-05","arxiv_id":"2311.02660","repositories_listed":1,"syntology":null},{"url":"/paper/simple-hardware-efficient-pcfgs-with","slug":"simple-hardware-efficient-pcfgs-with","title":"Simple Hardware-Efficient PCFGs with Independent Left and Right Productions","date":"2023-10-23","arxiv_id":"2310.14997","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simple-hardware-efficient-pcfgs-with#ran","syntology_url":"https://syntology.ai/paper/2310.14997","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14997"}},"official":{"repos":["sustcsonglin/TN-PCFG"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/depnecti-dependency-based-nested-compound","slug":"depnecti-dependency-based-nested-compound","title":"DepNeCTI: Dependency-based Nested Compound Type Identification for Sanskrit","date":"2023-10-14","arxiv_id":"2310.09501","repositories_listed":1,"syntology":null},{"url":"/paper/ensemble-distillation-for-unsupervised","slug":"ensemble-distillation-for-unsupervised","title":"Ensemble Distillation for Unsupervised Constituency Parsing","date":"2023-10-03","arxiv_id":"2310.01717","repositories_listed":1,"syntology":{"n":22,"n_ran":16,"n_constructed":2,"n_ran_checked":4,"n_instrument":12,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":22,"phrase":"16 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 12 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/ensemble-distillation-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2310.01717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01717"}},"official":{"repos":["manga-uofa/ed4ucp"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/approximating-cky-with-transformers","slug":"approximating-cky-with-transformers","title":"Approximating CKY with Transformers","date":"2023-05-03","arxiv_id":"2305.02386","repositories_listed":1,"syntology":null},{"url":"/paper/cascading-and-direct-approaches-to","slug":"cascading-and-direct-approaches-to","title":"Cascading and Direct Approaches to Unsupervised Constituency Parsing on Spoken Sentences","date":"2023-03-15","arxiv_id":"2303.08809","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-discontinuous-constituency","slug":"unsupervised-discontinuous-constituency","title":"Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars","date":"2022-12-18","arxiv_id":"2212.09140","repositories_listed":1,"syntology":null},{"url":"/paper/on-parsing-as-tagging","slug":"on-parsing-as-tagging","title":"On Parsing as Tagging","date":"2022-11-14","arxiv_id":"2211.07344","repositories_listed":1,"syntology":null},{"url":"/paper/shift-reduce-task-oriented-semantic-parsing","slug":"shift-reduce-task-oriented-semantic-parsing","title":"Shift-Reduce Task-Oriented Semantic Parsing with Stack-Transformers","date":"2022-10-21","arxiv_id":"2210.11984","repositories_listed":1,"syntology":null},{"url":"/paper/court-judgement-labeling-on-hklii","slug":"court-judgement-labeling-on-hklii","title":"Court Judgement Labeling Using Topic Modeling and Syntactic Parsing","date":"2022-08-03","arxiv_id":"2208.04225","repositories_listed":1,"syntology":null},{"url":"/paper/dadmatools-natural-language-processing","slug":"dadmatools-natural-language-processing","title":"DadmaTools: Natural Language Processing Toolkit for Persian Language","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/treemix-compositional-constituency-based-data","slug":"treemix-compositional-constituency-based-data","title":"TreeMix: Compositional Constituency-based Data Augmentation for Natural Language Understanding","date":"2022-05-12","arxiv_id":"2205.06153","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/treemix-compositional-constituency-based-data#ran","syntology_url":"https://syntology.ai/paper/2205.06153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.06153"}},"official":{"repos":["magiccircuit/treemix"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learned-incremental-representations-for","slug":"learned-incremental-representations-for","title":"Learned Incremental Representations for Parsing","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/nested-named-entity-recognition-as-latent-1","slug":"nested-named-entity-recognition-as-latent-1","title":"Nested Named Entity Recognition as Latent Lexicalized Constituency Parsing","date":"2022-03-09","arxiv_id":"2203.04665","repositories_listed":1,"syntology":null},{"url":"/paper/cptam-constituency-parse-tree-aggregation","slug":"cptam-constituency-parse-tree-aggregation","title":"CPTAM: Constituency Parse Tree Aggregation Method","date":"2022-01-19","arxiv_id":"2201.07905","repositories_listed":1,"syntology":null},{"url":"/paper/bottom-up-constituency-parsing-and-nested","slug":"bottom-up-constituency-parsing-and-nested","title":"Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networks","date":"2021-10-11","arxiv_id":"2110.05419","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-non-local-features-for-neural","slug":"investigating-non-local-features-for-neural","title":"Investigating Non-local Features for Neural Constituency Parsing","date":"2021-09-27","arxiv_id":"2109.12814","repositories_listed":1,"syntology":null},{"url":"/paper/dependency-induction-through-the-lens-of","slug":"dependency-induction-through-the-lens-of","title":"Dependency Induction Through the Lens of Visual Perception","date":"2021-09-20","arxiv_id":"2109.09790","repositories_listed":1,"syntology":null},{"url":"/paper/improved-latent-tree-induction-with-distant","slug":"improved-latent-tree-induction-with-distant","title":"Improved Latent Tree Induction with Distant Supervision via Span Constraints","date":"2021-09-10","arxiv_id":"2109.05112","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/improved-latent-tree-induction-with-distant#ran","syntology_url":"https://syntology.ai/paper/2109.05112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.05112"}},"official":{"repos":["iesl/distantly-supervised-diora"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/elit-emory-language-and-information-toolkit","slug":"elit-emory-language-and-information-toolkit","title":"ELIT: Emory Language and Information Toolkit","date":"2021-09-08","arxiv_id":"2109.03903","repositories_listed":1,"syntology":null},{"url":"/paper/headed-span-based-projective-dependency","slug":"headed-span-based-projective-dependency","title":"Headed-Span-Based Projective Dependency Parsing","date":"2021-08-10","arxiv_id":"2108.04750","repositories_listed":1,"syntology":null},{"url":"/paper/bert-proof-syntactic-structures-investigating","slug":"bert-proof-syntactic-structures-investigating","title":"BERT-Proof Syntactic Structures: Investigating Errors in Discontinuous Constituency Parsing","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/n-ary-constituent-tree-parsing-with-recursive","slug":"n-ary-constituent-tree-parsing-with-recursive","title":"N-ary Constituent Tree Parsing with Recursive Semi-Markov Model","date":"2021-07-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/assessing-the-use-of-prosody-in-constituency","slug":"assessing-the-use-of-prosody-in-constituency","title":"Assessing the Use of Prosody in Constituency Parsing of Imperfect Transcripts","date":"2021-06-14","arxiv_id":"2106.07794","repositories_listed":1,"syntology":null},{"url":"/paper/neural-combinatory-constituency-parsing","slug":"neural-combinatory-constituency-parsing","title":"Neural Combinatory Constituency Parsing","date":"2021-06-12","arxiv_id":"2106.06689","repositories_listed":1,"syntology":null},{"url":"/paper/rule-augmented-unsupervised-constituency","slug":"rule-augmented-unsupervised-constituency","title":"Rule Augmented Unsupervised Constituency Parsing","date":"2021-05-21","arxiv_id":"2105.10193","repositories_listed":1,"syntology":null},{"url":"/paper/learning-syntax-from-naturally-occurring","slug":"learning-syntax-from-naturally-occurring","title":"Learning Syntax from Naturally-Occurring Bracketings","date":"2021-04-28","arxiv_id":"2104.13933","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-syntax-from-naturally-occurring#ran","syntology_url":"https://syntology.ai/paper/2104.13933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.13933"}},"official":{"repos":["tzshi/nob-naacl21"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/nested-named-entity-recognition-with","slug":"nested-named-entity-recognition-with","title":"Nested Named Entity Recognition with Partially-Observed TreeCRFs","date":"2020-12-15","arxiv_id":"2012.08478","repositories_listed":1,"syntology":null},{"url":"/paper/improving-sequence-to-sequence-semantic","slug":"improving-sequence-to-sequence-semantic","title":"Improving Sequence-to-Sequence Semantic Parser for Task Oriented Dialog","date":"2020-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improving-constituency-parsing-with-span","slug":"improving-constituency-parsing-with-span","title":"Improving Constituency Parsing with Span Attention","date":"2020-10-15","arxiv_id":"2010.07543","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/improving-constituency-parsing-with-span#ran","syntology_url":"https://syntology.ai/paper/2010.07543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07543"}},"official":{"repos":["cuhksz-nlp/SAPar"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-tree-learning-with-ordered-neurons","slug":"latent-tree-learning-with-ordered-neurons","title":"Latent Tree Learning with Ordered Neurons: What Parses Does It Produce?","date":"2020-10-10","arxiv_id":"2010.04926","repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-zero-shot-constituency-parsing","slug":"multilingual-zero-shot-constituency-parsing","title":"Multilingual Chart-based Constituency Parse Extraction from Pre-trained Language Models","date":"2020-04-08","arxiv_id":"2004.13805","repositories_listed":1,"syntology":null},{"url":"/paper/span-based-discontinuous-constituency-parsing","slug":"span-based-discontinuous-constituency-parsing","title":"Span-based discontinuous constituency parsing: a family of exact chart-based algorithms with time complexities from O(n^6) down to O(n^3)","date":"2020-03-30","arxiv_id":"2003.13785","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-discourse-constituency-parsing","slug":"unsupervised-discourse-constituency-parsing","title":"Unsupervised Discourse Constituency Parsing Using Viterbi EM","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/cross-domain-generalization-of-neural","slug":"cross-domain-generalization-of-neural","title":"Cross-Domain Generalization of Neural Constituency Parsers","date":"2019-07-09","arxiv_id":"1907.04347","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cross-domain-generalization-of-neural#ran","syntology_url":"https://syntology.ai/paper/1907.04347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04347"}},"official":{"repos":["dpfried/rnng-bert"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/head-driven-phrase-structure-grammar-parsing","slug":"head-driven-phrase-structure-grammar-parsing","title":"Head-Driven Phrase Structure Grammar Parsing on Penn Treebank","date":"2019-07-05","arxiv_id":"1907.02684","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/head-driven-phrase-structure-grammar-parsing#ran","syntology_url":"https://syntology.ai/paper/1907.02684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02684"}},"official":{"repos":["DoodleJZ/HPSG-Neural-Parser"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sequence-labeling-parsing-by-learning-across","slug":"sequence-labeling-parsing-by-learning-across","title":"Sequence Labeling Parsing by Learning Across Representations","date":"2019-07-02","arxiv_id":"1907.01339","repositories_listed":1,"syntology":null},{"url":"/paper/ptb-graph-parsing-with-tree-approximation","slug":"ptb-graph-parsing-with-tree-approximation","title":"PTB Graph Parsing with Tree Approximation","date":"2019-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-latent-tree-induction-with-deep-1","slug":"unsupervised-latent-tree-induction-with-deep-1","title":"Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Auto-Encoders","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/discontinuous-constituency-parsing-with-a","slug":"discontinuous-constituency-parsing-with-a","title":"Discontinuous Constituency Parsing with a Stack-Free Transition System and a Dynamic Oracle","date":"2019-04-01","arxiv_id":"1904.00615","repositories_listed":1,"syntology":null},{"url":"/paper/unlexicalized-transition-based-discontinuous","slug":"unlexicalized-transition-based-discontinuous","title":"Unlexicalized Transition-based Discontinuous Constituency Parsing","date":"2019-02-24","arxiv_id":"1902.08912","repositories_listed":1,"syntology":null},{"url":"/paper/direct-output-connection-for-a-high-rank","slug":"direct-output-connection-for-a-high-rank","title":"Direct Output Connection for a High-Rank Language Model","date":"2018-08-30","arxiv_id":"1808.10143","repositories_listed":1,"syntology":null},{"url":"/paper/grammar-induction-with-neural-language-models","slug":"grammar-induction-with-neural-language-models","title":"Grammar Induction with Neural Language Models: An Unusual Replication","date":"2018-08-29","arxiv_id":"1808.10000","repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-study-of-building-a-strong","slug":"an-empirical-study-of-building-a-strong","title":"An Empirical Study of Building a Strong Baseline for Constituency Parsing","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gaussian-mixture-latent-vector-grammars","slug":"gaussian-mixture-latent-vector-grammars","title":"Gaussian Mixture Latent Vector Grammars","date":"2018-05-12","arxiv_id":"1805.04688","repositories_listed":1,"syntology":null},{"url":"/paper/whats-going-on-in-neural-constituency-parsers","slug":"whats-going-on-in-neural-constituency-parsers","title":"What's Going On in Neural Constituency Parsers? An Analysis","date":"2018-04-20","arxiv_id":"1804.07853","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/whats-going-on-in-neural-constituency-parsers#ran","syntology_url":"https://syntology.ai/paper/1804.07853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07853"}},"official":{"repos":["dgaddy/parser-analysis"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/parsing-with-traces-an-on4-algorithm-and-a-1","slug":"parsing-with-traces-an-on4-algorithm-and-a-1","title":"Parsing with Traces: An $O(n^4)$ Algorithm and a Structural Representation","date":"2017-07-13","arxiv_id":"1707.04221","repositories_listed":1,"syntology":null},{"url":"/paper/multilingual-lexicalized-constituency-parsing","slug":"multilingual-lexicalized-constituency-parsing","title":"Multilingual Lexicalized Constituency Parsing with Word-Level Auxiliary Tasks","date":"2017-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/span-based-constituency-parsing-with-a","slug":"span-based-constituency-parsing-with-a","title":"Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles","date":"2016-12-20","arxiv_id":"1612.06475","repositories_listed":1,"syntology":null},{"url":"/paper/what-do-recurrent-neural-network-grammars","slug":"what-do-recurrent-neural-network-grammars","title":"What Do Recurrent Neural Network Grammars Learn About Syntax?","date":"2016-11-17","arxiv_id":"1611.05774","repositories_listed":1,"syntology":null},{"url":"/paper/parsing-as-language-modeling","slug":"parsing-as-language-modeling","title":"Parsing as Language Modeling","date":"2016-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-graph-based-dependency-parsing","slug":"probabilistic-graph-based-dependency-parsing","title":"Probabilistic Graph-based Dependency Parsing with Convolutional Neural Network","date":"2016-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/should-have-would-have-could-have","slug":"should-have-would-have-could-have","title":"Should Have, Would Have, Could Have. Investigating Verb Group Representations for Parsing with Universal Dependencies.","date":"2016-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/syntactic-parse-fusion","slug":"syntactic-parse-fusion","title":"Syntactic Parse Fusion","date":"2015-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/less-grammar-more-features","slug":"less-grammar-more-features","title":"Less Grammar, More Features","date":"2014-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/effective-self-training-for-parsing","slug":"effective-self-training-for-parsing","title":"Effective Self-Training for Parsing","date":"2006-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"revisiting-absence-withsymptoms-that-t-show","title":"Revisiting Absence withSymptoms that *T* Show up Decades Later to Recover Empty Categories","date":"2024-12-02","arxiv_id":"2412.01109","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-attempt-to-develop-a-neural-parser-based","title":"An Attempt to Develop a Neural Parser based on Simplified Head-Driven Phrase Structure Grammar on Vietnamese","date":"2024-11-26","arxiv_id":"2411.17270","repositories_listed":0,"syntology":null},{"url":null,"slug":"entity-aware-biaffine-attention-model-for","title":"Entity-Aware Biaffine Attention Model for Improved Constituent Parsing with Reduced Entity Violations","date":"2024-09-01","arxiv_id":"2409.00625","repositories_listed":0,"syntology":null},{"url":null,"slug":"jp-evalb-robust-alignment-based-parseval","title":"jp-evalb: Robust Alignment-based PARSEVAL Measures","date":"2024-05-23","arxiv_id":"2405.14150","repositories_listed":0,"syntology":null},{"url":null,"slug":"constituents-correspond-to-word-sequence","title":"Unsupervised Parsing by Searching for Frequent Word Sequences among Sentences with Equivalent Predicate-Argument Structures","date":"2024-04-18","arxiv_id":"2404.12059","repositories_listed":0,"syntology":null},{"url":null,"slug":"targeted-aspect-based-emotion-analysis-to","title":"Targeted aspect-based emotion analysis to detect opportunities and precaution in financial Twitter messages","date":"2024-03-30","arxiv_id":"2404.08665","repositories_listed":0,"syntology":null},{"url":null,"slug":"constituency-parsing-using-llms","title":"Constituency Parsing using LLMs","date":"2023-10-30","arxiv_id":"2310.19462","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffcloth-diffusion-based-garment-synthesis","title":"DiffCloth: Diffusion Based Garment Synthesis and Manipulation via Structural Cross-modal Semantic Alignment","date":"2023-08-22","arxiv_id":"2308.11206","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-lingual-constituency-parsing-for-middle","title":"Cross-Lingual Constituency Parsing for Middle High German: A Delexicalized Approach","date":"2023-08-09","arxiv_id":"2308.04645","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-transformers-parse-while-predicting-the","title":"Do Transformers Parse while Predicting the Masked Word?","date":"2023-03-14","arxiv_id":"2303.08117","repositories_listed":0,"syntology":null},{"url":null,"slug":"does-unsupervised-grammar-induction-need","title":"Re-evaluating the Need for Multimodal Signals in Unsupervised Grammar Induction","date":"2022-12-20","arxiv_id":"2212.10564","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-rule-based-decoding-revisiting-syntactic","title":"Fast Rule-Based Decoding: Revisiting Syntactic Rules in Neural Constituency Parsing","date":"2022-12-16","arxiv_id":"2212.08458","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-chinese-word-segmentation-and-span","title":"Joint Chinese Word Segmentation and Span-based Constituency Parsing","date":"2022-11-03","arxiv_id":"2211.01638","repositories_listed":0,"syntology":null},{"url":null,"slug":"order-sensitive-neural-constituency-parsing","title":"Order-sensitive Neural Constituency Parsing","date":"2022-11-01","arxiv_id":"2211.00421","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-low-resource-rrg-parsing-with-cross","title":"Improving Low-resource RRG Parsing with Cross-lingual Self-training","date":"2022-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-warm-start-and-a-clean-crawled-corpus-a-1","title":"A Warm Start and a Clean Crawled Corpus - A Recipe for Good Language Models","date":"2022-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"grammarshap-an-efficient-model-agnostic-and","title":"GrammarSHAP: An Efficient Model-Agnostic and Structure-Aware NLP Explainer","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"phrase-aware-unsupervised-constituency-1","title":"Phrase-aware Unsupervised Constituency Parsing","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"word-segmentation-as-unsupervised","title":"Word Segmentation as Unsupervised Constituency Parsing","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":25,"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":24,"papers_where_code_ran_first_page":"/task/constituency-parsing/papers/ran/1","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":[{"order":"archive","page":2,"of":3,"url":"/task/constituency-parsing/papers/2","json":"/task/constituency-parsing/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/task/constituency-parsing/papers/3","json":"/task/constituency-parsing/papers/3.json","rows":4},{"order":"ran","page":1,"of":1,"url":"/task/constituency-parsing/papers/ran/1","json":"/task/constituency-parsing/papers/ran/1.json","rows":24}],"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":"44f822618f4245f1088ebe1796b1f0b10836906613aadfc88e99291edfcd9645","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}