Towards a Wide-coverage Tableau Method for Natural Logic

Lasha Abzianidze

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    285 Downloads (Pure)

    Abstract

    The rst step towards a wide-coverage tableau prover for natural logic is presented. We describe an automatized method for obtaining Lambda Logical Forms from surface forms and use this method with an implemented prover to hunt for new tableau rules in textual entailment data sets. The collected tableau rules are presented and their usage is also exemplified in several tableau proofs. The performance of the prover is evaluated against the development data sets. The evaluation results show an extremely high precision above 97% of the prover along with a decent recall around 40%.
    Original languageEnglish
    Title of host publicationNew Frontiers in Artificial Intelligence
    Subtitle of host publicationJSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers
    EditorsTsuyoshi Murata, Koji Mineshima, Daisuke Bekki
    PublisherSpringer Verlag
    Number of pages16
    Volume9067
    ISBN (Electronic)9783662481196
    ISBN (Print)9783662481189
    DOIs
    Publication statusPublished - 2015

    Publication series

    NameLecture Notes in Artificial Intelligence

    Cite this