Explainable lexical entailment with semantic graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3AYTUIB3G3" target="_blank" >RIV/00216208:11320/22:YTUIB3G3 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/23:TKQPFYTR
Result on the web
<a href="https://www.cambridge.org/core/journals/natural-language-engineering/article/explainable-lexical-entailment-with-semantic-graphs/96A9C7F5B30D7DD5A955B54D9AF8ADF4" target="_blank" >https://www.cambridge.org/core/journals/natural-language-engineering/article/explainable-lexical-entailment-with-semantic-graphs/96A9C7F5B30D7DD5A955B54D9AF8ADF4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1017/S1351324922000092" target="_blank" >10.1017/S1351324922000092</a>
Alternative languages
Result language
angličtina
Original language name
Explainable lexical entailment with semantic graphs
Original language description
We present novel methods for detecting lexical entailment in a fully rule-based and explainable fashion, by automatic construction of semantic graphs, in any language for which a crowd-sourced dictionary with sufficient coverage and a dependency parser of sufficient accuracy are available. We experiment and evaluate on both the Semeval-2020 lexical entailment task (Glavaš et al. (2020). Proceedings of the Fourteenth Workshop on Semantic Evaluation, pp. 24–35) and the SherLIiC lexical inference dataset of typed predicates (Schmitt and Schütze (2019). Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pp. 902–914). Combined with top-performing systems, our method achieves improvements over the previous state-of-the-art on both benchmarks. As a standalone system, it offers a fully interpretable model of lexical entailment that makes detailed error analysis possible, uncovering future directions for improving both the semantic parsing method and the inference process on semantic graphs. We release all components of our system as open source software.
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
—
Continuities
—
Others
Publication year
2022
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
Natural Language Engineering
ISSN
1351-3249
e-ISSN
1469-8110
Volume of the periodical
—
Issue of the periodical within the volume
2022-2-28
Country of publishing house
GB - UNITED KINGDOM
Number of pages
24
Pages from-to
1-24
UT code for WoS article
000762096000001
EID of the result in the Scopus database
2-s2.0-85125792088