An Efficient Denotational Semantics for Natural Language Database Queries

Frost, Richard A.; Fortier, Randy

doi:10.1007/978-3-540-73351-5_2

Cited by 7 publications

(5 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Richard Montague, who was one of the first to develop a compositional semantics for English, suggested to treat natural language semantics similar to formal language semantics as purely-functional lambda(λ) expressions where larger expressions are constructed by composing smaller expressions. As the original proposal is computationally intractable, we use an efficient set-theoretic version [10].…”

Section: General Notationmentioning

confidence: 99%

Modular Natural Language Processing Using Declarative Attribute Grammars

Hafiz

Frost

2011

Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

Abstract.A system based on a general top-down parsing algorithm has been developed which allows language processors to be created as executable specifications of arbitrary attribute grammars. Declarative notation of attribute grammars allows modular construction of executable language definitions. Syntax is defined through general context-free grammar rules, and meaning is defined by associated semantic rules with arbitrary dependencies. An innovative technique allows parses to be pruned by arbitrary semantic constraints. This new technique is useful in modelling natural-language phenomena by imposing unification-like restrictions, and accommodating long-distance and cross-serial dependencies, which cannot be handled by context-free rules alone.

show abstract

Section: General Notationmentioning

confidence: 99%

Modular Natural Language Processing Using Declarative Attribute Grammars

Hafiz

Frost

2011

Advances in Artificial Intelligence

Self Cite

View full text Add to dashboard Cite

show abstract

“…The semantics described in this paper is based on NL semantics that we have developed previously for use with conventional databases [7]. That semantics was based on a modified version of Montague Semantics (MS) [6].…”

Section: Introductionmentioning

confidence: 99%

An Event Based Denotational Semantics for Natural Language Queries to Data Represented in Triple Stores

Frost

Amour

Fortier

2013

2013 IEEE Seventh International Conference on Semantic Computing

Self Cite

View full text Add to dashboard Cite

Binary-relational and graph-based databases are more flexible than conventional relational databases because the type of data to be stored does not need to be known in advance. In many implementations of these systems the data is held in a "triple store". This paper presents a new event-based denotational semantics which can be used as the basis for natural-language (NL) query interfaces to triple stores. This paper is also a first step towards an NL semantics which can be used for building NL query interfaces to RDF semantic web data.

show abstract

“…However, this approach failed to deal with quantified queries. More recent works investigated translating natural queries into SQL (Frost and Fortier, 2007). Even though this approach can handle deep semantics in some queries, it required users to submit the queries in the forms whose syntaxes should be "similar" to that of the SQL.…”

Section: Introductionmentioning

confidence: 99%

Semantic-Lite Retrieval on Imprecise and Incomplete Natural Queries Using Conceptual Graphs

Phan¹,

Tho

Pham³

et al. 2011

Proceedings of the 6th International Conference on Software and Database Technologies

View full text Add to dashboard Cite

Many attempts have been made on processing natural queries on relational databases, because this feature should render users virtually no boundary on expression search requests. Recently, research trends on this field have moved from compositional semantics into SQL-oriented processing on natural queries. However, this approach still suffers the problem of imprecise and incomplete information which often occurs when users submit their queries casually in practical situations. In this paper, we show an approach on translating the natural queries into conceptual graphs using semantic information captured by a domain ontology. Due to the well-structured representation of conceptual graph, we can resolve the impreciseness and retrieve the incompleteness when occurring. Experimental results have shown that our approach is quite promising.

show abstract

An Efficient Denotational Semantics for Natural Language Database Queries

Cited by 7 publications

References 16 publications

Modular Natural Language Processing Using Declarative Attribute Grammars

Modular Natural Language Processing Using Declarative Attribute Grammars

An Event Based Denotational Semantics for Natural Language Queries to Data Represented in Triple Stores

Semantic-Lite Retrieval on Imprecise and Incomplete Natural Queries Using Conceptual Graphs

Contact Info

Product

Resources

About