All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Analysis of time references in natural language by means of Transparent Intensional Logic

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10236202" target="_blank" >RIV/61989100:27240/18:10236202 - isvavai.cz</a>

  • Result on the web

    <a href="http://klemens.sav.sk/fiusav/organon/?q=sk/analysis-time-references-natural-language-means-transparent-intensional-logic" target="_blank" >http://klemens.sav.sk/fiusav/organon/?q=sk/analysis-time-references-natural-language-means-transparent-intensional-logic</a>

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Analysis of time references in natural language by means of Transparent Intensional Logic

  • Original language description

    In this paper, we deal with sentences containing time references like &apos;five years ago&apos;, &apos;three years older&apos;, &apos;in five seconds&apos;. It turns out that such sentences are pragmatically incomplete, because there is an elliptic reference to a calendar that makes it possible to determine the length of the time interval associated with a time duration like a year, month, day, or to compute the time interval denoted by terms like &apos;February 29, 2016&apos;. Since Transparent Intensional Logic (TIL) takes into account two modal parameters, namely possible worlds of type  and times of type , and this system is particularly apt for the analysis of natural language expressions, our background theory is TIL. Within this system, we define time intervals, calendar time durations, and last but not least a method for adding and multiplying time durations in a way that takes into account leap days and leap seconds. As sample applications, we analyse two sentences, to wit, &quot;A year has 365 days&quot; and &quot;Adam is 5 years older than Bill&quot;.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA15-13277S" target="_blank" >GA15-13277S: Hyperintensional logic for natural language analysis</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Organon F

  • ISSN

    1335-0668

  • e-ISSN

  • Volume of the periodical

    25

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    SK - SLOVAKIA

  • Number of pages

    20

  • Pages from-to

    21-40

  • UT code for WoS article

    000430264500002

  • EID of the result in the Scopus database

    2-s2.0-85044171112