{"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/5","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":5,"pages_in_order":7,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/lemma/papers/6","papers":[{"url":null,"slug":"variance-aware-confidence-set-variance","title":"Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP","date":"2021-01-29","arxiv_id":"2101.12745","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-the-representation-power-of-ghhs","title":"A Note on the Representation Power of GHHs","date":"2021-01-27","arxiv_id":"2101.11286","repositories_listed":0,"syntology":null},{"url":null,"slug":"trading-transforms-of-non-weighted-simple","title":"Trading Transforms of Non-weighted Simple Games and Integer Weights of Weighted Simple Games","date":"2021-01-19","arxiv_id":"2101.07621","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-the-price-of-bandit-feedback-for","title":"A note on the price of bandit feedback for mistake-bounded online learning","date":"2021-01-18","arxiv_id":"2101.06891","repositories_listed":0,"syntology":null},{"url":null,"slug":"creating-domain-dependent-turkish-wordnet-and","title":"Creating Domain Dependent Turkish WordNet and SentiNet","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"discriminating-homonymy-from-polysemy-in","title":"Discriminating Homonymy from Polysemy in Wordnets: English, Spanish and Polish Nouns","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"likelihood-ratio-exponential-families","title":"Likelihood Ratio Exponential Families","date":"2020-12-31","arxiv_id":"2012.15480","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-graded-semantics-of-abstract-argumentation","title":"More on extension-based semantics of argumentation","date":"2020-12-19","arxiv_id":"2012.10592","repositories_listed":0,"syntology":null},{"url":null,"slug":"individually-conditional-individual-mutual","title":"Individually Conditional Individual Mutual Information Bound on Generalization Error","date":"2020-12-17","arxiv_id":"2012.09922","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-interlinear-glossing-for-under","title":"Automatic Interlinear Glossing for Under-Resourced Languages Leveraging Translations","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-translation-of-complex-english","title":"Automatic Translation of Complex English Sentences to Indian Sign Language Synthetic Video Animations","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"utilizing-subword-entities-in-character-level","title":"Utilizing Subword Entities in Character-Level Sequence-to-Sequence Lemmatization Models","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"functions-that-preserve-manhattan-distances","title":"Metric Transforms and Low Rank Matrices via Representation Theory of the Real Hyperrectangle","date":"2020-11-23","arxiv_id":"2011.11503","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-likelihood-ratio-based-detector-for-qtms","title":"A Likelihood Ratio-Based Detector for QTMS Radar and Noise Radar","date":"2020-11-18","arxiv_id":"2011.09509","repositories_listed":0,"syntology":null},{"url":null,"slug":"bottleneck-problems-information-and","title":"Bottleneck Problems: Information and Estimation-Theoretic View","date":"2020-11-12","arxiv_id":"2011.06208","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-cost-of-privacy-in-generalized-linear","title":"The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds","date":"2020-11-08","arxiv_id":"2011.03900","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-likelihood-estimation-in-data-driven","title":"Maximum Likelihood Estimation in Data-Driven Modeling and Control","date":"2020-11-02","arxiv_id":"2011.00925","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-elliptical-potential-lemma-revisited","title":"The Elliptical Potential Lemma Revisited","date":"2020-10-20","arxiv_id":"2010.10182","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-stochastic-linear-combination-of","title":"Estimating Stochastic Linear Combination of Non-linear Regressions Efficiently and Scalably","date":"2020-10-19","arxiv_id":"2010.09265","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-stationary-stochastic-global-optimization","title":"Non-Stationary Stochastic Global Optimization Algorithms","date":"2020-10-11","arxiv_id":"2010.05343","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-languages-in-the-limit-from-positive","title":"Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes","date":"2020-10-09","arxiv_id":"2010.04782","repositories_listed":0,"syntology":null},{"url":null,"slug":"debreu-s-open-gap-lemma-for-semiorders","title":"Debreu's open gap lemma for semiorders","date":"2020-10-01","arxiv_id":"2010.04265","repositories_listed":0,"syntology":null},{"url":null,"slug":"correction-to-position-estimation-from","title":"Correction to:\"Position estimation from direction or range measurements\"","date":"2020-09-24","arxiv_id":"2009.06278","repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-of-explainable-machine-learning-with","title":"Survey of explainable machine learning with visual and granular methods beyond quasi-explanations","date":"2020-09-21","arxiv_id":"2009.10221","repositories_listed":0,"syntology":null},{"url":null,"slug":"certifying-confidence-via-randomized","title":"Certifying Confidence via Randomized Smoothing","date":"2020-09-17","arxiv_id":"2009.08061","repositories_listed":0,"syntology":null},{"url":null,"slug":"linguistically-inspired-morphological","title":"Linguistically inspired morphological inflection with a sequence to sequence model","date":"2020-09-04","arxiv_id":"2009.02073","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-analysis-of-johnson-lindenstrauss","title":"Simple Analysis of Johnson-Lindenstrauss Transform under Neuroscience Constraints","date":"2020-08-20","arxiv_id":"2008.08857","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-adaptive-line-search-for","title":"Stochastic Adaptive Line Search for Differentially Private Optimization","date":"2020-08-18","arxiv_id":"2008.07978","repositories_listed":0,"syntology":null},{"url":null,"slug":"leverage-point-identification-method-for-lav","title":"Leverage Point Identification Method for LAV-Based State Estimation","date":"2020-08-10","arxiv_id":"2008.03941","repositories_listed":0,"syntology":null},{"url":null,"slug":"verifying-tight-logic-programs-with-anthem","title":"Verifying Tight Logic Programs with anthem and Vampire","date":"2020-08-05","arxiv_id":"2008.02025","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-disambiguation-of-lemma-and-part-of-1","title":"Neural disambiguation of lemma and part of speech in morphologically rich languages","date":"2020-07-12","arxiv_id":"2007.06104","repositories_listed":0,"syntology":null},{"url":null,"slug":"clubert-a-cluster-based-approach-for-learning","title":"CluBERT: A Cluster-Based Approach for Learning Sense Distributions in Multiple Languages","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ku-cst-at-the-sigmorphon-2020-task-2-on","title":"KU-CST at the SIGMORPHON 2020 Task 2 on Unsupervised Morphological Paradigm Completion","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-principal-parts-for-morphological","title":"Leveraging Principal Parts for Morphological Inflection","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-size-fits-all-multilingual-models","title":"One-Size-Fits-All Multilingual Models","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"university-of-illinois-submission-to-the","title":"University of Illinois Submission to the SIGMORPHON 2020 Shared Task 0: Typologically Diverse Morphological Inflection","date":"2020-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-analyzing-large-graphs-with-quantum","title":"Towards analyzing large graphs with quantum annealing and quantum gate computers","date":"2020-06-30","arxiv_id":"2006.16702","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-mean-field-theory-for-learning-the","title":"A Mean-Field Theory for Learning the Schönberg Measure of Radial Basis Functions","date":"2020-06-23","arxiv_id":"2006.13330","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-nyu-cuboulder-systems-for-sigmorphon-2020-1","title":"The NYU-CUBoulder Systems for SIGMORPHON 2020 Task 0 and Task 2","date":"2020-06-21","arxiv_id":"2006.11830","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-non-asymptotic-analysis-for-stein","title":"A Non-Asymptotic Analysis for Stein Variational Gradient Descent","date":"2020-06-17","arxiv_id":"2006.09797","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-interpretations-of-normalization-methods","title":"New Interpretations of Normalization Methods in Deep Learning","date":"2020-06-16","arxiv_id":"2006.09104","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-private-clipped-gradient","title":"Evading Curse of Dimensionality in Unconstrained Private GLMs via Private Gradient Descent","date":"2020-06-11","arxiv_id":"2006.06783","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-bounds-between-f-divergences-and","title":"Optimal Bounds between $f$-Divergences and Integral Probability Metrics","date":"2020-06-10","arxiv_id":"2006.05973","repositories_listed":0,"syntology":null},{"url":null,"slug":"feynman-kac-neural-network-architectures-for","title":"Feynman-Kac Neural Network Architectures for Stochastic Control Using Second-Order FBSDE Theory","date":"2020-06-08","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-latent-topic-modeling-approach-for-subject","title":"A Latent Topic Modeling approach for Subject Summarization of Research on the Military Art and Science in South Korea","date":"2020-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sigmorphon-2020-shared-task-on","title":"The SIGMORPHON 2020 Shared Task on Unsupervised Morphological Paradigm Completion","date":"2020-05-28","arxiv_id":"2005.13756","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-repair-robust-recovery-of-over","title":"Model Repair: Robust Recovery of Over-Parameterized Statistical Models","date":"2020-05-20","arxiv_id":"2005.09912","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-robust-mean-estimation-via","title":"High-Dimensional Robust Mean Estimation via Gradient Descent","date":"2020-05-04","arxiv_id":"2005.01378","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-large-scale-leveled-readability-lexicon-for","title":"A Large-Scale Leveled Readability Lexicon for Standard Arabic","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adding-pronunciation-information-to-wordnets","title":"Adding Pronunciation Information to Wordnets","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-automatically-generated-danish-renaissance","title":"An automatically generated Danish Renaissance Dictionary","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"lemmatising-verbs-in-middle-english-corpora","title":"Lemmatising Verbs in Middle English Corpora: The Benefit of Enriching the Penn-Helsinki Parsed Corpus of Middle English 2 (PPCME2), the Parsed Corpus of Middle English Poetry (PCMEP), and A Parsed Linguistic Atlas of Early Middle English (PLAEME)","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"linguistically-informed-hindi-english-neural","title":"Linguistically Informed Hindi-English Neural Machine Translation","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"linking-the-tufs-basic-vocabulary-to-the-open","title":"Linking the TUFS Basic Vocabulary to the Open Multilingual Wordnet","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-swedish-roget-style-thesaurus-for","title":"Towards a Swedish Roget-Style Thesaurus for NLP","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-generalization-in-recurrent","title":"Understanding Generalization in Recurrent Neural Networks","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"usability-and-accessibility-of-bantu-language","title":"Usability and Accessibility of Bantu Language Dictionaries in the Digital Age: Mobile Access in an Open Environment","date":"2020-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-learn-morphological-inflection","title":"Learning to Learn Morphological Inflection for Resource-Poor Languages","date":"2020-04-28","arxiv_id":"2004.13304","repositories_listed":0,"syntology":null},{"url":null,"slug":"resolving-the-optimal-metric-distortion","title":"Resolving the Optimal Metric Distortion Conjecture","date":"2020-04-16","arxiv_id":"2004.07447","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-assouad-fano-and-le","title":"Differentially Private Assouad, Fano, and Le Cam","date":"2020-04-14","arxiv_id":"2004.06830","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-semantic-attribute-discovery-and","title":"Unsupervised Discovery, Control, and Disentanglement of Semantic Attributes with Applications to Anomaly Detection","date":"2020-02-25","arxiv_id":"2002.11169","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparison-of-turkish-word-representations","title":"Comparison of Turkish Word Representations Trained on Different Morphological Forms","date":"2020-02-13","arxiv_id":"2002.05417","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharp-analysis-of-epoch-stochastic-gradient","title":"Optimal Epoch Stochastic Gradient Descent Ascent Methods for Min-Max Optimization","date":"2020-02-13","arxiv_id":"2002.05309","repositories_listed":0,"syntology":null},{"url":null,"slug":"no-regret-prediction-in-marginally-stable","title":"No-Regret Prediction in Marginally Stable Systems","date":"2020-02-06","arxiv_id":"2002.02064","repositories_listed":0,"syntology":null},{"url":null,"slug":"agent-based-proof-design-via-lemma-flow","title":"Agent-Based Proof Design via Lemma Flow Diagram","date":"2020-02-03","arxiv_id":"2002.00666","repositories_listed":0,"syntology":null},{"url":null,"slug":"turing-analogues-of-godel-statements-and","title":"Incompleteness for stably consistent formal systems","date":"2020-01-21","arxiv_id":"2001.07592","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-technical-critique-of-some-parts-of-the","title":"A Technical Critique of Some Parts of the Free Energy Principle","date":"2020-01-12","arxiv_id":"2001.06408","repositories_listed":0,"syntology":null},{"url":null,"slug":"logarithmic-regret-for-online-control-with","title":"Logarithmic Regret for Online Control with Adversarial Noise","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-bounds-between-f-divergences-and-1","title":"Optimal Bounds between f-Divergences and Integral Probability Metrics","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"two-birds-with-one-stone-investigating","title":"Two Birds with One Stone: Investigating Invertible Neural Networks for Inverse Problems in Morphology","date":"2019-12-11","arxiv_id":"1912.05274","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-ridge-solutions-for-the-incremental","title":"Two Efficient Ridge Solutions for the Incremental Broad Learning System on Added Inputs","date":"2019-11-12","arxiv_id":"1911.07292","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-characterization-of-all-passivizing-input","title":"A Characterization of All Passivizing Input-Output Transformations of a Passive-Short System","date":"2019-11-09","arxiv_id":"1911.03749","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-characterizing-the-high-dimensional","title":"Towards Characterizing the High-dimensional Bias of Kernel-based Particle Inference Algorithms","date":"2019-10-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"random-quadratic-forms-with-dependence","title":"Random Quadratic Forms with Dependence: Applications to Restricted Isometry and Beyond","date":"2019-10-11","arxiv_id":"1910.04930","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-hierarchical-optimization-rls-against","title":"Robust Hierarchical-Optimization RLS Against Sparse Outliers","date":"2019-10-11","arxiv_id":"1910.05399","repositories_listed":0,"syntology":null},{"url":null,"slug":"stationarity-of-the-detrended-price-return-in","title":"Stationarity of the detrended price return in stock markets","date":"2019-10-02","arxiv_id":"1910.01034","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimating-smooth-glm-in-non-interactive","title":"Estimating Smooth GLM in Non-interactive Local Differential Privacy Model with Public Unlabeled Data","date":"2019-10-01","arxiv_id":"1910.00482","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-nonlinear-stochastic-optimal-control-for","title":"Deep Nonlinear Stochastic Optimal Control for Systems with Multiplicative Uncertainties","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"regular-partitions-and-their-use-in","title":"Regular Partitions and Their Use in Structural Pattern Recognition","date":"2019-09-16","arxiv_id":"1909.07420","repositories_listed":0,"syntology":null},{"url":null,"slug":"group-representation-theory-for-knowledge","title":"Group Representation Theory for Knowledge Graph Embedding","date":"2019-09-11","arxiv_id":"1909.05100","repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-set-disjointness-distributed-learning","title":"Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility","date":"2019-09-08","arxiv_id":"1909.03547","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-sketching-yields-kernel-jl","title":"Gaussian Sketching yields a J-L Lemma in RKHS","date":"2019-08-16","arxiv_id":"1908.05818","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fast-spectral-algorithm-for-mean-estimation","title":"A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates","date":"2019-08-13","arxiv_id":"1908.04468","repositories_listed":0,"syntology":null},{"url":null,"slug":"augmenting-a-german-morphological-database-by","title":"Augmenting a German Morphological Database by Data-Intense Methods","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cbnu-system-for-sigmorphon-2019-shared-task-2","title":"CBNU System for SIGMORPHON 2019 Shared Task 2: a Pipeline Model","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"harmonizing-different-lemmatization","title":"Harmonizing Different Lemmatization Strategies for Building a Knowledge Base of Linguistic Resources for Latin","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"it-ist-at-the-sigmorphon-2019-shared-task","title":"IT--IST at the SIGMORPHON 2019 Shared Task: Sparse Two-headed Models for Inflection","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-team-a-multi-attention-multi-decoder","title":"Multi-Team: A Multi-attention, Multi-decoder Approach to Morphological Analysis.","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-lemmatization-of-multiword-expressions","title":"Neural Lemmatization of Multiword Expressions","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"osian-open-source-international-arabic-news","title":"OSIAN: Open Source International Arabic News Corpus - Preparation and Integration into the CLARIN-infrastructure","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sensefitting-sense-level-semantic","title":"SenseFitting: Sense Level Semantic Specialization of Word Embeddings for Word Sense Disambiguation","date":"2019-07-30","arxiv_id":"1907.13237","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-perfect-marriage-and-much-more-combining","title":"The Perfect Marriage and Much More: Combining Dimension Reduction, Distance Measures and Covariance","date":"2019-07-12","arxiv_id":"1603.09060","repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-zipfs-meaning-frequency-law-with","title":"Testing Zipf’s meaning-frequency law with wordnets as sense inventories","date":"2019-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transformation-d-annotations-en-parties-du","title":"Transformation d'annotations en parties du discours et lemmes vers le format Universal Dependencies : \\'etude de cas pour l'alsacien et l'occitan (Converting POS-tag and Lemma Annotations into the Universal Dependencies Format : A Case Study on Alsatian and Occitan )","date":"2019-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-2fbsdes-for-systems-with-control","title":"Deep 2FBSDEs For Systems With Control Multiplicative Noise","date":"2019-06-11","arxiv_id":"1906.04762","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-precoding-design-for-coarsely","title":"Robust Precoding Design for Coarsely Quantized MU-MIMO Under Channel Uncertainties","date":"2019-05-14","arxiv_id":"1905.05797","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-about-uncertainty-near-optimal","title":"Uncertainty about Uncertainty: Optimal Adaptive Algorithms for Estimating Mixtures of Unknown Coins","date":"2019-04-19","arxiv_id":"1904.09228","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-joint-model-for-improved-contextual","title":"A Simple Joint Model for Improved Contextual Neural Lemmatization","date":"2019-04-04","arxiv_id":"1904.02306","repositories_listed":0,"syntology":null},{"url":null,"slug":"sure-fuse-wff-a-multi-resolution-windowed","title":"SURE-fuse WFF: A Multi-resolution Windowed Fourier Analysis for Interferometric Phase Denoising","date":"2019-02-26","arxiv_id":"1811.04137","repositories_listed":0,"syntology":null},{"url":null,"slug":"de-biasing-the-lasso-with-degrees-of-freedom","title":"De-Biasing The Lasso With Degrees-of-Freedom Adjustment","date":"2019-02-24","arxiv_id":"1902.08885","repositories_listed":0,"syntology":null}],"record_sha256":"dc36b3865d24451a70a458d0a82e781f32f1a444cf660a3ee6d97f14d1cf70f2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}