Link Discovery Tutorial Part V: Hands-On

This document provides an overview of hands-on tasks for a link discovery tutorial using the Limes framework. It describes a test dataset, and three tasks: 1) executing a provided Limes configuration to detect duplicate authors, 2) creating a configuration to find similar publications based on keywords, and 3) using the Limes GUI.

Science

Link Discovery Tutorial
Part V: Hands-On
Axel-Cyrille Ngonga Ngomo(1)
, Irini Fundulaki(2)
, Mohamed Ahmed Sherif(1)
(1) Institute for Applied Informatics, Germany
(2) FORTH, Greece
October 18th, 2016
Kobe, Japan
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 1 / 19

Table of Contents
1 Test Dataset
2 Task I: Execute given Limes Conﬁguration
3 Task II: Create your ﬁrst Limes Conﬁguration
4 Task III: Use Limes GUI
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 2 / 19

Test Dataset
Semantic Web Dog Food Corpus
Data exposed: Metadata (papers, presentations, people) for several semantic web
related conferences and workshops, including the most recent ISWC, ESWC and
WWW events.
Dumps: http://data.semanticweb.org/dumps
Endpoint: http://data.semanticweb.org/sparql
DataHub: https://datahub.io/dataset/semantic-web-dog-food
Download:
http://iswc2016ldtutorial.aksw.org/tutorial-material/
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 4 / 19

Task I: Deduplication
Execute the given Conﬁguration File
Decentralized nature of LOD
Data contain duplicates
How to eﬃciently detect similar resources?
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 6 / 19

Limes Conﬁguration File
PREFIXes
<PREFIX >
<NAMESPACE >http :// www.w3.org /2000/01/ rdf -schema#</NAMESPACE >
<LABEL >rdfs </LABEL >
</PREFIX >
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 7 / 19

Limes Conﬁguration File
SOURCE and TARGET datasets
<SOURCE >
<ID>SDF1 </ID>
<ENDPOINT >semanticDogFood .nt</ENDPOINT >
<VAR >?x</VAR>
<PAGESIZE >-1</PAGESIZE >
<RESTRICTION >?x a foaf:Person </ RESTRICTION >
<PROPERTY >rdfs:label </PROPERTY >
<TYPE >NT</TYPE >
</SOURCE >
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 8 / 19

Limes Conﬁguration File
METRIC
<METRIC >Levenshtein(x.rdfs:label , y.rdfs:label)</METRIC >
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 9 / 19

Limes Conﬁguration File
ACCEPTANCE and REVIEW
<ACCEPTANCE >
<THRESHOLD >0.9</THRESHOLD >
<FILE >similarAuthor .nt</FILE >
<RELATION >ov:similarTo </RELATION >
</ACCEPTANCE >
<REVIEW >
<THRESHOLD >0.5 </THRESHOLD >
<FILE >similarAuthor_review .nt</FILE >
<RELATION >owl:sameAs </RELATION >
</REVIEW >
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 10 / 19

Limes Conﬁguration File
OUTPUT format
<OUTPUT >TTL</OUTPUT >
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 11 / 19

Task I
Run Limes
Run Limes
java -jar limes-core-1.0.0.jar task1.xml
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 12 / 19

Task I
Using Machine Learning
<MLALGORITHM >
<NAME >wombat simple </NAME >
<TYPE >unsupervised </TYPE >
</ MLALGORITHM >
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 13 / 19

Task II
Find similar publications
1 Find publications
2 with similar keyword, but do not link any publication to itself
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 15 / 19

Task II
Find similar publications
1 Find publications
2 with similar keyword, but do not link any publication to itself
1. Find publications
?x a swrc:InProceedings
?y a swrc:InProceedings
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 15 / 19

Task III
Use Limes GUI
Run Limes GUI
java -jar limes-core-1.0.0.jar -g
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 17 / 19

Acknowledgment
This work was supported by grants from the EU H2020 Framework Programme
provided for the project HOBBIT (GA no. 688227).
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 18 / 19

References I
Ngonga Ngomo et al. (InfAI & FORTH) LD Tutorial: Hands-On October 17, 2016 19 / 19

Framester is a linguistic linked data hub that aims to improve coverage of FrameNet by extending mappings between FrameNet and other resources like WordNet and BabelNet. Framester represents over 40 million triples linking linguistic and factual resources and aligning frames, roles, and types to foundational ontologies. It provides a word frame disambiguation service and was evaluated on annotated corpora, showing improved performance over previous approaches.

Can Deep Learning Techniques Improve Entity Linking?

Julien Plu presented on using deep learning techniques to improve entity linking. He discussed using word embeddings and neural networks to better recognize and link entities in documents by understanding semantic relationships between words. Current supervised methods require large training sets and are not robust to new entity types, while unsupervised methods have difficulties computing relatedness between candidate entities. Deep learning approaches may help address these issues through their ability to learn complex patterns from large amounts of unlabeled text data.

Knowledge extraction in Web media: at the frontier of NLP, Machine Learning a...

The document presents research on developing an adaptive entity linking system called ADEL. It discusses 6 problems in entity linking and proposes research questions to address adaptivity to different text, entity types, knowledge bases, and languages. It describes ADEL's modular framework including extraction, linking, and pruning modules. Evaluation shows ADEL achieves state-of-the-art results on multiple datasets. Future work focuses on knowledge base and language adaptivity, improving the system, and engineering a distributed architecture.

The document describes enhancements made to the ADEL entity linking framework. ADEL combines multiple named entity recognition models and uses a combination of linguistic and dictionary-based approaches. New features in ADEL include using a generic API to interface with NLP tools, combining multiple CRF models for entity extraction, clustering nil entities, and developing a new backend using Elasticsearch and Couchbase. The document compares the performance of the original 2015 version of ADEL to the new 2016 version on standard entity linking tasks and datasets.

Can functional programming be liberated from static typing?

Vsevolod Dyomkin

Learning Multilingual Semantic Parsers for Question Answering over Linked Dat...

The document summarizes a PhD dissertation defense talk on learning multilingual semantic parsers for question answering over linked data. It discusses comparing neural and probabilistic graphical model architectures for semantic parsing to map natural language to formal meaning representations. The talk outlines introducing dependency parse tree-based approaches, evaluating different model architectures, and addressing challenges in building multilingual question answering systems over structured knowledge bases.

Applications of Word Vectors in Text Retrieval and Classification

DS2014: Feature selection in hierarchical feature spaces

The document describes a proposed approach called SHSEL for hierarchical feature selection in machine learning. SHSEL exploits the hierarchical structure of feature spaces, where more specific features imply more general ones. It initially selects ranges of similar features in each branch based on relevance similarity. It then prunes the set further by selecting only the most relevant remaining features. The authors evaluate SHSEL on real and synthetic datasets compared to other feature selection methods, finding it achieves comparable or improved accuracy while significantly reducing the feature space.

Entity Linking in Queries: Tasks and Evaluation

Faegheh Hasibi

The document discusses entity linking in queries for tasks like ad-hoc document retrieval and query understanding. It describes three main tasks for entity linking in queries: entity linking, semantic mapping, and interpretation finding. Semantic mapping allows mentions to overlap and links mentions to multiple entities, while interpretation finding returns sets of semantically related entity sets where mentions do not overlap within a set. The document also discusses test collections, evaluation metrics, and methods like mention detection, candidate entity ranking, and greedy interpretation finding for linking entity mentions in queries to knowledge bases.

RDF2Vec: RDF Graph Embeddings for Data Mining

Linked Open Data has been recognized as a valuable source for background information in data mining. However, most data mining tools require features in propositional form, i.e., a vector of nominal or numerical features associated with an instance, while Linked Open Data sources are graphs by nature. In this paper, we present RDF2Vec, an approach that uses language modeling approaches for unsupervised feature extraction from sequences of words, and adapts them to RDF graphs. We generate sequences by leveraging local information from graph sub-structures, harvested by Weisfeiler-Lehman Subtree RDF Graph Kernels and graph walks, and learn latent numerical representations of entities in RDF graphs. Our evaluation shows that such vector representations outperform existing techniques for the propositionalization of RDF graphs on a variety of different predictive machine learning tasks, and that feature vector representations of general knowledge graphs such as DBpedia and Wikidata can be easily reused for different tasks.

Entity Search: The Last Decade and the Next

krisztianbalog

ESWC 2013 Poster: Representing and Querying Negative Knowledge in RDF

Fariz Darari

Typically, only positive data can be represented in RDF. However, negative knowledge representation is required in some application domains such as food allergies, software incompatibility, and school absence. We present an approach to represent and query RDF data with negative data. We provide the syntax, semantics, and an example. We argue that this approach fits into the open-world semantics of RDF according to the notion of certain answers. Get more information at http://dx.doi.org/10.1007/978-3-642-41242-4_40

Two graph data models : RDF and Property Graphs

This document provides an overview of two graph data models: RDF and Property Graphs. It describes the key components of each model, including triples for RDF and nodes/edges/properties for Property Graphs. It also discusses Apache projects that work with each model like Apache Jena for RDF and Apache TinkerPop, Spark, Giraph and Flink for Property Graphs. Finally, it notes that while the models have different focuses, they could potentially share technologies like storage and query capabilities.

Federation and Navigation in SPARQL 1.1

net2-project

This document discusses new features in SPARQL 1.1, including federation using the SERVICE operator and navigation using property paths. It provides an overview of the basics of SPARQL and the syntax and semantics of SPARQL 1.0 queries before explaining federation, which allows querying multiple datasets, and navigation, which allows navigating RDF graphs using regular expressions to match properties. It also discusses the evaluation procedures and complexity of these new features.

F# and the DLR

Richard Minerich

The document discusses F# and the Dynamic Language Runtime (DLR). It provides an overview of F# as a functional-first multi-paradigm language for .NET that allows for imperative and object-oriented programming. It also describes the DLR and how it enables dynamic languages like Python and Ruby to run on .NET and interoperate with existing .NET code. The DLR architecture is explained along with use cases like test-driven development, web development, and embedding dynamic languages in applications.

Data translation with SPARQL 1.1

andreas_schultz

This document provides an outline for a WWW 2012 tutorial on schema mapping with SPARQL 1.1. The outline includes sections on why data integration is important, schema mapping, translating RDF data with SPARQL 1.1, and common mapping patterns. Mapping patterns discussed include simple renaming, structural patterns like renaming based on property existence or value, value transformation using SPARQL functions, and aggregation. The tutorial aims to show how SPARQL 1.1 can be used to express executable mappings between different data schemas and representations.

SPARQL Cheat Sheet

LeeFeigenbaum

Graph Data -- RDF and Property Graphs

WU (Vienna University of Economics and Business)

This document discusses and compares graph data structures represented as linked data/RDF and property graphs. It provides examples of linked data/RDF graphs using Turtle syntax and JSON-LD, and how they can be queried with SPARQL. It also demonstrates how to represent the same graph data as a property graph using TinkerPop and Gremlin, and how the graph can be queried using Gremlin and Cypher languages. Key graph concepts like nodes, edges, and properties are also introduced.

Democratizing Big Semantic Data management

Personalised Search for the Social Semantic Web

Oana Tifrea-Marciuska

This document discusses personalised search for the social semantic web. It introduces Datalog± as a language for representing ontologies and preferences, and describes three frameworks for representing qualitative, quantitative, and conditional preferences in Datalog±: 1. PP-Datalog± combines Datalog± with partial qualitative preferences and probabilistic uncertainty. It defines preference combination operators and an algorithm for top-k queries. 2. GPP-Datalog± generalizes PP-Datalog± to handle group preferences from multiple users with and without probabilistic uncertainty. It defines operators for merging single-user preferences and aggregating preferences of a group. 3. Challenges include preference merging when user preferences disagree with probabilistic

Introduction to R for Data Science :: Session 1

mchristy-Dh2014- emop-postOCR-triage

Matt Christy

Introduction to R for Data Science :: Session 2

LOD2 Creating Knowledge out of Interlinked Data

This document provides an introduction to vectors, matrices, and data frames in R. It discusses that in R, everything starts as a vector, including the columns of a data frame. It demonstrates how to create, subset, order, and concatenate vectors. It also shows how to create matrices and discusses their similarities to vectors. Finally, it covers key aspects of working with data frames such as subsetting, joining, and using names(), rownames(), and colnames().

LOD2 Webinar Series: LIMES

Born from the wish to make linking tractable, the Link Discovery Framework for Metric Spaces (LIMES) is tailored towards the time-efficient and lossless discovery of links across knowledge bases. LIMES is an extensible declarative framework that encapsulates manifold algorithms dedicated to the processing of structured data of any sort. Built with extensibility and easy integration in mind, LIMES allows implementing applications that integrate, consume and/or generate Linked Data. Within LOD2, it will be used for discovering links between knowledge bases. This webinar will be presented by the LOD2 Partner: University of Leipzig (ULEI), Germany.

The Lazy Traveling Salesman Memory Management for Large-Scale Link Discovery

What's hot

Enhancing Entity Linking by Combining NER Models

Can functional programming be liberated from static typing?

Vsevolod Dyomkin

Learning Multilingual Semantic Parsers for Question Answering over Linked Dat...

Applications of Word Vectors in Text Retrieval and Classification

DS2014: Feature selection in hierarchical feature spaces

Entity Linking in Queries: Tasks and Evaluation

Faegheh Hasibi

RDF2Vec: RDF Graph Embeddings for Data Mining

Entity Search: The Last Decade and the Next

krisztianbalog

ESWC 2013 Poster: Representing and Querying Negative Knowledge in RDF

Fariz Darari

Two graph data models : RDF and Property Graphs

Federation and Navigation in SPARQL 1.1

net2-project

F# and the DLR

Richard Minerich

Data translation with SPARQL 1.1

andreas_schultz

SPARQL Cheat Sheet

LeeFeigenbaum

Graph Data -- RDF and Property Graphs

WU (Vienna University of Economics and Business)

Democratizing Big Semantic Data management

Personalised Search for the Social Semantic Web

Oana Tifrea-Marciuska

Introduction to R for Data Science :: Session 1

mchristy-Dh2014- emop-postOCR-triage

Matt Christy

Introduction to R for Data Science :: Session 2

LOD2 Creating Knowledge out of Interlinked Data

What's hot (20)

Enhancing Entity Linking by Combining NER Models

Can functional programming be liberated from static typing?

Learning Multilingual Semantic Parsers for Question Answering over Linked Dat...

Applications of Word Vectors in Text Retrieval and Classification

DS2014: Feature selection in hierarchical feature spaces

Entity Linking in Queries: Tasks and Evaluation

RDF2Vec: RDF Graph Embeddings for Data Mining

Entity Search: The Last Decade and the Next

ESWC 2013 Poster: Representing and Querying Negative Knowledge in RDF

Two graph data models : RDF and Property Graphs

Federation and Navigation in SPARQL 1.1

F# and the DLR

Data translation with SPARQL 1.1

SPARQL Cheat Sheet

Graph Data -- RDF and Property Graphs

Democratizing Big Semantic Data management

Personalised Search for the Social Semantic Web

Introduction to R for Data Science :: Session 1

mchristy-Dh2014- emop-postOCR-triage

Introduction to R for Data Science :: Session 2

Viewers also liked

LOD2 Webinar Series: LIMES

The Lazy Traveling Salesman Memory Management for Large-Scale Link Discovery

An RDF Dataset Generator for the Social Network Benchmark with Real-World Coh...

Versioning for Linked Data: Archiving Systems and Benchmarks

This document discusses versioning systems for linked data and benchmarks for evaluating such systems. It describes different archiving strategies for versioning like full materialization, delta-based, and annotated triples approaches. It also discusses query types for versioned data like version queries, delta queries, and cross-version queries. Two benchmarks for versioned linked data are introduced: BEAR, which uses real versioned datasets, and EvoGen, a benchmark generator. EvoGen allows configuring how data evolves across versions while BEAR tests efficiency of version retrieval and cross-version queries.

SPARQL Querying Benchmarks ISWC2016

Muhammad Saleem

Open Gdansk - Analitics Conf - Gdansk

Tomasz Nadolny

This document discusses open data initiatives in Gdansk, Poland. It notes that open data has significant economic benefits, estimating a 0.4-4.1% increase to GDP from various studies. Gdansk has an open data policy and shares datasets to be reusable, credible, complete, and machine-readable. Examples of open data provided by Gdansk include city expenditure lists updated daily, a machine-readable city price list, and access to records of public information requests. The city develops open web applications using this data and shares the source code openly. It also supports an external civic engagement platform to connect officials and residents called CivilHub.org.

Hobbit presentation at Apache Big Data Europe 2016

The document discusses the HOBBIT platform for benchmarking big data platforms. It aims to provide a unified benchmarking platform as a community-driven effort. The platform will include reference datasets and implementations of key performance indicators to standardize benchmarking and allow comparison of results. It will focus on benchmarking tasks related to big linked data and the entire data lifecycle.

Viewers also liked (7)

LOD2 Webinar Series: LIMES

The Lazy Traveling Salesman Memory Management for Large-Scale Link Discovery

An RDF Dataset Generator for the Social Network Benchmark with Real-World Coh...

Versioning for Linked Data: Archiving Systems and Benchmarks

SPARQL Querying Benchmarks ISWC2016

Open Gdansk - Analitics Conf - Gdansk

Hobbit presentation at Apache Big Data Europe 2016

Similar to Link Discovery Tutorial Part V: Hands-On

II-SDV 2017: Custom Open Source Search Engine with Drupal 8 and Solr at Frenc...

Dr. Haxel Consult

A journey in the Dark Web, for companies looking to take control of their search strategy. Objective if this presentation is to prove that any reasonable cost, any organisation can setup its own search strategy, outside or in parallel of its document management strategy. Challenge at French Ministry is to aggregate internal content, external content on social network (pinterest, youtube, facebook) and external legacy WebSite content (other Website from agency in relation with Ministry) and provide a brand new Web Site with "best of the bread" interface : search engine, auto completion and word correction, easy custom and secured navigation Result is awesome, for a budget kept under control, we provided a new Drupal Module to monitor and configure Solr6 indexation and search engine, together with custom API to index external WebSite. This session will come with a presentation of the Project Architecture (multi tiers servers) and a live demo of the Search interface

Benchmarking Linked Data Introductory Remarks

Don't panic! - Postgres introduction

Federico Campoli

This document is an introduction to PostgreSQL presented by Federico Campoli to the Brighton PostgreSQL Users Group. It covers the history and development of PostgreSQL, its features including data types, JSON/JSONB support, and performance comparisons. The presentation includes sections on the history of PostgreSQL, its features and capabilities, NOSQL support using JSON/JSONB, and concludes with a wrap up on PostgreSQL and related projects.

Semantics-aware Graph-based Recommender Systems exploiting Linked Open Data

Cataldo Musto

QALD-7 Question Answering over Linked Data Challenge

Patricia Maria Ferreira Larrieux

Qald 7 at ESWC2017

Giulio Napolitano

Building a Web-Scale Dependency-Parsed Corpus from Common Crawl

Alexander Panchenko

We present DepCC, the largest-to-date linguistically analyzed corpus in English including 365 million documents, composed of 252 billion tokens and 7.5 billion of named entity occurrences in 14.3 billion sentences from a web-scale crawl of the Common Crawl project. The sentences are processed with a dependency parser and with a named entity tagger and contain provenance information, enabling various applications ranging from training syntax-based word embeddings to open information extraction and question answering. We built an index of all sentences and their linguistic meta-data enabling quick search across the corpus. We demonstrate the utility of this corpus on the verb similarity task by showing that a distributional model trained on our corpus yields better results than models trained on smaller corpora, like Wikipedia. This distributional model outperforms the state of art models of verb similarity trained on smaller corpora on the SimVerb3500 dataset. http://www.lrec-conf.org/proceedings/lrec2018/summaries/215.html

Corpora, tracked changes, and PDFs: some useful tips, at no cost!

Use of Open Data in Hong Kong

Sammy Fung

Apache Solr, il motore di ricerca enterprise open source

Luca Bonesini

Luca Bonesini is an IT manager, programmer, and open source contributor who works for Sourcesense, a company focused on open source. He presented on Apache Solr and Apache Lucene, which are open source enterprise search platforms. Solr builds on Lucene to provide powerful and scalable search capabilities through its RESTful APIs and web interface. It allows for full-text search, faceting, real-time indexing and other features important for enterprise search applications.

Use of Open Data in Hong Kong (LegCo 2014)

Sammy Fung

Filling the knowledge gap: New metrics for GLAMs and GLAM-Wiki cooperation

Iolanda Pensa

Event-based MultiMedia Search and Retrieval for Question Answering

Benoit HUET

The document describes a framework for event-based multimedia search and retrieval for question answering. It discusses parsing user queries to extract semantic entities like location and time. Events are collected from news sources and clustered. Textual and visual media are gathered from social media to summarize events. Visual concepts are mapped to queries to enrich text-based search. Experimental results show combining textual and visual scores using concept mapping improves search performance. The optimal approach weights textual scores higher than visual scores.

Software Citation and a Proposal (NSF workshop at Havard Medical School)

James Howison

Data management for researchers

Dirk Roorda

This document provides an overview of the SHEBANQ project, which provides tools for querying annotated Hebrew text data. It describes the data sources and contributors that have built up the underlying text corpus over many years. It also outlines the steps taken to make this data and related tools more accessible, including developing a website, depositing data in archives, running demonstration projects, and integrating the data and tools into broader research environments through additional projects and publications. The goal has been to facilitate wider use of this linguistic resource and foster more digital humanities and data science work based on its contents.

Linked data based semantic annotation using Drupal and Apache Stanbol

Gabriel Dragomir

My presentation from Drupalaton 2013 - http://drupalaton.hu/schedule#speaker-30 This session will focus on the implementation of semantic services (automatic content enhancement, autotagging, content recommendation, reasoning) based on linked data datasets using the integration of Drupal with Apache Stanbol. During the presentation the audience will find out about: main features of Apache Stanbol and its integration with Drupal how to discover and use custom/domain specific Linked Data datasets with Apache Stanbol/Drupal how to build an advanced semantic processing chain in Apache Stanbol that will automatically annotate Drupal entities how to implement a content recommendation/reasoning feature for Drupal based on Apache Stanbol services. Apache Stanbol is an Open Source software stack designed to provide a powerful semantic engine via RESTful services returning results as RDF (Resource Description Language) and JSON. Unlike existing proprietary, commmerically oriented solutions such as OpenCalais, Apache Stanbol is highly customizable and may be trained to provide semantic services for virtually any language.

Humans & Machines Together

Lora Aroyo

The document discusses improving search and annotations for video fragments in cultural heritage collections. It notes that current annotations are too coarse-grained, refer only to entire videos, and use specialized vocabulary unknown to general audiences. It also observes that searchers often look for specific fragments rather than entire videos and are not always able to find what they search for based on title or term. The document suggests improving support for fragment search, using time-based annotations, and bridging the vocabulary gap between searchers and cataloguers, possibly through crowdsourcing.

Presentation 17 may keynote lara aroyo

Nederlands Instituut voor Beeld en Geluid

The document discusses improving search and annotations for video fragments in cultural heritage collections. It notes that current annotations are too coarse-grained, refer only to entire videos, and use specialized vocabulary unknown to general audiences. It also observes that people frequently search for and request specific video fragments rather than entire videos. The document proposes improving support for fragment search, using time-based annotations, and bridging the vocabulary gap between searchers and cataloguers, possibly through crowdsourcing.

4th Natural Language Interface over the Web of Data (NLIWoD) workshop and QAL...

Knowledge extraction in Web media: at the frontier of NLP, Machine Learning a...