{"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/lemma/papers/6","list_of":"/task/lemma","task":"LEMMA","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":6,"pages_in_order":7,"rows_per_page":100,"rows":[501,600],"of":628,"counts":{"archive_papers_tagged":628,"with_a_code_link":102,"where_syntology_ran_a_sample":18,"not_listed_spam_title":0,"listed":628,"listed_where_code_ran":18,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/lemma","prev":"/task/lemma/papers/5","next":"/task/lemma/papers/7","papers":[{"url":null,"slug":"universal-lemmatizer-a-sequence-to-sequence","title":"Universal Lemmatizer: A Sequence to Sequence Model for Lemmatizing Universal Dependencies Treebanks","date":"2019-02-03","arxiv_id":"1902.00972","repositories_listed":0,"syntology":null},{"url":null,"slug":"dtn-a-learning-rate-scheme-with-convergence","title":"DTN: A Learning Rate Scheme with Convergence Rate of $\\mathcal{O}(1/t)$ for SGD","date":"2019-01-22","arxiv_id":"1901.07634","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-many-samples-are-needed-to-estimate-a-1","title":"How Many Samples are Needed to Estimate a Convolutional Neural Network?","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-structure-of-optimal-private-tests-for","title":"The Structure of Optimal Private Tests for Simple Hypotheses","date":"2018-11-27","arxiv_id":"1811.11148","repositories_listed":0,"syntology":null},{"url":null,"slug":"stackelberg-gan-towards-provable-minimax","title":"Stackelberg GAN: Towards Provable Minimax Equilibrium via Multi-Generator Architectures","date":"2018-11-19","arxiv_id":"1811.08010","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-dimension-reduction-via-outer-bi","title":"Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions","date":"2018-11-08","arxiv_id":"1811.03591","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-bayes-inference-in-digital","title":"Variational Bayes Inference in Digital Receivers","date":"2018-11-03","arxiv_id":"1811.02506","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-terminal-dimensionality-reduction-in","title":"Optimal terminal dimensionality reduction in Euclidean space","date":"2018-10-22","arxiv_id":"1810.09250","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-conll-sigmorphon-2018-shared-task","title":"The CoNLL--SIGMORPHON 2018 Shared Task: Universal Morphological Reinflection","date":"2018-10-16","arxiv_id":"1810.07125","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-clustering","title":"A Unified Framework for Clustering Constrained Data without Locality Property","date":"2018-10-02","arxiv_id":"1810.01049","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-new-results-about-quantum-exact-learning","title":"Two new results about quantum exact learning","date":"2018-09-30","arxiv_id":"1810.00481","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-concentration-inequality-for-vector","title":"A note on concentration inequality for vector-valued martingales with weak exponential-type tails","date":"2018-09-06","arxiv_id":"1809.02495","repositories_listed":0,"syntology":null},{"url":null,"slug":"copenhagen-at-conll-sigmorphon-2018","title":"Copenhagen at CoNLL--SIGMORPHON 2018: Multilingual Inflection in Context with Explicit Morphosyntactic Decoding","date":"2018-09-05","arxiv_id":"1809.01541","repositories_listed":0,"syntology":null},{"url":null,"slug":"certified-mapper-repeated-testing-for","title":"Certified Mapper: Repeated testing for acyclicity and obstructions to the nerve lemma","date":"2018-08-29","arxiv_id":"1808.09933","repositories_listed":0,"syntology":null},{"url":null,"slug":"madari-a-web-interface-for-joint-arabic","title":"MADARi: A Web Interface for Joint Arabic Morphological Annotation and Spelling Correction","date":"2018-08-25","arxiv_id":"1808.08392","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximation-schemes-for-low-rank-binary","title":"Approximation Schemes for Low-Rank Binary Matrix Approximation Problems","date":"2018-07-18","arxiv_id":"1807.07156","repositories_listed":0,"syntology":null},{"url":null,"slug":"character-level-supervision-for-low-resource","title":"Character-level Supervision for Low-resource POS Tagging","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nilc-swornemo-at-the-surface-realization","title":"NILC-SWORNEMO at the Surface Realization Shared Task: Exploring Syntax-Based Word Ordering using Neural Models","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sauer-shelah-perles-lemma-for-sumsets","title":"A Sauer-Shelah-Perles Lemma for Sumsets","date":"2018-06-14","arxiv_id":"1806.05737","repositories_listed":0,"syntology":null},{"url":null,"slug":"teamdl-at-semeval-2018-task-8-cybersecurity","title":"TeamDL at SemEval-2018 Task 8: Cybersecurity Text Analysis using Convolutional Neural Network and Conditional Random Fields","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"how-many-samples-are-needed-to-estimate-a","title":"How Many Samples are Needed to Estimate a Convolutional or Recurrent Neural Network?","date":"2018-05-21","arxiv_id":"1805.07883","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressed-dictionary-learning","title":"Compressed Dictionary Learning","date":"2018-05-02","arxiv_id":"1805.00692","repositories_listed":0,"syntology":null},{"url":null,"slug":"n-fold-superposition-improving-neural","title":"N-fold Superposition: Improving Neural Networks by Reducing the Noise in Feature Maps","date":"2018-04-23","arxiv_id":"1804.08233","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-aware-regret-bounds-for-undiscounted","title":"Variance-Aware Regret Bounds for Undiscounted Reinforcement Learning in MDPs","date":"2018-03-05","arxiv_id":"1803.01626","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-morphological-tagging-of-lemma","title":"Neural Morphological Tagging of Lemma Sequences for Machine Translation","date":"2018-03-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"estimator-of-prediction-error-based-on","title":"Estimator of Prediction Error Based on Approximate Message Passing for Penalized Linear Regression","date":"2018-02-20","arxiv_id":"1802.06939","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizing-bottleneck-problems","title":"Generalizing Bottleneck Problems","date":"2018-02-16","arxiv_id":"1802.05861","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-vertex-sample-complexity-of-free-energy","title":"The Vertex Sample Complexity of Free Energy is Polynomial","date":"2018-02-16","arxiv_id":"1802.06129","repositories_listed":0,"syntology":null},{"url":null,"slug":"rigorous-restricted-isometry-property-of-low","title":"Rigorous Restricted Isometry Property of Low-Dimensional Subspaces","date":"2018-01-30","arxiv_id":"1801.10058","repositories_listed":0,"syntology":null},{"url":null,"slug":"grammatical-role-embeddings-for-enhancements","title":"Grammatical Role Embeddings for Enhancements of Relation Density in the Princeton WordNet","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-high-dimensional-non-gaussian","title":"Estimating High-dimensional Non-Gaussian Multiple Index Models via Stein’s Lemma","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"arbitrage-and-geometry","title":"Arbitrage and Geometry","date":"2017-09-21","arxiv_id":"1709.07446","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-extensible-multilingual-open-source","title":"An Extensible Multilingual Open Source Lemmatizer","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cic-fbk-approach-to-native-language","title":"CIC-FBK Approach to Native Language Identification","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inflection-generation-for-spanish-verbs-using","title":"Inflection Generation for Spanish Verbs using Supervised Learning","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizations-of-szpilrajn-s-theorem-in","title":"Generalizations of Szpilrajn's Theorem in economic and game theories","date":"2017-08-15","arxiv_id":"1708.04711","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-non-gaussian-single-index","title":"High-dimensional Non-Gaussian Single Index Models via Thresholded Score Function Estimation","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sense-contextualization-in-a-dependency-based","title":"Sense Contextualization in a Dependency-Based Compositional Distributional Model","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-target-side-inflection-in-neural","title":"Modeling Target-Side Inflection in Neural Machine Translation","date":"2017-07-19","arxiv_id":"1707.06012","repositories_listed":0,"syntology":null},{"url":null,"slug":"align-and-copy-uzh-at-sigmorphon-2017-shared","title":"Align and Copy: UZH at SIGMORPHON 2017 Shared Task for Morphological Reinflection","date":"2017-07-05","arxiv_id":"1707.01355","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-geometric-concepts-with-nasty-noise","title":"Learning Geometric Concepts with Nasty Noise","date":"2017-07-05","arxiv_id":"1707.01242","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-sensitive-lemmatization-using-two","title":"Context Sensitive Lemmatization Using Two Successive Bidirectional Gated Recurrent Networks","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"conll-sigmorphon-2017-shared-task-universal","title":"CoNLL-SIGMORPHON 2017 Shared Task: Universal Morphological Reinflection in 52 Languages","date":"2017-06-27","arxiv_id":"1706.09031","repositories_listed":0,"syntology":null},{"url":null,"slug":"restricted-isometry-property-of-gaussian","title":"Restricted Isometry Property of Gaussian Random Projection for Finite Set of Subspaces","date":"2017-04-07","arxiv_id":"1704.02109","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometry-of-policy-improvement","title":"Geometry of Policy Improvement","date":"2017-04-06","arxiv_id":"1704.01785","repositories_listed":0,"syntology":null},{"url":null,"slug":"gender-profiling-for-slovene-twitter","title":"Gender Profiling for Slovene Twitter communication: the Influence of Gender Marking, Content and Style","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"morphological-analysis-without-expert","title":"Morphological Analysis without Expert Annotation","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-compound-splitting-for-german","title":"Simple Compound Splitting for German","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"supervised-and-unsupervised-approaches-to","title":"Supervised and unsupervised approaches to measuring usage similarity","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-shot-neural-cross-lingual-transfer-for","title":"One-Shot Neural Cross-Lingual Transfer for Paradigm Completion","date":"2017-03-31","arxiv_id":"1704.00052","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-source-identification-game-with","title":"Adversarial Source Identification Game with Corrupted Training","date":"2017-03-27","arxiv_id":"1703.09244","repositories_listed":0,"syntology":null},{"url":null,"slug":"microstructure-under-the-microscope-tools-to","title":"Microstructure under the Microscope: Tools to Survive and Thrive in The Age of (Too Much) Information","date":"2017-03-26","arxiv_id":"1703.08812","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-interplay-between-strong-regularity","title":"On the Interplay between Strong Regularity and Graph Densification","date":"2017-03-21","arxiv_id":"1703.07107","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-friendly-set-version-of","title":"Machine Learning Friendly Set Version of Johnson-Lindenstrauss Lemma","date":"2017-03-04","arxiv_id":"1703.01507","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-homological-theory-of-functions","title":"A Homological Theory of Functions","date":"2017-01-09","arxiv_id":"1701.02302","repositories_listed":0,"syntology":null},{"url":null,"slug":"son-of-zorns-lemma-targeted-style-transfer","title":"Son of Zorn's Lemma: Targeted Style Transfer Using Instance-aware Semantic Segmentation","date":"2017-01-09","arxiv_id":"1701.02357","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-scalable-document-based-architecture-for","title":"A Scalable Document-based Architecture for Text Analysis","date":"2016-12-19","arxiv_id":"1612.06195","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-multi-source-morphological","title":"Neural Multi-Source Morphological Reinflection","date":"2016-12-19","arxiv_id":"1612.06027","repositories_listed":0,"syntology":null},{"url":null,"slug":"confarm-extracting-surface-representations-of","title":"ConFarm: Extracting Surface Representations of Verb and Noun Constructions from Dependency Annotated Corpora of Russian","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"factored-neural-machine-translation-1","title":"Factored Neural Machine Translation Architectures","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"quantized-random-projections-and-non-linear","title":"Quantized Random Projections and Non-Linear Estimation of Cosine Similarity","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-power-of-language-music-arabic","title":"The Power of Language Music: Arabic Lemmatization through Patterns","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"conspiracies-between-learning-algorithms","title":"Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness","date":"2016-11-03","arxiv_id":"1611.01190","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-counting-the-lovasz-local-lemma","title":"Approximate Counting, the Lovasz Local Lemma and Inference in Graphical Models","date":"2016-10-14","arxiv_id":"1610.04317","repositories_listed":0,"syntology":null},{"url":null,"slug":"revealing-structure-in-large-graphs","title":"Revealing Structure in Large Graphs: Szemerédi's Regularity Lemma and its Use in Pattern Recognition","date":"2016-09-21","arxiv_id":"1609.06583","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-guarantees-for-estimating-the","title":"Statistical Guarantees for Estimating the Centers of a Two-component Gaussian Mixture by EM","date":"2016-08-07","arxiv_id":"1608.02280","repositories_listed":0,"syntology":null},{"url":null,"slug":"deleting-and-testing-forbidden-patterns-in","title":"Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays","date":"2016-07-13","arxiv_id":"1607.03961","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-burer-monteiro-factorization-for-a","title":"Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems","date":"2016-06-04","arxiv_id":"1606.01316","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-finite-state-morphological-analyser-for-1","title":"A Finite-State Morphological Analyser for Sindhi","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neural-lemmatizer-for-bengali","title":"A Neural Lemmatizer for Bengali","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-arabic-diacritization-for-high","title":"Exploiting Arabic Diacritization for High Quality Automatic Annotation","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"new-inflectional-lexicons-and-training","title":"New Inflectional Lexicons and Training Corpora for Improved Morphosyntactic Annotation of Croatian and Serbian","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"qtleap-wsdned-corpora-semantic-annotation-of","title":"QTLeap WSD/NED Corpora: Semantic Annotation of Parallel Corpora in Six Languages","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rule-based-automatic-multi-word-term","title":"Rule-based Automatic Multi-word Term Extraction and Lemmatization","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"tgermacorp-a-digital-humanities-resource-for","title":"TGermaCorp -- A (Digital) Humanities Resource for (Computational) Linguistics","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"vps-gradeup-graded-decisions-on-usage","title":"VPS-GradeUp: Graded Decisions on Usage Patterns","date":"2016-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"random-projection-estimation-of-discrete","title":"Random Projection Estimation of Discrete-Choice Models with Large Choice Sets","date":"2016-04-20","arxiv_id":"1604.06036","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-preference-orders-and-their","title":"Conditional Preference Orders and their Numerical Representations","date":"2016-01-18","arxiv_id":"1410.5466","repositories_listed":0,"syntology":null},{"url":null,"slug":"wordnet-and-beyond-the-case-of-lexical-access","title":"WordNet and beyond: the case of lexical access","date":"2016-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-relation-between-two-rotation-metrics","title":"On the Relation between two Rotation Metrics","date":"2015-12-14","arxiv_id":"1512.04219","repositories_listed":0,"syntology":null},{"url":null,"slug":"newton-stein-method-a-second-order-method-for","title":"Newton-Stein Method: A Second Order Method for GLMs via Stein's Lemma","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-adaptive-group-testing-on-graphs","title":"Non-adaptive Group Testing on Graphs","date":"2015-11-30","arxiv_id":"1511.09196","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-nearest-neighbour-classification-of","title":"k-Nearest Neighbour Classification of Datasets with a Family of Distances","date":"2015-11-29","arxiv_id":"1512.00001","repositories_listed":0,"syntology":null},{"url":null,"slug":"newton-stein-method-an-optimization-method","title":"Newton-Stein Method: An optimization method for GLMs via Stein's Lemma","date":"2015-11-28","arxiv_id":"1511.08895","repositories_listed":0,"syntology":null},{"url":null,"slug":"super-linear-gate-and-super-quadratic-wire","title":"Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits","date":"2015-11-24","arxiv_id":"1511.07860","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-embeddings-with-structured-hashed","title":"Binary embeddings with structured hashed projections","date":"2015-11-16","arxiv_id":"1511.05212","repositories_listed":0,"syntology":null},{"url":null,"slug":"polish-english-speech-statistical-machine","title":"Polish - English Speech Statistical Machine Translation Systems for the IWSLT 2014","date":"2015-09-29","arxiv_id":"1509.08874","repositories_listed":0,"syntology":null},{"url":null,"slug":"neyman-pearson-classification-under-high","title":"Neyman-Pearson Classification under High-Dimensional Settings","date":"2015-08-13","arxiv_id":"1508.03106","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-can-dictionary-learning-uniquely-recover","title":"When can dictionary learning uniquely recover sparse data from subsamples?","date":"2015-07-31","arxiv_id":"1106.3616","repositories_listed":0,"syntology":null},{"url":null,"slug":"keyphrase-based-evaluation-of-automatic-text","title":"Keyphrase Based Evaluation of Automatic Text Summarization","date":"2015-05-22","arxiv_id":"1505.06228","repositories_listed":0,"syntology":null},{"url":null,"slug":"inflection-generation-as-discriminative","title":"Inflection Generation as Discriminative String Transduction","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reserating-the-awesometastic-an-automatic","title":"Reserating the awesometastic: An automatic extension of the WordNet taxonomy for novel terms","date":"2015-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"syntagma-lexical-database","title":"Syntagma Lexical Database","date":"2015-03-19","arxiv_id":"1503.05907","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-consistency-lemma-in-statistical","title":"A consistency lemma in statistical phylogenetics","date":"2015-01-26","arxiv_id":"1501.06623","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-financing-trading-and-the-ito-doeblin","title":"Self-Financing Trading and the Ito-Doeblin Lemma","date":"2015-01-12","arxiv_id":"1501.02750","repositories_listed":0,"syntology":null},{"url":null,"slug":"size-sensitive-packing-number-for-hamming","title":"Size sensitive packing number for Hamming cube and its consequences","date":"2014-12-12","arxiv_id":"1412.3922","repositories_listed":0,"syntology":null},{"url":null,"slug":"risk-estimation-without-using-steins-lemma","title":"Risk Estimation Without Using Stein's Lemma -- Application to Image Denoising","date":"2014-12-06","arxiv_id":"1412.2210","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-and-stochastic-gradient-methods-for","title":"Online and Stochastic Gradient Methods for Non-decomposable Loss Functions","date":"2014-10-24","arxiv_id":"1410.6776","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-reduction-of-affine","title":"Dimensionality Reduction of Affine Variational Inequalities Using Random Projections","date":"2014-08-20","arxiv_id":"1408.4551","repositories_listed":0,"syntology":null},{"url":null,"slug":"zipfs-law-for-word-frequencies-word-forms","title":"Zipf's law for word frequencies: word forms versus lemmas in long texts","date":"2014-07-31","arxiv_id":"1407.8322","repositories_listed":0,"syntology":null}],"record_sha256":"9ce38dc09b71a50635c21b8527e7b366bc2d1512ddd826b7d5c120eee8819bdf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}