Categorial Proof Nets and Dependency Locality: A New Metric for Linguistic Complexity - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2018

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

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.
Fichier principal
Vignette du fichier
FULLTEXT01 pages 73 - 86.pdf (841.45 Ko) Télécharger le fichier
MehdiMirzapour-LACompLing2018-CPN-DLT.pdf (2.6 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01916104 , version 1 (08-11-2018)

Identifiers

  • HAL Id : lirmm-01916104 , version 1

Cite

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⟩
121 View
87 Download

Share

Gmail Facebook X LinkedIn More