Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Proceedings of the Symposium on Logic and Algorithms in Computational Linguistics 2018 (LACompLing2018)
University of Gothenburg, Sweden.
Goethe University, Germany.
Stockholms universitet, Naturvetenskapliga fakulteten, Matematiska institutionen. Stockholms universitet, Humanistiska fakulteten, Filosofiska institutionen.ORCID-id: 0000-0001-9678-955X
Utrecht University, The Netherlands.
Vise andre og tillknytning
2018 (engelsk)Konferanseproceedings (Fagfellevurdert)
Abstract [en]

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.

sted, utgiver, år, opplag, sider
Stockholm: Stockholm University, 2018. , s. 102
Emneord [en]
logic, mathematics, computer science, computational linguistics
HSV kategori
Identifikatorer
URN: urn:nbn:se:su:diva-160428OAI: oai:DiVA.org:su-160428DiVA, id: diva2:1250462
Konferanse
The Symposium on Logic and Algorithms in Computational Linguistics 2018 (LACompLing2018), Stockholm, Sweden, August 28–31, 2018
Tilgjengelig fra: 2018-09-24 Laget: 2018-09-24 Sist oppdatert: 2025-02-01bibliografisk kontrollert

Open Access i DiVA

fulltext(1705 kB)1086 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 1705 kBChecksum SHA-512
783e1aa96c78073616359d5ef23192240e9a171917a11a96333ea1ee95279bc8d1c3cf71e8fc581641f10bbf8e67db50620c02f9eae8b087f3507c9aa90459c6
Type fulltextMimetype application/pdf

Person

Loukanova, Roussanka

Søk i DiVA

Av forfatter/redaktør
Loukanova, Roussanka
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 1096 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 2648 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf