background preloader

Semantic (web)

Facebook Twitter

Ingénieur Développement Hadoop (H/F) at Thales in Sophia Antipolis - Job.

Web api

From the Semantic Web to the Web of Data: ten years of linking up. Linked Data. Dcow/jPearltrees. jPearltrees/src/me/dcow/pearltrees at master · dcow/jPearltrees. Google dataset linking strings and concepts. Tim Finin, 11:02am 19 May 2012 Yesterday Google announced a very interesting resource with 175M short, unique text strings that were used to refer to one of 7.6M Wikipedia articles.

Google dataset linking strings and concepts

This should be very useful for research on information extraction from text. “We consider each individual Wikipedia article as representing a concept (an entity or an idea), identified by its URL. Text strings that refer to concepts were collected using the publicly available hypertext of anchors (the text you click on in a web link) that point to each Wikipedia page, thus drawing on the vast link structure of the web. For every English article we harvested the strings associated with its incoming hyperlinks from the rest of Wikipedia, the greater web, and also anchors of parallel, non-English Wikipedia pages. The details of the data and how it was constructed are in an LREC 2012 paper by Valentin Spitkovsky and Angel Chang, A Cross-Lingual Dictionary for English Wikipedia Concepts. Index of /pubs/crosswikis-data.tar.bz2. Discovery Hub. Content extraction with apache tika. Apache Tika - Apache Tika.

Semantic tools for big data.


Thésaurus -> Ontology. Demystifying taxanomies. Robust Hyperlinks. Proceedings of Digital Documents and Electronic Publishing (DDEP00), Munich, Germany, 13-15 September 2000 In Springer-Verlag Lecture Notes in Computer Science.

Robust Hyperlinks

Copyright © 2000 Springer-Verlag Thomas A. Phelps and Robert Wilensky Division of Computer Science University of California, Berkeley Berkeley, CA, Web Site Abstract. Robust hyperlinks exhibit a number of desirable qualities: They can be computed and exploited automatically, are small and cheap to compute (so that it is practical to make all hyperlinks robust), do not require new server or infrastructure support, can be rolled out reasonably well in the existing URL syntax (so they can retrofit existing links to make them robust), and are easy to understand.

Robust hyperlinks are one example of using the web to bootstrap new features onto itself. Table: Sample Signatures and Query Results. URLsignatureServerRobust ok? 3. 3.1 Encoding Signatures in URLs Robust Browsers. ConceptNet 5. UIMA - Standard for unstructured information. UIMA is a component software architecture for the development, discovery, composition, and deployment of multi-modal analytics for the analysis of unstructured information and its integration with search technologies developed by IBM.

UIMA - Standard for unstructured information

The source code for a reference implementation of this framework has been made available on SourceForge, and later on the website of the Apache Software Foundation. Another use of UIMA is in systems that are used in medical contexts to analyze clinical notes, such as the Clinical Text Analysis and Knowledge Extraction System (CTAKES). Structure of UIMA[edit] The UIMA architecture can be thought of in four dimensions: IBM Watson - The Jeopardy Challenge[edit] In February 2011 a computer from IBM Research named Watson won a competition on Jeopardy! See also[edit] References[edit] External links[edit] Using DBpedia for Thesaurus Management and Linked Open Data Integrati… Supercalculateur sémantique. "Watson" est un superordinateur de la firme IBM.

Supercalculateur sémantique

Il associe la puissance matérielle (quantitative) à la puissance logicielle (qualitative). Au plan matériel, Watson dispose d'un système d'exploitation GNU-Linux, composé de 10 racks contenant chacun 9 serveurs Power 750 montés en réseau. Chaque serveur possède 32 coeurs qui peuvent gérer un total de 128 tâches en parallèle. "Watson", qui compte donc au total 2 880 coeurs pouvant effectuer 11 520 tâches en parallèle, possède une mémoire vive de 15 000 Go (gigaoctets) et une puissance totale de 80 Tflop (téraflops). À titre comparatif, Deep-Blue, vainqueur en 1966 de Kasparov aux échecs, (n')avait (qu')une puissance totale de 1 Tflop. Au plan logiciel, les chercheurs de IBM ont développé la suite logicielle "IBM DeepQA" capable d’analyser le langage et les connaissances humaines dans des contexte ambigu et de développer ses connaissance par apprentissage.