{"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/structured-prediction/papers/7","list_of":"/task/structured-prediction","task":"Structured Prediction","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":7,"pages_in_order":7,"rows_per_page":100,"rows":[601,639],"of":639,"counts":{"archive_papers_tagged":639,"with_a_code_link":195,"where_syntology_ran_a_sample":43,"not_listed_spam_title":0,"listed":639,"listed_where_code_ran":43,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":34,"listed_every_run_a_failure_of_syntologys_instrument":9,"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"},"first_page":"/task/structured-prediction","prev":"/task/structured-prediction/papers/6","next":null,"papers":[{"url":null,"slug":"part-based-visual-tracking-with-online-latent","title":"Part-Based Visual Tracking with Online Latent Structural Learning","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-coordinate-descent-algorithms-for","title":"Dual Coordinate Descent Algorithms for Efficient Large Margin Structured Prediction","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"o-reconhecimento-de-entidades-nomeadas-por","title":"O Reconhecimento de Entidades Nomeadas por meio de Conditional Random Fields para a L\\'\\ingua Portuguesa (Named Entity Recognition with Conditional Random Fields for the Portuguese Language) [in Portuguese]","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"parsing-models-for-identifying-multiword","title":"Parsing Models for Identifying Multiword Expressions","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-joint-phrasal-and-dependency-model-for","title":"A Joint Phrasal and Dependency Model for Paraphrase Alignment","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cocktail-party-processing-via-structured","title":"Cocktail Party Processing via Structured Prediction","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"blending-learning-and-inference-in-structured","title":"Blending Learning and Inference in Structured Prediction","date":"2012-10-08","arxiv_id":"1210.2346","repositories_listed":0,"syntology":null},{"url":null,"slug":"forest-reranking-through-subtree-ranking","title":"Forest Reranking through Subtree Ranking","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-amortizing-inference-cost-for-structured","title":"On Amortizing Inference Cost for Structured Prediction","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"parse-price-and-cut-delayed-column-and-row","title":"Parse, Price and Cut---Delayed Column and Row Generation for Graph Based Parsers","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"utilizing-dependency-language-models-for","title":"Utilizing Dependency Language Models for Graph-based Dependency Parsing Models","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"findings-of-the-2012-workshop-on-statistical","title":"Findings of the 2012 Workshop on Statistical Machine Translation","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-lexicon-expansion-with-sparsity","title":"Graph-Based Lexicon Expansion with Sparsity-Inducing Penalties","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"minimum-risk-training-of-approximate-crf","title":"Minimum-Risk Training of Approximate CRF-Based NLP Systems","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-strategies-for-online-large","title":"Optimization Strategies for Online Large-Margin Learning in Machine Translation","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-structures-in-nlp-constrained","title":"Predicting Structures in NLP: Constrained Conditional Models and Integer Linear Programming in NLP","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-perceptron-with-inexact-search","title":"Structured Perceptron with Inexact Search","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-on-an-approximate","title":"Unsupervised Learning on an Approximate Corpus","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"vine-pruning-for-efficient-multi-pass","title":"Vine Pruning for Efficient Multi-Pass Dependency Parsing","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"language-classification-and-segmentation-of","title":"Language Classification and Segmentation of Noisy Documents in Hebrew Scripts","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"large-margin-learning-of-submodular","title":"Large-Margin Learning of Submodular Summarization Models","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"book-review-linguistic-structure-prediction","title":"Book Review: Linguistic Structure Prediction by Noah A. Smith","date":"2012-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-margin-multi-label-structured","title":"Maximum Margin Multi-Label Structured Prediction","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"object-detection-with-grammar-models","title":"Object Detection with Grammar Models","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-multi-template-learning-for","title":"Efficient Multi-Template Learning for Structured Prediction","date":"2011-03-04","arxiv_id":"1103.0890","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-primal-dual-message-passing-algorithm-for","title":"A Primal-Dual Message-Passing Algorithm for Approximated Large Scale Structured Prediction","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-loss-minimization-for-structured","title":"Direct Loss Minimization for Structured Prediction","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"energy-disaggregation-via-discriminative","title":"Energy Disaggregation via Discriminative Sparse Coding","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-spatial-layout-of-rooms-using","title":"Estimating Spatial Layout of Rooms using Volumetric Reasoning about Objects and Surfaces","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sidestepping-intractable-inference-with","title":"Sidestepping Intractable Inference with Structured Ensemble Cascades","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-introduction-to-conditional-random-fields","title":"An Introduction to Conditional Random Fields","date":"2010-11-17","arxiv_id":"1011.4088","repositories_listed":0,"syntology":null},{"url":"/paper/twin-gaussian-processes-for-structured","slug":"twin-gaussian-processes-for-structured","title":"Twin gaussian processes for structured prediction","date":"2010-03-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rate-distortion-approach-for-semi","title":"A Rate Distortion Approach for Semi-Supervised Conditional Random Fields","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"search-based-structured-prediction","title":"Search-based Structured Prediction","date":"2009-07-04","arxiv_id":"0907.0786","repositories_listed":0,"syntology":null},{"url":null,"slug":"partially-observed-maximum-entropy","title":"Partially Observed Maximum Entropy Discrimination Markov Networks","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-near-isometric-matching-via-structured","title":"Robust Near-Isometric Matching via Structured Learning of Graphical Models","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-ranking-learning-using-cumulative","title":"Structured ranking learning using cumulative distribution networks","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tighter-bounds-for-structured-estimation","title":"Tighter Bounds for Structured Estimation","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-multiple-hyperparameter-learning","title":"Efficient multiple hyperparameter learning for log-linear models","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"3caf4ba339aa1a10a8d18d12196997402de3d2d2cb4f22e05425a8039e960252","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}