Categorial Proof Nets and Dependency Locality: A New Metric for Linguistic Complexity

Mehdi Mirzapour 1 Jean-Philippe Prost 1 Christian Retoré 1
1 TEXTE - Exploration et exploitation de données textuelles
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Computational linguistics studies natural language in its various manifestations from a computational point of view, both on the theoretical level (modeling grammar modules dealing with natural language form and meaning, and the relation between these two) and on the practical level (developing applications for language and speech technology). Right from the start in the 1950ties, there have been strong links with computer science, logic, and many areas of mathematics - one can think of Chomsky's contributions to the theory of formal languages and automata, or Lambek's logical modeling of natural language syntax. The symposium on Logic and Algorithms in Computational Linguistics 2018 (LACompLing2018) assesses the place of logic, mathematics, and computer science in present day computational linguistics. It intends to be a forum for presenting new results as well as work in progress.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01916104
Contributor : Christian Retoré <>
Submitted on : Thursday, November 8, 2018 - 11:32:04 AM
Last modification on : Monday, December 10, 2018 - 1:35:56 PM
Long-term archiving on: Saturday, February 9, 2019 - 1:20:07 PM

Identifiers

  • HAL Id : lirmm-01916104, version 1

Collections

Citation

Mehdi Mirzapour, Jean-Philippe Prost, Christian Retoré. Categorial Proof Nets and Dependency Locality: A New Metric for Linguistic Complexity. LACompLing: Logic and Algorithms in Computational Linguistics, Aug 2018, Stockholm, Sweden. pp.73-86. ⟨lirmm-01916104⟩

Share

Metrics

Record views

265

Files downloads

50