Towards a Wide-coverage Tableau Method for Natural Logic

Lasha Abzianidze

doi:10.1007/978-3-662-48119-6

Towards a Wide-coverage Tableau Method for Natural Logic

Lasha Abzianidze

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

330 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 language	English
Title of host publication	New Frontiers in Artificial Intelligence
Subtitle of host publication	JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers
Editors	Tsuyoshi Murata, Koji Mineshima, Daisuke Bekki
Publisher	Springer Verlag
Number of pages	16
Volume	9067
ISBN (Electronic)	9783662481196
ISBN (Print)	9783662481189
DOIs	https://doi.org/10.1007/978-3-662-48119-6
Publication status	Published - 2015

Publication series

Name	Lecture Notes in Artificial Intelligence

Access to Document

10.1007/978-3-662-48119-6

full paper LENLSAccepted author manuscript, 393 KB

Cite this

@inproceedings{b3050abb4f694deba4a77592a1adac2c,

title = "Towards a Wide-coverage Tableau Method for Natural Logic",

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%.",

author = "Lasha Abzianidze",

year = "2015",

doi = "10.1007/978-3-662-48119-6",

language = "English",

isbn = "9783662481189",

volume = "9067",

series = "Lecture Notes in Artificial Intelligence",

publisher = "Springer Verlag",

editor = "Tsuyoshi Murata and Koji Mineshima and Bekki, {Daisuke }",

booktitle = "New Frontiers in Artificial Intelligence",

address = "Germany",

}

Towards a Wide-coverage Tableau Method for Natural Logic. / Abzianidze, Lasha.
New Frontiers in Artificial Intelligence: JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers. ed. / Tsuyoshi Murata; Koji Mineshima; Daisuke Bekki. Vol. 9067 Springer Verlag, 2015. (Lecture Notes in Artificial Intelligence).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Towards a Wide-coverage Tableau Method for Natural Logic

AU - Abzianidze, Lasha

PY - 2015

Y1 - 2015

N2 - 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%.

AB - 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%.

U2 - 10.1007/978-3-662-48119-6

DO - 10.1007/978-3-662-48119-6

M3 - Conference contribution

SN - 9783662481189

VL - 9067

T3 - Lecture Notes in Artificial Intelligence

BT - New Frontiers in Artificial Intelligence

A2 - Murata, Tsuyoshi

A2 - Mineshima, Koji

A2 - Bekki, Daisuke

PB - Springer Verlag

ER -

Towards a Wide-coverage Tableau Method for Natural Logic

Abstract

Publication series

Access to Document

Fingerprint

Cite this