Results 1 - 10
of
330
Enabling Structured Queries over Unstructured Documents
"... Abstract—With the information explosion on the internet, finding precise answers efficiently is a prevalent requirement by many users. Today, search engines answer keyword queries with a ranked list of documents. Users might not be always willing to read the top ranked documents in order to satisfy ..."
Abstract
- Add to MetaCart
, on the other hand, the system must be able to extract information from unstructured text documents to answer these queries. To this end, we introduce a system which supports structured queries over unstructured text documents, aiming at finding structured answers to the users ’ information need. Our goal
Question Answering over Linked Data Using First-order Logic∗
"... Question Answering over Linked Data (QALD) aims to evaluate a question an-swering system over structured data, the key objective of which is to translate questions posed using natural language into structured queries. This technique can help common users to directly ac-cess open-structured knowledge ..."
Abstract
- Add to MetaCart
Question Answering over Linked Data (QALD) aims to evaluate a question an-swering system over structured data, the key objective of which is to translate questions posed using natural language into structured queries. This technique can help common users to directly ac-cess open-structured
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
- Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
Entity-Relationship Queries over Wikipedia
"... Wikipedia is the largest user-generated knowledge base. We propose a structured query mechanism, entity-relationship query, for searching entities in Wikipedia corpus by their properties and inter-relationships. An entity-relationship query consists of arbitrary number of predicates on desired entit ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
entities. The semantics of each predicate is specified with keywords. Entity-relationship query searches entities directly over text rather than pre-extracted structured data stores. This characteristic brings two benefits: (1) Query semantics can be intuitively expressed by keywords; (2) It avoids
Semantic question answering system over linked data using relational patterns
- In Proc. of the Joint EDBT/ICDT 2013 Workshops
, 2013
"... Question answering is the task of answering questions in natural language. Linked Data project and Semantic Web community made it possible for us to query structured knowledge bases like DBpedia and YAGO. Only expert users, however, with the knowledge of RDF and ontology definitions can build correc ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
correct SPARQL queries for querying knowledge bases formally. In this paper, we present a method for mapping natural language questions to ontology-based structured queries to retrieve direct answers from open knowledge bases (linked data). Our tool is based on translating natural language questions
BayesWipe: A Multimodal System for Data Cleaning and Consistent Query Answering on Structured Data.”, Big Uncertain Data
, 2014
"... Abstract—Recent efforts in data cleaning of structured data have focused exclusively on problems like data deduplication, record matching, and data standardization; none of these focus on fixing incorrect attribute values in tuples. Correcting values in tuples is typically performed by a minimum cos ..."
Abstract
- Add to MetaCart
statistical error model learned from the noisy database directly. We thus avoid the necessity for a domain expert or clean master data. We also show how to efficiently perform consistent query answering using this model over a dirty database, in case write permissions to the database are unavailable. We
Materials for an exploratory theory of the network society.
- The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract
-
Cited by 122 (0 self)
- Add to MetaCart
are socially and ecologically constrained, and, at the same time, biologically and culturally able of innovation. Meaning is produced, reproduced, and fought over in all layers of social structure, in production as in consumption, in experience as in power. What makes sense to anyone is de ned by the endless
Synthesizing structured text from logical database subsets. EDBT
, 2008
"... ABSTRACT In the classical database world, information access has been based on a paradigm that involves structured, schema-aware, queries and tabular answers. In the current environment, however, where information prevails in most activities of society, serving people, applications, and devices in ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
to keyword queries. In this paper, we continue in the same direction and propose synthesizing textual answers in response to queries of any kind over structured data. In particular, we study the transformation of a dynamically-generated logical database subset into a narrative through a customizable
RANKED SEARCH OVER STRUCTURED AND SEMI-STRUCTURED DATA
, 2007
"... Traditionally, relational database systems have been designed for precise queries over structured data, while information retrieval systems have been designed for more flexible ranked keyword search queries over unstructured (text) data. How-ever, many new and emerging applications require data mana ..."
Abstract
- Add to MetaCart
Traditionally, relational database systems have been designed for precise queries over structured data, while information retrieval systems have been designed for more flexible ranked keyword search queries over unstructured (text) data. How-ever, many new and emerging applications require data
Results 1 - 10
of
330