Expressive and flexible access to web-extracted data

Pound, Jeffrey; Ilyas, Ihab F.; Weddell, Grant E.

doi:10.1145/1807167.1807214

Cited by 41 publications

(35 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Knowledge Base Mapping Semantically annotated keyword queries can be combined with a structured query template to form a structured representation of the keyword query known as a structured keyword query. We extend an existing approach [18] to map structured keyword queries into concept search queries.…”

Section: Solution Overviewmentioning

confidence: 99%

“…This type of expression is called a structured keyword query, and methods to map these expressions into Web knowledge bases have been developed [18]. The method proposed in [18] first generates a list of possible KB items for each keyword phrase in the query.…”

Section: From Structures To Kb Interpretationsmentioning

confidence: 99%

“…The method proposed in [18] first generates a list of possible KB items for each keyword phrase in the query. These items are sorted by syntactic similarity, forming ordered input lists.…”

Section: From Structures To Kb Interpretationsmentioning

confidence: 99%

“…In this work we extend the the method proposed in [18] in order to support the class of query structures discovered in our query log analysis. Our variation of structured keyword queries is given by the following grammar.…”

Section: From Structures To Kb Interpretationsmentioning

confidence: 99%

“…For this construct we must consider all possible relations in the knowledge base. We accomplish this by modifying the top-k algorithm used in [18] to dynamically add all relations that have non-zero knowledge base support to any KB item in adjacent input lists. We also add support to the underlying KB formalism to account for inverse relations and an explicit model of attributes.…”

Section: From Structures To Kb Interpretationsmentioning

confidence: 99%

See 4 more Smart Citations

Interpreting keyword queries over web knowledge bases

Pound

Hudek

Ilyas

et al. 2012

Proceedings of the 21st ACM International Conference on Information and Knowledge Management

Self Cite

View full text Add to dashboard Cite

Many keyword queries issued to Web search engines target information about real world entities, and interpreting these queries over Web knowledge bases can often enable the search system to provide exact answers to queries. Equally important is the problem of detecting when the reference knowledge base is not capable of answering the keyword query, due to lack of domain coverage.In this work we present an approach to computing structured representations of keyword queries over a reference knowledge base. We mine frequent query structures from a Web query log and map these structures into a reference knowledge base. Our approach exploits coarse linguistic structure in keyword queries, and combines it with rich structured query representations of information needs.

show abstract

Section: Solution Overviewmentioning

confidence: 99%

Section: From Structures To Kb Interpretationsmentioning

confidence: 99%

“…The method proposed in [18] first generates a list of possible KB items for each keyword phrase in the query. These items are sorted by syntactic similarity, forming ordered input lists.…”

Section: From Structures To Kb Interpretationsmentioning

confidence: 99%

Section: From Structures To Kb Interpretationsmentioning

confidence: 99%

Section: From Structures To Kb Interpretationsmentioning

confidence: 99%

See 3 more Smart Citations

Interpreting keyword queries over web knowledge bases

Pound

Hudek

Ilyas

et al. 2012

Proceedings of the 21st ACM International Conference on Information and Knowledge Management

Self Cite

View full text Add to dashboard Cite

show abstract

Ontology-Based Spelling Suggestion for RDF Keyword Search

Wang

2014

Conceptual Modeling

View full text Add to dashboard Cite

On the Marriage of SPARQL and Keywords

Peng

Zou

Zhao

2015

Web Technologies and Applications

View full text Add to dashboard Cite

Although SPARQL has been the predominant query language over RDF graphs, some query intentions cannot be well captured by only using SPARQL syntax. On the other hand, the keyword search enjoys widespread usage because of its intuitive way of specifying information needs but suffers from the problem of low precision. To maximize the advantages of both SPARQL and keyword search, we introduce a novel paradigm that combines both of them and propose a hybrid query (called an SK query) that integrates SPARQL and keyword search. In order to answer SK queries efficiently, a structural index is devised, based on a novel integrated query algorithm is proposed. We evaluate our method in large real RDF graphs and experiments demonstrate both effectiveness and efficiency of our method.

show abstract

Expressive and flexible access to web-extracted data

Cited by 41 publications

References 17 publications

Interpreting keyword queries over web knowledge bases

Interpreting keyword queries over web knowledge bases

Ontology-Based Spelling Suggestion for RDF Keyword Search

On the Marriage of SPARQL and Keywords

Contact Info

Product

Resources

About