Foundations of Language Processing
Languages, formal or natural, permeate our intellectual and practical lives. When agents, computer or human, wish to record something, they must encode it in some type of language. Languages are defined by syntactic rules or constraints and are typically associated with some type of semantics or meaning.
Dr. Johanna BjörklundThe research group Foudations of Language Processing (FLP) studies the theoretical and practical aspects of representing languages on computers. The work of the group spans from the theoretical analysis of formal languages as a theoretical basis for XML and linguistic applications to the practical implementation and evaluation of natural language interfaces.
- Dr. Suna Bensch
- Dr. Martin Berglund
- Dr. Henrik Björklund
- Dr. Johanna Björklund
- Dr. Loek Cleophas
- Yonas Demeke
- Prof. Frank Drewes
- Petter Ericsson
- Johan Granberg
- Dr. Steve Hegner
- Anna Jonsson
- Niklas Zechner
- Automata theory and formal languages
* Automata on trees and similar structures
* Gammatical Inference
* Relation between logics and automata
* Tree automata as a theoretical foundation for XML
- Mathematical and computational linguistics
* Mildly context-senstive grammar formalisms
* Analysis of corpora
- Natural language interfaces
* Learning semantic grammars
* Natural language generation
Some talks held by group members
- F. Drewes. Towards Automata and Grammars that Process DAGs. Department Research Day, 25 Feb. 2015, Department of Computing Science, Umeå University.
- F. Drewes. Graph Transformations for Computational Linguistics. CiE, Jun. 2014, Budapest, Hungary.
- H. Björklund: Natural and Formal Languages – Current Activity, Department research day 26 Mar. 2014, Department of Computing Science, Umeå University.
- H. Björklund: Introduction to Parameterized Complexity Theory, Docent lecture 26 Feb. 2014, Department of Computing Science, Umeå University.
- F. Drewes. Cuts in Regular Expressions. FASTAR/Espresso workshop, Nov. 2013. Stellenbosch, South Africa.
- H. Björklund (with thanks to Wim Martens): Incremental XPath Evaluation, Dagstuhl Seminar on Tree Transducers and Formal Methods 8 May 2013, Schloss Dagstuhl, Germany.
- H. Björklund: On the Parameterized Complexity of Linear Context-Free Rewriting Systems, MOL 9 Aug. 2013, Sofia, Bulgaria.
- H. Björklund: Validity of Tree Pattern Queries With Respect to Schema Information, MFCS Aug. 2013, Wienna, Austria.
- F. Drewes: Millstream Systems and Graph Transformation for Complex Linguistic Models. DCFS, 23. Jul. 2013, London, Canada.
- F. Drewes: The group Natural and Formal Languages – Projects and Research Directions, Research Day 7 Dec. 2012, Department of Computing Science, Umeå University.
- F. Drewes: Some Observations About Reader Languages, FASTAR/Espresso Workshop 29 Oct. 2012, Stellenbosch (South Africa).
Ongoing bachelor and master thesis work
- Johannes Blum is working on his master thesis on DAG automata (supervised by F. Drewes)
- Per Larsson is working together with Henrik on interactive learning of syntax-based text queries.