{"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/knowledge-base-completion/papers/2","list_of":"/task/knowledge-base-completion","task":"Knowledge Base Completion","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":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,156],"of":156,"counts":{"archive_papers_tagged":156,"with_a_code_link":69,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":156,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":3,"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/knowledge-base-completion","prev":"/task/knowledge-base-completion","next":null,"papers":[{"url":null,"slug":"neural-markov-logic-networks","title":"Neural Markov Logic Networks","date":"2019-05-31","arxiv_id":"1905.13462","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-transe-multi-relational-graph","title":"Riemannian TransE: Multi-relational Graph Embedding in Non-Euclidean Space","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"augmentic-compositional-models-for-knowledge","title":"Augmentic Compositional Models for Knowledge Base Completion Using Gradient Representations","date":"2019-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-cardinality-constraints-in-neural","title":"Embedding Cardinality Constraints in Neural Link Predictors","date":"2018-12-16","arxiv_id":"1812.06455","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-relation-representations-from-word","title":"Learning Relation Representations from Word Representations","date":"2018-11-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/augmenting-compositional-models-for-knowledge","slug":"augmenting-compositional-models-for-knowledge","title":"Augmenting Compositional Models for Knowledge Base Completion Using Gradient Representations","date":"2018-11-02","arxiv_id":"1811.01062","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-evaluating-embedding-models-for-knowledge","title":"On Evaluating Embedding Models for Knowledge Base Completion","date":"2018-10-17","arxiv_id":"1810.07180","repositories_listed":0,"syntology":null},{"url":null,"slug":"commonsense-knowledge-base-completion-and","title":"Commonsense Knowledge Base Completion and Generation","date":"2018-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-embedding-with-hierarchical","title":"Knowledge Graph Embedding with Hierarchical Relation Structure","date":"2018-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"semantically-enhanced-models-for-commonsense","title":"Semantically Enhanced Models for Commonsense Knowledge Acquisition","date":"2018-09-12","arxiv_id":"1809.04708","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-dependent-learning-of","title":"Data-dependent Learning of Symmetric/Antisymmetric Relations for Knowledge Base Completion","date":"2018-08-25","arxiv_id":"1808.08361","repositories_listed":0,"syntology":null},{"url":"/paper/neural-relation-extraction-via-inner-sentence","slug":"neural-relation-extraction-via-inner-sentence","title":"Neural Relation Extraction via Inner-Sentence Noise Reduction and Transfer Learning","date":"2018-08-21","arxiv_id":"1808.06738","repositories_listed":0,"syntology":null},{"url":null,"slug":"relation-induction-in-word-embeddings","title":"Relation Induction in Word Embeddings Revisited","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"why-does-pairdiff-work-a-mathematical","title":"Why does PairDiff work? - A Mathematical Analysis of Bilinear Relational Compositional Operators for Analogy Detection","date":"2018-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recurrent-one-hop-predictions-for-reasoning","title":"Recurrent One-Hop Predictions for Reasoning over Knowledge Graphs","date":"2018-06-12","arxiv_id":"1806.04523","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-conceptual-space-representations-of","title":"Learning Conceptual Space Representations of Interrelated Concepts","date":"2018-05-03","arxiv_id":"1805.01276","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-the-task-of-scoring-open-ie","title":"Revisiting the Task of Scoring Open IE Relations","date":"2018-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"commonsense-mining-as-knowledge-base","title":"Commonsense mining as knowledge base completion? A study on the impact of novelty","date":"2018-04-24","arxiv_id":"1804.09259","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-a-continuous-knowledge-learning","title":"Towards a Continuous Knowledge Learning Engine for Chatbots","date":"2018-02-16","arxiv_id":"1802.06024","repositories_listed":0,"syntology":null},{"url":"/paper/m-walk-learning-to-walk-over-graphs-using","slug":"m-walk-learning-to-walk-over-graphs-using","title":"M-Walk: Learning to Walk over Graphs using Monte Carlo Tree Search","date":"2018-02-12","arxiv_id":"1802.04394","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-graph-embedding-models","title":"Generalized Graph Embedding Models","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-representation-learning-with-logic","title":"Combining Representation Learning with Logic for Language Processing","date":"2017-12-27","arxiv_id":"1712.09687","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-path-ranking-for-knowledge-base","title":"Context-aware Path Ranking for Knowledge Base Completion","date":"2017-12-20","arxiv_id":"1712.07745","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-relation-extraction-by","title":"Weakly-supervised Relation Extraction by Pattern-enhanced Embedding Learning","date":"2017-11-09","arxiv_id":"1711.03226","repositories_listed":0,"syntology":null},{"url":null,"slug":"why-pairdiff-works-a-mathematical-analysis-of","title":"Why PairDiff works? -- A Mathematical Analysis of Bilinear Relational Compositional Operators for Analogy Detection","date":"2017-09-19","arxiv_id":"1709.06673","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-approaches-for-representing","title":"Compositional Approaches for Representing Relations Between Words: A Comparative Study","date":"2017-09-04","arxiv_id":"1709.01193","repositories_listed":0,"syntology":null},{"url":null,"slug":"corpus-level-fine-grained-entity-typing","title":"Corpus-level Fine-grained Entity Typing","date":"2017-08-07","arxiv_id":"1708.02275","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-prediction-of-relations-for","title":"Distributed Prediction of Relations for Entities: The Easy, The Difficult, and The Impossible","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-large-scale-structured-relationships","title":"Modeling Large-Scale Structured Relationships with Shared Memory for Knowledge Base Completion","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ntnu-2-at-semeval-2017-task-10-identifying","title":"NTNU-2 at SemEval-2017 Task 10: Identifying Synonym and Hyponym Relations among Keyphrases in Scientific Documents","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-rich-networks-for-knowledge-base","title":"Feature-Rich Networks for Knowledge Base Completion","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-base-completion-baselines-strike","title":"Knowledge Base Completion: Baselines Strike Back","date":"2017-05-30","arxiv_id":"1705.10744","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-interpretable-knowledge-transfer-model-for","title":"An Interpretable Knowledge Transfer Model for Knowledge Base Completion","date":"2017-04-19","arxiv_id":"1704.05908","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-neural-knowledge-base-completion","title":"Improving Neural Knowledge Base Completion with Cross-Lingual Projections","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-learning-of-relation-path","title":"Compositional Learning of Relation Path Embedding for Knowledge Base Completion","date":"2016-11-22","arxiv_id":"1611.07232","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-using-embedded-knowledge","title":"Link Prediction using Embedded Knowledge Graphs","date":"2016-11-14","arxiv_id":"1611.04642","repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-inference-formulas-by-goal-directed","title":"Mining Inference Formulas by Goal-Directed Random Walks","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-knowledge-base-completion-by-path","title":"Improved Knowledge Base Completion by Path-Augmented TransR Model","date":"2016-10-06","arxiv_id":"1610.04073","repositories_listed":0,"syntology":null},{"url":null,"slug":"commonsense-knowledge-base-completion","title":"Commonsense Knowledge Base Completion","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-relational-knowledge-into-word","title":"Incorporating Relational Knowledge into Word Representations using Subspace Regularization","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-base-completion-via-coupled-path","title":"Knowledge Base Completion via Coupled Path Ranking","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/corpus-level-fine-grained-entity-typing-using","slug":"corpus-level-fine-grained-entity-typing-using","title":"Corpus-level Fine-grained Entity Typing Using Contextual Information","date":"2016-06-25","arxiv_id":"1606.07901","repositories_listed":0,"syntology":null},{"url":null,"slug":"neighborhood-mixture-model-for-knowledge-base","title":"Neighborhood Mixture Model for Knowledge Base Completion","date":"2016-06-21","arxiv_id":"1606.06461","repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-selectional-preferences-in","title":"Incorporating Selectional Preferences in Multi-hop Relation Extraction","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-factorization-machine-framework-for-testing","title":"A Factorization Machine Framework for Testing Bigram Embeddings in Knowledgebase Completion","date":"2016-04-20","arxiv_id":"1604.05878","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-expressive-knowledge-base","title":"Efficient and Expressive Knowledge Base Completion Using Subgraph Feature Extraction","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"representing-text-for-joint-embedding-of-text","title":"Representing Text for Joint Embedding of Text and Knowledge Bases","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"observed-versus-latent-features-for-knowledge","title":"Observed versus latent features for knowledge base and text inference","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-combined-matrix-and-tensor","title":"Towards Combined Matrix and Tensor Factorization for Universal Schema Relation Extraction","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-belief-embedding-for-knowledge","title":"Probabilistic Belief Embedding for Knowledge Base Completion","date":"2015-05-10","arxiv_id":"1505.02433","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-vector-space-models-for","title":"Compositional Vector Space Models for Knowledge Base Completion","date":"2015-04-24","arxiv_id":"1504.06662","repositories_listed":0,"syntology":null},{"url":null,"slug":"inferring-missing-entity-type-instances-for-1","title":"Inferring Missing Entity Type Instances for Knowledge Base Completion: New Dataset and Methods","date":"2015-04-24","arxiv_id":"1504.06658","repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-both-distributional-and","title":"Incorporating Both Distributional and Relational Semantics in Word Representations","date":"2014-12-18","arxiv_id":"1412.5836","repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-both-distributional-and-1","title":"Incorporating Both Distributional and Relational Semantics in Word Representations","date":"2014-12-14","arxiv_id":"1412.4369","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-multi-relational-semantics-using","title":"Learning Multi-Relational Semantics Using Neural-Embedding Models","date":"2014-11-14","arxiv_id":"1411.4072","repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-with-neural-tensor-networks-for","title":"Reasoning With Neural Tensor Networks for Knowledge Base Completion","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"f2df68839e93a6c935ab7b9fc14c1e03d4dd6444b0fd3215c5eda60e528e3944","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}