<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of lirmm-01916104</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-22T13:44:11+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Categorial Proof Nets and Dependency Locality: A New Metric for Linguistic Complexity</title>
            <author role="aut">
              <persName>
                <forename type="first">Mehdi</forename>
                <surname>Mirzapour</surname>
              </persName>
              <email type="md5">0c7f0401414b5c243e40f3e5d3b14504</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">mehdi-mirzapour</idno>
              <idno type="idhal" notation="numeric">169552</idno>
              <idno type="halauthorid" notation="string">42008-169552</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1148-0009</idno>
              <idno type="IDREF">https://www.idref.fr/236517937</idno>
              <affiliation ref="#struct-392245"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Philippe</forename>
                <surname>Prost</surname>
              </persName>
              <email type="md5">6bfbf10058b33ad912f15f9f9d513006</email>
              <email type="domain">univ-amu.fr</email>
              <idno type="idhal" notation="string">jean-philippe-prost</idno>
              <idno type="idhal" notation="numeric">13248</idno>
              <idno type="halauthorid" notation="string">18272-13248</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2804-9191</idno>
              <idno type="IDREF">https://www.idref.fr/146636635</idno>
              <affiliation ref="#struct-392245"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christian</forename>
                <surname>Retoré</surname>
              </persName>
              <email type="md5">e4ea8b28ffe31d6caf314bc54d6d0598</email>
              <email type="domain">lirmm.fr</email>
              <idno type="idhal" notation="string">christian-retore</idno>
              <idno type="idhal" notation="numeric">578</idno>
              <idno type="halauthorid" notation="string">23433-578</idno>
              <idno type="ARXIV">https://arxiv.org/a/retore_c_1</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2401-9158</idno>
              <idno type="IDREF">https://www.idref.fr/076006913</idno>
              <affiliation ref="#struct-392245"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Christian</forename>
                <surname>Retoré</surname>
              </persName>
              <email type="md5">e4ea8b28ffe31d6caf314bc54d6d0598</email>
              <email type="domain">lirmm.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-11-08 11:32:04</date>
              <date type="whenModified">2025-03-20 03:27:54</date>
              <date type="whenReleased">2018-12-10 12:18:08</date>
              <date type="whenProduced">2018-08-28</date>
              <date type="whenEndEmbargoed">2018-12-10</date>
              <ref type="file" target="https://hal-lirmm.ccsd.cnrs.fr/lirmm-01916104v1/document">
                <date notBefore="2018-12-10"/>
              </ref>
              <ref type="file" n="1" target="https://hal-lirmm.ccsd.cnrs.fr/lirmm-01916104v1/file/FULLTEXT01%20pages%2073%20-%2086.pdf" id="file-1916104-1974779">
                <date notBefore="2018-12-10"/>
              </ref>
              <ref type="annex" n="0" target="https://hal-lirmm.ccsd.cnrs.fr/lirmm-01916104v1/file/MehdiMirzapour-LACompLing2018-CPN-DLT.pdf" id="file-1916104-1974778">
                <date notBefore="2018-11-08"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="106815">
                <persName>
                  <forename>Christian</forename>
                  <surname>Retoré</surname>
                </persName>
                <email type="md5">e4ea8b28ffe31d6caf314bc54d6d0598</email>
                <email type="domain">lirmm.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">lirmm-01916104</idno>
            <idno type="halUri">https://hal-lirmm.ccsd.cnrs.fr/lirmm-01916104</idno>
            <idno type="halBibtex">mirzapour:lirmm-01916104</idno>
            <idno type="halRefHtml">&lt;i&gt;LACompLing: Logic and Algorithms in Computational Linguistics&lt;/i&gt;, Aug 2018, Stockholm, Sweden. pp.73-86</idno>
            <idno type="halRef">LACompLing: Logic and Algorithms in Computational Linguistics, Aug 2018, Stockholm, Sweden. pp.73-86</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1916104-1974779"/><ref corresp="#file-1916104-1974778"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="TEXTE" corresp="LIRMM">Exploration et Exploitation de Données Textuelles</idno>
            <idno type="stamp" n="LIRMM">Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</idno>
            <idno type="stamp" n="MIPS">Mathématiques, Informatique, Physique et Systèmes</idno>
            <idno type="stamp" n="UNIV-MONTPELLIER">Université de Montpellier</idno>
            <idno type="stamp" n="UM-2015-2021" corresp="UNIV-MONTPELLIER">Université de Montpellier (2015-2021)</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Categorial Proof Nets and Dependency Locality: A New Metric for Linguistic Complexity</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Mehdi</forename>
                    <surname>Mirzapour</surname>
                  </persName>
                  <email type="md5">0c7f0401414b5c243e40f3e5d3b14504</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">mehdi-mirzapour</idno>
                  <idno type="idhal" notation="numeric">169552</idno>
                  <idno type="halauthorid" notation="string">42008-169552</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1148-0009</idno>
                  <idno type="IDREF">https://www.idref.fr/236517937</idno>
                  <affiliation ref="#struct-392245"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Philippe</forename>
                    <surname>Prost</surname>
                  </persName>
                  <email type="md5">6bfbf10058b33ad912f15f9f9d513006</email>
                  <email type="domain">univ-amu.fr</email>
                  <idno type="idhal" notation="string">jean-philippe-prost</idno>
                  <idno type="idhal" notation="numeric">13248</idno>
                  <idno type="halauthorid" notation="string">18272-13248</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2804-9191</idno>
                  <idno type="IDREF">https://www.idref.fr/146636635</idno>
                  <affiliation ref="#struct-392245"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christian</forename>
                    <surname>Retoré</surname>
                  </persName>
                  <email type="md5">e4ea8b28ffe31d6caf314bc54d6d0598</email>
                  <email type="domain">lirmm.fr</email>
                  <idno type="idhal" notation="string">christian-retore</idno>
                  <idno type="idhal" notation="numeric">578</idno>
                  <idno type="halauthorid" notation="string">23433-578</idno>
                  <idno type="ARXIV">https://arxiv.org/a/retore_c_1</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2401-9158</idno>
                  <idno type="IDREF">https://www.idref.fr/076006913</idno>
                  <affiliation ref="#struct-392245"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Symposium on Logic and Algorithms in Computational Linguistics</title>
                <meeting>
                  <title>LACompLing: Logic and Algorithms in Computational Linguistics</title>
                  <date type="start">2018-08-28</date>
                  <date type="end">2018-08-31</date>
                  <settlement>Stockholm</settlement>
                  <country key="SE">Sweden</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">73-86</biblScope>
                  <date type="datePub">2018</date>
                </imprint>
              </monogr>
              <ref target="http://su.diva-portal.org/smash/record.jsf?pid=diva2%3A1250462&amp;dswid=6746" type="seeAlso"/>
              <ref type="publisher">http://staff.math.su.se/rloukanova/LACompLing2018-web/</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Human processing</term>
                <term xml:lang="en">Computational linguistics</term>
                <term xml:lang="en">Computer science</term>
                <term xml:lang="en">Mathematics</term>
                <term xml:lang="en">Logic</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-cl">Computer Science [cs]/Computation and Language [cs.CL]</classCode>
              <classCode scheme="halDomain" n="info.info-tt">Computer Science [cs]/Document and Text Processing</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>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.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-392245" status="OLD">
          <orgName>Exploration et exploitation de données textuelles</orgName>
          <orgName type="acronym">TEXTE</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>LIRMM, 161 rue Ada, 34000 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr/equipes/TEXTE/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-181" type="direct"/>
            <relation name="UMR5506" active="#struct-410122" type="indirect"/>
            <relation name="UMR5506" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-181" status="OLD">
          <idno type="IdRef">139590827</idno>
          <idno type="ISNI">0000000405990488</idno>
          <idno type="RNSR">199111950H</idno>
          <idno type="ROR">https://ror.org/013yean28</idno>
          <orgName>Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</orgName>
          <orgName type="acronym">LIRMM</orgName>
          <date type="start">1995-01-01</date>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>161 rue Ada - 34095 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR5506" active="#struct-410122" type="direct"/>
            <relation name="UMR5506" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-410122" status="OLD">
          <idno type="ISNI">0000000120970141</idno>
          <idno type="ROR">https://ror.org/051escj72</idno>
          <orgName>Université de Montpellier</orgName>
          <orgName type="acronym">UM</orgName>
          <date type="end">2021-12-31</date>
          <desc>
            <address>
              <addrLine>163 rue Auguste Broussonnet - 34090 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.umontpellier.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>