Diamonds Are Forever: Theoretical and Empirical Support for a Dependency-Enhanced Type Logic

Michael Moortgat; Konstantinos Kogkalidis; Gijs Wijnholds

doi:10.1007/978-3-031-21780-7_3

Diamonds Are Forever: Theoretical and Empirical Support for a Dependency-Enhanced Type Logic

Michael Moortgat^*, Konstantinos Kogkalidis, Gijs Wijnholds

^*Corresponding author for this work

ILS - Language, logic and information

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

Abstract

Extended Lambek calculi enlarge the type language with adjoint pairs of unary modalities. In previous work, modalities have been used as licensors for controlled forms of restructuring, reordering and copying. Here, we study a complementary use of the modalities as dependency features coding for grammatical roles. The result is a multidimensional type logic simultaneously inducing dependency and function argument structure on the linguistic material. We discuss the new perspective on constituent structure suggested by the dependency-enhanced type logic, and we experimentally evaluate how well a neural language model like BERT can deal with the subtle interplay between logical and structural reasoning that this type logic gives rise to.

Original language	English
Title of host publication	Logic and Algorithms in Computational Linguistics, LACompLing 2021
Editors	Roussanka Loukanova, Peter LeFanu Lumsdaine, Reinhard Muskens
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	57-87
Number of pages	31
ISBN (Print)	9783031217791
DOIs	https://doi.org/10.1007/978-3-031-21780-7_3
Publication status	Published - 2023
Event	Symposium on Logic and Algorithms in Computational Linguistics, LACompLing 2021 - Virtual, Online Duration: 13 Dec 2021 → 17 Dec 2021

Publication series

Name	Studies in Computational Intelligence
Volume	1081
ISSN (Print)	1860-949X
ISSN (Electronic)	1860-9503

Conference

Conference	Symposium on Logic and Algorithms in Computational Linguistics, LACompLing 2021
City	Virtual, Online
Period	13/12/21 → 17/12/21

Bibliographical note

Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Keywords

Dependency modalities
Lambek calculus
Neural language models
Probing
Typelogical grammar

Access to Document

10.1007/978-3-031-21780-7_3

978-3-031-21780-7_3Final published version, 641 KBLicence: Taverne

Cite this

Moortgat, M., Kogkalidis, K., & Wijnholds, G. (2023). Diamonds Are Forever: Theoretical and Empirical Support for a Dependency-Enhanced Type Logic. In R. Loukanova, P. L. Lumsdaine, & R. Muskens (Eds.), Logic and Algorithms in Computational Linguistics, LACompLing 2021 (pp. 57-87). (Studies in Computational Intelligence; Vol. 1081). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-21780-7_3

Moortgat, Michael ; Kogkalidis, Konstantinos ; Wijnholds, Gijs. / Diamonds Are Forever : Theoretical and Empirical Support for a Dependency-Enhanced Type Logic. Logic and Algorithms in Computational Linguistics, LACompLing 2021. editor / Roussanka Loukanova ; Peter LeFanu Lumsdaine ; Reinhard Muskens. Springer Science and Business Media Deutschland GmbH, 2023. pp. 57-87 (Studies in Computational Intelligence).

@inproceedings{834476bab5834fed9283e5cc20dadda4,

title = "Diamonds Are Forever: Theoretical and Empirical Support for a Dependency-Enhanced Type Logic",

abstract = "Extended Lambek calculi enlarge the type language with adjoint pairs of unary modalities. In previous work, modalities have been used as licensors for controlled forms of restructuring, reordering and copying. Here, we study a complementary use of the modalities as dependency features coding for grammatical roles. The result is a multidimensional type logic simultaneously inducing dependency and function argument structure on the linguistic material. We discuss the new perspective on constituent structure suggested by the dependency-enhanced type logic, and we experimentally evaluate how well a neural language model like BERT can deal with the subtle interplay between logical and structural reasoning that this type logic gives rise to.",

keywords = "Dependency modalities, Lambek calculus, Neural language models, Probing, Typelogical grammar",

author = "Michael Moortgat and Konstantinos Kogkalidis and Gijs Wijnholds",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; Symposium on Logic and Algorithms in Computational Linguistics, LACompLing 2021 ; Conference date: 13-12-2021 Through 17-12-2021",

year = "2023",

doi = "10.1007/978-3-031-21780-7_3",

language = "English",

isbn = "9783031217791",

series = "Studies in Computational Intelligence",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "57--87",

editor = "Roussanka Loukanova and Lumsdaine, {Peter LeFanu} and Reinhard Muskens",

booktitle = "Logic and Algorithms in Computational Linguistics, LACompLing 2021",

address = "Germany",

}

Moortgat, M , Kogkalidis, K & Wijnholds, G 2023, Diamonds Are Forever: Theoretical and Empirical Support for a Dependency-Enhanced Type Logic. in R Loukanova, PL Lumsdaine & R Muskens (eds), Logic and Algorithms in Computational Linguistics, LACompLing 2021. Studies in Computational Intelligence, vol. 1081, Springer Science and Business Media Deutschland GmbH, pp. 57-87, Symposium on Logic and Algorithms in Computational Linguistics, LACompLing 2021, Virtual, Online, 13/12/21. https://doi.org/10.1007/978-3-031-21780-7_3

Diamonds Are Forever: Theoretical and Empirical Support for a Dependency-Enhanced Type Logic. / Moortgat, Michael ; Kogkalidis, Konstantinos ; Wijnholds, Gijs.
Logic and Algorithms in Computational Linguistics, LACompLing 2021. ed. / Roussanka Loukanova; Peter LeFanu Lumsdaine; Reinhard Muskens. Springer Science and Business Media Deutschland GmbH, 2023. p. 57-87 (Studies in Computational Intelligence; Vol. 1081).

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

TY - GEN

T1 - Diamonds Are Forever

T2 - Symposium on Logic and Algorithms in Computational Linguistics, LACompLing 2021

AU - Moortgat, Michael

AU - Kogkalidis, Konstantinos

AU - Wijnholds, Gijs

PY - 2023

Y1 - 2023

N2 - Extended Lambek calculi enlarge the type language with adjoint pairs of unary modalities. In previous work, modalities have been used as licensors for controlled forms of restructuring, reordering and copying. Here, we study a complementary use of the modalities as dependency features coding for grammatical roles. The result is a multidimensional type logic simultaneously inducing dependency and function argument structure on the linguistic material. We discuss the new perspective on constituent structure suggested by the dependency-enhanced type logic, and we experimentally evaluate how well a neural language model like BERT can deal with the subtle interplay between logical and structural reasoning that this type logic gives rise to.

AB - Extended Lambek calculi enlarge the type language with adjoint pairs of unary modalities. In previous work, modalities have been used as licensors for controlled forms of restructuring, reordering and copying. Here, we study a complementary use of the modalities as dependency features coding for grammatical roles. The result is a multidimensional type logic simultaneously inducing dependency and function argument structure on the linguistic material. We discuss the new perspective on constituent structure suggested by the dependency-enhanced type logic, and we experimentally evaluate how well a neural language model like BERT can deal with the subtle interplay between logical and structural reasoning that this type logic gives rise to.

KW - Dependency modalities

KW - Lambek calculus

KW - Neural language models

KW - Probing

KW - Typelogical grammar

UR - http://www.scopus.com/inward/record.url?scp=85151085620&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-21780-7_3

DO - 10.1007/978-3-031-21780-7_3

M3 - Conference contribution

AN - SCOPUS:85151085620

SN - 9783031217791

T3 - Studies in Computational Intelligence

SP - 57

EP - 87

BT - Logic and Algorithms in Computational Linguistics, LACompLing 2021

A2 - Loukanova, Roussanka

A2 - Lumsdaine, Peter LeFanu

A2 - Muskens, Reinhard

PB - Springer Science and Business Media Deutschland GmbH

Y2 - 13 December 2021 through 17 December 2021

ER -

Moortgat M , Kogkalidis K , Wijnholds G. Diamonds Are Forever: Theoretical and Empirical Support for a Dependency-Enhanced Type Logic. In Loukanova R, Lumsdaine PL, Muskens R, editors, Logic and Algorithms in Computational Linguistics, LACompLing 2021. Springer Science and Business Media Deutschland GmbH. 2023. p. 57-87. (Studies in Computational Intelligence). doi: 10.1007/978-3-031-21780-7_3

Diamonds Are Forever: Theoretical and Empirical Support for a Dependency-Enhanced Type Logic

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this