Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Proceedings of the Symposium Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021)
Stockholm University, Faculty of Science, Department of Mathematics.
Stockholm University, Faculty of Science, Department of Mathematics.ORCID iD: 0000-0003-1390-2970
2021 (English)Conference proceedings (editor) (Other academic)
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 1950s, 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 2021 (LACompLing2021) assesses the place of logic, mathematics, and computer science in present day computational linguistics. It is a forum for presenting new results as well as work in progress.

Place, publisher, year, edition, pages
Stockholm University, 2021. , p. 42
Keywords [en]
Computational Linguistics, Mathematical Linguistics
National Category
Language Technology (Computational Linguistics) Algebra and Logic General Language Studies and Linguistics
Research subject
Computational Linguistics
Identifiers
URN: urn:nbn:se:su:diva-200167OAI: oai:DiVA.org:su-200167DiVA, id: diva2:1623904
Conference
Logic and Algorithms in Computational Linguistics (LACompLing 2021), online, December 15-17, 2021
Available from: 2021-12-31 Created: 2021-12-31 Last updated: 2022-01-03Bibliographically approved

Open Access in DiVA

Proceedings-LACompLing-2021(760 kB)578 downloads
File information
File name FULLTEXT02.pdfFile size 760 kBChecksum SHA-512
91fe001843eddc6f320f195908a42e5409a07f9da5782acbce64592ecba05fe53acde73c6039edb9b865a890b365953e461f3bdae5adb7a1a00364395fea147d
Type fulltextMimetype application/pdf

Other links

Conference webpage

Authority records

Ljungström, AxelLumsdaine, Peter LeFanu

Search in DiVA

By author/editor
Ljungström, AxelLumsdaine, Peter LeFanu
By organisation
Department of Mathematics
Language Technology (Computational Linguistics)Algebra and LogicGeneral Language Studies and Linguistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 579 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 822 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf