Searcharxiv⌕ Search

arXiv subjects

Kushal Shah

Publications and source records attributed to Kushal Shah.

23 records · Page 2Linked to original sources
arXiv2013

Description Logics based Formalization of Wh-Queries

The problem of Natural Language Query Formalization (NLQF) is to translate a given user query in natural language (NL) into a formal language so that the semantic interpretation has equivalence with the NL interpretation. Formalization of NL queries enables logic based reasoning during information retrieval, database query, question-answering, etc. Formalization also helps in Web query normalization and indexing, query intent analysis, etc. In this paper we are proposing a Description Logics based formal methodology for wh-query intent (also called desire) identification and corresponding formal translation. We evaluated the scalability of our proposed formalism using Microsoft Encarta 98 query dataset and OWL-S TC v.4.0 dataset.

cs.CL↗
arXiv2013

DLOLIS-A: Description Logic based Text Ontology Learning

Ontology Learning has been the subject of intensive study for the past decade. Researchers in this field have been motivated by the possibility of automatically building a knowledge base on top of text documents so as to support reasoning based knowledge extraction. While most works in this field have been primarily statistical (known as light-weight Ontology Learning) not much attempt has been made in axiomatic Ontology Learning (called heavy-weight Ontology Learning) from Natural Language text documents. Heavy-weight Ontology Learning supports more precise formal logic-based reasoning when compared to statistical ontology learning. In this paper we have proposed a sound Ontology Learning tool DLOL_(IS-A) that maps English language IS-A sentences into their equivalent Description Logic (DL) expressions in order to automatically generate a consistent pair of T-box and A-box thereby forming both regular (definitional form) and generalized (axiomatic form) DL ontology. The current scope of the paper is strictly limited to IS-A sentences that exclude the possible structures of: (i) implicative IS-A sentences, and (ii) "Wh" IS-A questions. Other linguistic nuances that arise out of pragmatics and epistemic of IS-A sentences are beyond the scope of this present work. We have adopted Gold Standard based Ontology Learning evaluation on chosen IS-A rich Wikipedia documents.

cs.AI↗
arXiv2010

The sinusoid and the phasor

Mathieu equation is widely used to study several natural phenomenon. In this paper, we show that replacing the sinusoid in the Mathieu equation with a phasor can lead to solutions that behave in a totally different way. Solutions of Mathieu equation are either bounded or grow unboundedly at an exponential rate. Solutions of this new equation are always unbounded and grow linearly with time.

physics.plasm-ph↗
arXiv2010

Asymptotic predictions using short-time data in oscillating billiards

Particle motion in a smoothly oscillating non-integrable billiard is known to result in unbounded energy growth. Though the asymptotic energy growth rate of an ensemble of particles in an oscillating chaotic billiard is known to be quadratic, there are no estimates available for smoothly oscillating pseudo-integrable billiards. The energy growth rate in such systems is so slow that it is very hard to predict the asymptotic rates from finite time computations. In this paper, a method is proposed to estimate the asymptotic energy growth rate in a system by using short-time data. The idea is applied to the case of an oscillating pseudo-integrable system, and it is shown that the asymptotic energy growth rate in such systems could be exponential.

physics.plasm-ph↗