pith. sign in

arxiv: cs/9906020 · v1 · submitted 1999-06-22 · 💻 cs.CL

Temporal Meaning Representations in a Natural Language Front-End

classification 💻 cs.CL
keywords languagetemporalexpressionscalleddatabasesexistingfopllogic-like
0
0 comments X
read the original abstract

Previous work in the context of natural language querying of temporal databases has established a method to map automatically from a large subset of English time-related questions to suitable expressions of a temporal logic-like language, called TOP. An algorithm to translate from TOP to the TSQL2 temporal database language has also been defined. This paper shows how TOP expressions could be translated into a simpler logic-like language, called BOT. BOT is very close to traditional first-order predicate logic (FOPL), and hence existing methods to manipulate FOPL expressions can be exploited to interface to time-sensitive applications other than TSQL2 databases, maintaining the existing English-to-TOP mapping.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.