Sentence examples for arbitrary database from inspiring English sources

The rule language is based on arbitrary database state transitions rather than tupleor statement-level changes, yielding a clear and flexible execution semantics.

Our contention is that the idea of an automatically generated schema graph allows us to map natural language queries to SQL queries over arbitrary database scheme.

The novelty of our approach is in the generation procedure of the schema graph that embodies the semantic relationship in a conceptual ontology in terms of an arbitrary database scheme in a user transparent way.

The plug-in introduced in this paper is generic and facilitates connecting user selected natural language interfaces to arbitrary databases using a semantic description of the intended application.

In this paper, our goal is to propose a semantic correspondence plug-in to aid natural language query processing over arbitrary biological database schema with an aim to providing cooperative responses to queries tailored to users' interpretations.

Moreover, the assignment of genes to functions is still a largely unfinished task and the boundaries of pathway definitions are arbitrary: one database might include a set of genes within a specific signaling pathway while another would split this into two separate pathways.

It ensures a good scalability for arbitrary complex databases and an instantaneous performance gain on better hardware.

The reason for this approach is that for arbitrary speech databases or in realistic conversation situations, it is not feasible to determine the optimal parameters a priori since no reference data is available in real time.

The diverse reference shapes used in this work (see Additional files1 and 2) should be useful in helping create the initial reference shapes required to implement this method for arbitrary conformer databases.

Static analysis methods are en for determining whether arbitrary sets of database production rules are (1) guaranteed to terminate; (2) guaranteed to produce a unique final database state; (3) guaranteed to produce a unique stream of observable actions.

Important features that distinguish these tools include web-based versus stand-alone versions, allowing the use of an arbitrary germline segment database, computing time, the quality of D segment calls, allowing multiple D segments in a single rearrangement, allowing inverted or no D segments, and the availability of source code.