Publications by Peter Ljunglöf

2016

P. Ljunglöf. Towards interactive correction of speech recognition errors. SLTC'16, 6th Swedish Language Technology Conference, Umeå, Sweden, 2016.

DownloadAbstractBibTeX
In this project we explore how to make quick fixes to simple texts using as few interactions as possible. There are several situations where this could be useful, such as when you are driving (and don't have access to a keyboard), if your device is too small for a proper keyboard (such as a mobile phone), or if you have a communicative disability (e.g., cerebral palsy, visual impairment, or something else). The main contribution of this work is about improving the online interaction for a user who wants to correct speech recognition errors. The actual error correction algorithm that we have used – based on the Levenshtein edit distance – has not been in focus, and can probably be improved substantially.
@inproceedings{Ljunglof2016:Towards-interactive-correction, Address = {Ume{\aa}, Sweden}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {SLTC'16, 6th Swedish Language Technology Conference}, Title = {Towards interactive correction of speech recognition errors}, Year = {2016}, Abstract = {In this project we explore how to make quick fixes to simple texts using as few interactions as possible. There are several situations where this could be useful, such as when you are driving (and don't have access to a keyboard), if your device is too small for a proper keyboard (such as a mobile phone), or if you have a communicative disability (e.g., cerebral palsy, visual impairment, or something else). The main contribution of this work is about improving the online interaction for a user who wants to correct speech recognition errors. The actual error correction algorithm that we have used -- based on the Levenshtein edit distance -- has not been in focus, and can probably be improved substantially.},
2015

Proceedings of SLPAT'15: 6th Workshop on Speech and Language Processing for Assistive Technologies. J. Alexandersson, E. Altinsoy, H. Christensen, P. Ljunglöf, F. Portet, and F. Rudzicz (eds.), SLPAT'15: 6th Workshop on Speech and Language Processing for Assistive Technologies, Association for Computational Linguistics, Dresden, Germany, 2015.

URLBibTeX
@proceedings{AlexanderssonAltinsoyChristensen2013:Proceedings-of-SLPAT15:-6th-Workshop, Address = {Dresden, Germany}, Booktitle = {SLPAT'15: 6th Workshop on Speech and Language Processing for Assistive Technologies}, Editor = {Alexandersson, Jan and Altinsoy, Ercan and Christensen, Heidi and Ljungl{\"o}f, Peter and Portet, Fran{\c c}ois and Rudzicz, Frank}, Keywords = {AAC-AT-CALL}, Publisher = {Association for Computational Linguistics}, Title = {Proceedings of SLPAT'15: 6th Workshop on Speech and Language Processing for Assistive Technologies}, Year = {2015},
2014

P. Ljunglöf. ShrdLite: Semantic parsing using a handmade grammar. SemEval 2014, task 6, Dublin, Ireland, 2014.

DownloadURLAbstractBibTeX
This paper describes my approach for parsing robot commands, which was task 6 at SemEval 2014. My solution is to manually create a compact unification grammar. The grammar is highly ambiguous, and relies heavily on filtering the parse results by checking their consistency with the current world. The grammar is small, consisting of not more than 25 grammatical and 60 lexical rules. The parser uses simple error correction together with a straightforward iterative deepening search. Nevertheless, with these very basic algorithms, the system still managed to get 86.1% correctness on the evaluation data. Even more interesting is that by making the parser slightly more robust, the accuracy of the system rises to 93.5%, and by adding one single word to the lexicon, the accuracy is boosted to 98.0%.
@inproceedings{Ljunglof2014:ShrdLite:-Semantic-parsing, Address = {Dublin, Ireland}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {SemEval 2014, task 6}, Title = {ShrdLite: Semantic parsing using a handmade grammar}, Year = {2014}, Abstract = {This paper describes my approach for parsing robot commands, which was task 6 at SemEval 2014. My solution is to manually create a compact unification grammar. The grammar is highly ambiguous, and relies heavily on filtering the parse results by checking their consistency with the current world. The grammar is small, consisting of not more than 25 grammatical and 60 lexical rules. The parser uses simple error correction together with a straightforward iterative deepening search. Nevertheless, with these very basic algorithms, the system still managed to get 86.1% correctness on the evaluation data. Even more interesting is that by making the parser slightly more robust, the accuracy of the system rises to 93.5%, and by adding one single word to the lexicon, the accuracy is boosted to 98.0%.},
2014

K. Angelov and P. Ljunglöf. Fast Statistical Parsing with Parallel Multiple Context-Free Grammars. EACL'14, 14th Conference of the European Chapter of the Association for Computational Linguistics, Gothenburg, Sweden, 2014.

DownloadURLAbstractBibTeX
We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Grammars (PMCFG). This is an extension of the algorithm by Angelov (2009) to which we added statistical ranking. We show that the new algorithm is several times faster than other statistical PMCFG parsing algorithms on real-sized grammars. At the same time the algorithm is more general since it supports non-binarized and non-linear grammars. We also show that if we make the search heuristics non-admissible, the parsing speed improves even further, at the risk of returning sub-optimal solutions.
@inproceedings{AngelovLjunglof2014:Fast-Statistical-Parsing, Address = {Gothenburg, Sweden}, Author = {Angelov, Krasimir and Ljungl{\"o}f, Peter}, Booktitle = {EACL'14, 14th Conference of the European Chapter of the Association for Computational Linguistics}, Keywords = {parsing}, Title = {Fast Statistical Parsing with Parallel Multiple Context-Free Grammars}, Year = {2014}, Abstract = {We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Grammars (PMCFG). This is an extension of the algorithm by Angelov (2009) to which we added statistical ranking. We show that the new algorithm is several times faster than other statistical PMCFG parsing algorithms on real-sized grammars. At the same time the algorithm is more general since it supports non-binarized and non-linear grammars. We also show that if we make the search heuristics non-admissible, the parsing speed improves even further, at the risk of returning sub-optimal solutions. },
2014

M. Lundälv, S. Derbring, and P. Ljunglöf. AAC Language Resources in the Mainstream. ISAAC-2014 Conference for the International Society for Augmentative and Alternative Communication, Lisbon, Portugal, 2014. Extended abstract.

DownloadAbstractBibTeX
In order to provide language support to individuals requiring augmentative and alternative communication (AAC) we need linguistic resources suitably organized and represented, e.g., sign language material, symbol and image libraries suitable for multiple cognitive levels, as well as textual support in many languages. So far, these resources have been developed and maintained in separate and uncoordinated efforts, either by commercial or non-profit actors, and targeting different specific groups and needs. In the long run, this is a non-inclusive, ineffective and expensive way of proceeding, leading to limited benefit for AAC users and stake-holders, as well as for potential wider application. In a number of related efforts, work is underway to link free symbol libraries (at present Blissymbols and ARASAAC), where applicable using the Concept Coding Framework (CCF) technology, to common state-of-the-art lexical resources and language technology. The aim is to gradually establish a foundation for inclusive AAC support based on, and included in, mainstream and openly available lexical and language resources for wide use in all sectors of society. Following up results in this area from the European AEGIS project, work is now proceeding in cooperation between DART (centre for AAC and AT), Språkbanken (the Swedish Language Bank) and Centre for language Technology (CLT), University of Gothenburg, Sweden, and others. Results from this work will be presented and demonstrated, and the implications will be discussed. These, and several other signs of the time, strongly indicate that this is way to go.
@inproceedings{LundalvDerbringLjunglof2014:AAC-Language-Resources-in-the-Mainstream, Address = {Lisbon, Portugal}, Author = {Lund{\"a}lv, Mats and Derbring, Sandra and Ljungl{\"o}f, Peter}, Booktitle = {ISAAC-2014 Conference for the International Society for Augmentative and Alternative Communication}, Keywords = {AAC-AT-CALL}, Note = {Extended abstract}, Read = {1}, Title = {{AAC} Language Resources in the Mainstream}, Year = {2014}, Abstract = {In order to provide language support to individuals requiring augmentative and alternative communication (AAC) we need linguistic resources suitably organized and represented, e.g., sign language material, symbol and image libraries suitable for multiple cognitive levels, as well as textual support in many languages. So far, these resources have been developed and maintained in separate and uncoordinated efforts, either by commercial or non-profit actors, and targeting different specific groups and needs. In the long run, this is a non-inclusive, ineffective and expensive way of proceeding, leading to limited benefit for AAC users and stake-holders, as well as for potential wider application. In a number of related efforts, work is underway to link free symbol libraries (at present Blissymbols and ARASAAC), where applicable using the Concept Coding Framework (CCF) technology, to common state-of-the-art lexical resources and language technology. The aim is to gradually establish a foundation for inclusive AAC support based on, and included in, mainstream and openly available lexical and language resources for wide use in all sectors of society. Following up results in this area from the European AEGIS project, work is now proceeding in cooperation between DART (centre for AAC and AT), Spr{\aa}kbanken (the Swedish Language Bank) and Centre for language Technology (CLT), University of Gothenburg, Sweden, and others. Results from this work will be presented and demonstrated, and the implications will be discussed. These, and several other signs of the time, strongly indicate that this is way to go. },
2013

H. Burden, R. Heldal, and P. Ljunglöf. Opportunities for Agile Documentation Using Natural Language Generation. ICSEA 2013, International Conference on Software Engineering Advances, Venice, Italy, 2013.

DownloadBibTeX
@inproceedings{BurdenHeldalLjunglof2013:Opportunities-for-Agile-Documentation, Address = {Venice, Italy}, Author = {Burden, H{\aa}kan and Heldal, Rogardt and Ljungl{\"o}f, Peter}, Booktitle = {ICSEA 2013, International Conference on Software Engineering Advances}, Title = {Opportunities for Agile Documentation Using Natural Language Generation}, Year = {2013},
2013

H. Burden, R. Heldal, and P. Ljunglöf. Enabling Interface Validation through Text Generation. VALID 2013, 5th International Conference on Advances in System Testing and Validation Lifecycle, Venice, Italy, 2013.

DownloadAbstractBibTeX
To obtain the information encoded in software it is necessary to master both the implementation languages and the tools. This is not only a problem for managers and user groups who have a claim in the outcome but not the necessary training in software development to decode the implementation - our case study shows that it is also a problem for the software developers. In contrast, text can be understood by everyone. The generation of textual summaries from software artifacts enables a more accessible format for validating software. Based on findings from interviewing practitioners in industry, we have developed a prototype for generating natural language summaries from component interfaces for validation purposes.
@inproceedings{BurdenHeldalLjunglof2013:Enabling-Interface-Validation, Address = {Venice, Italy}, Author = {Burden, H{\aa}kan and Heldal, Rogardt and Ljungl{\"o}f, Peter}, Booktitle = {VALID 2013, 5th International Conference on Advances in System Testing and Validation Lifecycle}, Title = {Enabling Interface Validation through Text Generation}, Year = {2013}, Abstract = {To obtain the information encoded in software it is necessary to master both the implementation languages and the tools. This is not only a problem for managers and user groups who have a claim in the outcome but not the necessary training in software development to decode the implementation - our case study shows that it is also a problem for the software developers. In contrast, text can be understood by everyone. The generation of textual summaries from software artifacts enables a more accessible format for validating software. Based on findings from interviewing practitioners in industry, we have developed a prototype for generating natural language summaries from component interfaces for validation purposes. },
2013

Proceedings of SLPAT'13: 4th Workshop on Speech and Language Processing for Assistive Technologies. J. Alexandersson, P. Ljunglöf, K. F. McCoy, F. Portet, B. Roark, F. Rudzicz, and M. Vacher (eds.), SLPAT'13: 4th Workshop on Speech and Language Processing for Assistive Technologies, Association for Computational Linguistics, Grenoble, France, 2013.

URLBibTeX
@proceedings{AlexanderssonLjunglofMcCoy2013:SLPAT13, Address = {Grenoble, France}, Booktitle = {SLPAT'13: 4th Workshop on Speech and Language Processing for Assistive Technologies}, Editor = {Alexandersson, Jan and Ljungl{\"o}f, Peter and McCoy, Kathleen F. and Portet, Fran{\c c}ois and Roark, Brian and Rudzicz, Frank and Vacher, Michel}, Keywords = {AAC-AT-CALL}, Publisher = {Association for Computational Linguistics}, Title = {Proceedings of SLPAT'13: 4th Workshop on Speech and Language Processing for Assistive Technologies}, Year = {2013},
2013

P. Ljunglöf. Type-based Human-Computer Interaction. TYPES 2013: Types for Proofs and Programs, Toulouse, France, 2013. Extended abstract.

DownloadBibTeX
@inproceedings{Ljunglof2013:Type-based-Human-Computer-Interaction, Address = {Toulouse, France}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {TYPES 2013: Types for Proofs and Programs}, Keywords = {dialogue, types}, Note = {Extended abstract}, Title = {Type-based Human-Computer Interaction}, Year = {2013},
2012

Proceedings of SLPAT'12: 3rd Workshop on Speech and Language Processing for Assistive Technologies. J. Alexandersson, P. Ljunglöf, K. F. McCoy, B. Roark, and A. Waller (eds.), SLPAT'12: 3rd Workshop on Speech and Language Processing for Assistive Technologies, Association for Computational Linguistics, Montréal, Canada, 2012.

URLBibTeX
@proceedings{AlexanderssonLjunglofMcCoy2012:SLPAT12, Address = {Montr{\'e}al, Canada}, Booktitle = {SLPAT'12: 3rd Workshop on Speech and Language Processing for Assistive Technologies}, Editor = {Alexandersson, Jan and Ljungl{\"o}f, Peter and McCoy, Kathleen F. and Roark, Brian and Waller, Annalu}, Keywords = {AAC-AT-CALL}, Publisher = {Association for Computational Linguistics}, Title = {Proceedings of SLPAT'12: 3rd Workshop on Speech and Language Processing for Assistive Technologies}, Year = {2012},
2012

P. Ljunglöf and M. Siverbo. A Bilingual Treebank for the FraCaS Test Suite. SLTC'12, 4th Swedish Language Technology Conference, Lund, Sweden, 2012.

DownloadAbstractBibTeX
We have created an open-source bilingual treebank for 99% of the sentences in the FraCaS test suite. The treebank was built in conjunction with associated English and Swedish lexica written in the Grammatical Framework Resource Grammar. The original FraCaS sentences are English, and we have tested the multilinguality of the Resource Grammar by analysing the grammaticality and naturalness of the Swedish translations. 86% of the sentences are grammatically and semantically correct and sound natural. About 10% can probably be fixed by adding new lexical items or grammatical rules, and only a small amount are considered to be difficult to cure.
@inproceedings{LjunglofSiverbo2012:A-Bilingual-Treebank-for-the-FraCaS, Address = {Lund, Sweden}, Author = {Ljungl{\"o}f, Peter and Siverbo, Magdalena}, Booktitle = {SLTC'12, 4th Swedish Language Technology Conference}, Title = {A Bilingual Treebank for the {FraCaS} Test Suite}, Year = {2012}, Abstract = {We have created an open-source bilingual treebank for 99% of the sentences in the FraCaS test suite. The treebank was built in conjunction with associated English and Swedish lexica written in the Grammatical Framework Resource Grammar. The original FraCaS sentences are English, and we have tested the multilinguality of the Resource Grammar by analysing the grammaticality and naturalness of the Swedish translations. 86% of the sentences are grammatically and semantically correct and sound natural. About 10% can probably be fixed by adding new lexical items or grammatical rules, and only a small amount are considered to be difficult to cure.},
2012

P. Ljunglöf. Practical Parsing of Parallel Multiple Context-Free Grammars. TAG+11, 11th International Workshop on Tree Adjoining Grammar and Related Formalisms, Paris, France, 2012.

DownloadAbstractBibTeX
We discuss four previously published parsing algorithms for parallell multiple context-free grammar (PMCFG), and argue that they are similar to each other, and implement an Earley-style top-down algorithm. Starting from one of these algorithms, we derive three modifications – one bottom-up and two variants using a left corner filter. An evaluation shows that substantial improvements can be made by using the algorithm that performs best on a given grammar. The algorithms are implemented in Python and released under an open-source licence.
@inproceedings{Ljunglof2012:Practical-Parsing-of-Parallel, Address = {Paris, France}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {TAG+11, 11th International Workshop on Tree Adjoining Grammar and Related Formalisms}, Keywords = {parsing}, Read = {1}, Title = {Practical Parsing of Parallel Multiple Context-Free Grammars}, Year = {2012}, Abstract = {We discuss four previously published parsing algorithms for parallell multiple context-free grammar (PMCFG), and argue that they are similar to each other, and implement an Earley-style top-down algorithm. Starting from one of these algorithms, we derive three modifications -- one bottom-up and two variants using a left corner filter. An evaluation shows that substantial improvements can be made by using the algorithm that performs best on a given grammar. The algorithms are implemented in Python and released under an open-source licence. },
2012

P. Ljunglöf, S. Derbring, and M. Olsson. A free and open-source tool that reads movie subtitles aloud. SLPAT'12: 3rd Workshop on Speech and Language Processing for Assistive Technologies, Montréal, Canada, 2012.

DownloadURLAbstractBibTeX
We present a simple tool that enables the computer to read subtitles of movies and TV shows aloud. The tool extracts information from subtitle files, which can be freely downloaded from the Internet, and reads the text aloud through a speech synthesizer. There are three versions of the tool, one for Windows and Linux, another for Mac OS X, and the third is a browser-based HTML5 prototype. The tools are freely available and open-source. The target audience is people who have trouble reading subtitles while watching a movie, including elderly, people with visual impairments, people with reading difficulties and people who wants to learn a second language. The application is currently being evaluated together with user from these groups.
@inproceedings{LjunglofDerbringOlsson2012:A-free-and-open-source-tool, Address = {Montr{\'e}al, Canada}, Author = {Ljungl{\"o}f, Peter and Derbring, Sandra and Olsson, Maria}, Booktitle = {SLPAT'12: 3rd Workshop on Speech and Language Processing for Assistive Technologies}, Keywords = {AAC-AT-CALL}, Read = {1}, Title = {A free and open-source tool that reads movie subtitles aloud}, Year = {2012}, Abstract = {We present a simple tool that enables the computer to read subtitles of movies and TV shows aloud. The tool extracts information from subtitle files, which can be freely downloaded from the Internet, and reads the text aloud through a speech synthesizer. There are three versions of the tool, one for Windows and Linux, another for Mac OS X, and the third is a browser-based HTML5 prototype. The tools are freely available and open-source. The target audience is people who have trouble reading subtitles while watching a movie, including elderly, people with visual impairments, people with reading difficulties and people who wants to learn a second language. The application is currently being evaluated together with user from these groups. },
2011

Proceedings of SLPAT'11: 2nd Workshop on Speech and Language Processing for Assistive Technologies. M. Fried-Oken, P. Ljunglöf, K. F. McCoy, and A. Waller (eds.), SLPAT'11: 2nd Workshop on Speech and Language Processing for Assistive Technologies, Association for Computational Linguistics, Edinburgh, UK, 2011.

URLBibTeX
@proceedings{FriedOkenLjunglofMcCoy2011:SLPAT11, Address = {Edinburgh, UK}, Booktitle = {SLPAT'11: 2nd Workshop on Speech and Language Processing for Assistive Technologies}, Editor = {Fried-Oken, Melanie and Ljungl{\"o}f, Peter and McCoy, Kathleen F. and Waller, Annalu}, Publisher = {Association for Computational Linguistics}, Title = {Proceedings of SLPAT'11: 2nd Workshop on Speech and Language Processing for Assistive Technologies}, Year = {2011},
2011

P. Ljunglöf and M. Siverbo. A Bilingual Treebank for the FraCaS Test Suite. University of Gothenburg, 2011.

DownloadAbstractBibTeX
We have created a bilingual treebank for 99% of the sentences in the FraCaS test suite. The treebank is built together with an associated bilingual English-Swedish lexicon written in the Grammatical Framework Resource Grammar. The original FraCaS sentences are English, and we have tested the multilinguality of the Resource Grammar by analysing the grammaticality and naturalness of the Swedish translations. 86% of the sentences are grammatically and semantically correct and sound natural. About 10% can probably be fixed by adding new lexical items or grammatical rules, and only a small amount are considered to be difficult to cure.
@techreport{LjunglofSiverbo2011:A-Bilingual-Treebank-for-the-FraCaS, Author = {Ljungl{\"o}f, Peter and Siverbo, Magdalena}, Institution = {University of Gothenburg}, Keywords = {corpora}, Read = {1}, Title = {A Bilingual Treebank for the {FraCaS} Test Suite}, Type = {{CLT} Project Report}, Year = {2011}, Abstract = {We have created a bilingual treebank for 99% of the sentences in the FraCaS test suite. The treebank is built together with an associated bilingual English-Swedish lexicon written in the Grammatical Framework Resource Grammar. The original FraCaS sentences are English, and we have tested the multilinguality of the Resource Grammar by analysing the grammaticality and naturalness of the Swedish translations. 86% of the sentences are grammatically and semantically correct and sound natural. About 10% can probably be fixed by adding new lexical items or grammatical rules, and only a small amount are considered to be difficult to cure.},
2011

P. Ljunglöf, A. Berman, B. Claesson, S. Ericsson, F. Kronlid, I. Mattsson Müller, and C. Ottesjö. Lekbot: A talking and playing robot for children with disabilities. SLPAT'11: 2nd Workshop on Speech and Language Processing for Assistive Technologies, Edinburgh, UK, 2011.

DownloadURLAbstractBibTeX
This paper describes an ongoing project where we develop and evaluate a setup involving a communication board and a toy robot, which can communicate with each other via synthesized speech. The purpose is to provide children with communicative disabilities with a toy that is fun and easy to use together with peers, with and without disabilities. When the child selects a symbol on the communication board, the board speaks and the robot responds. This encourages the child to use language and learn to cooperate to reach a common goal. Throughout the project, three children with cerebral palsy and their peers use the robot and provide feedback for further development. The multimodal interaction with the robot is video recorded and analyzed together with observational data in activity diaries.
@inproceedings{LjunglofBermanClaesson2011:Lekbot:-A-talking-and-playing, Address = {Edinburgh, UK}, Author = {Ljungl{\"o}f, Peter and Berman, Alexander and Claesson, Britt and Ericsson, Stina and Kronlid, Fredrik and Mattsson M{\"u}ller, Ingrid and Ottesj{\"o}, Cajsa}, Booktitle = {SLPAT'11: 2nd Workshop on Speech and Language Processing for Assistive Technologies}, Keywords = {AAC-AT-CALL; robots}, Read = {1}, Title = {Lekbot: A talking and playing robot for children with disabilities}, Year = {2011}, Abstract = {This paper describes an ongoing project where we develop and evaluate a setup involving a communication board and a toy robot, which can communicate with each other via synthesized speech. The purpose is to provide children with communicative disabilities with a toy that is fun and easy to use together with peers, with and without disabilities. When the child selects a symbol on the communication board, the board speaks and the robot responds. This encourages the child to use language and learn to cooperate to reach a common goal. Throughout the project, three children with cerebral palsy and their peers use the robot and provide feedback for further development. The multimodal interaction with the robot is video recorded and analyzed together with observational data in activity diaries. },
2011

P. Ljunglöf. Editing Syntax Trees on the Surface. Nodalida'11: 18th Nordic Conference of Computational Linguistics, Rīga, Latvia, 2011.

DownloadURLAbstractBibTeX
We describe a system for interactive modification of syntax trees by intuitive editing operations on the surface string. The system has a graphical interface, where the user can move, replace, add, and in other ways modify, words or phrases. During editing, the sentence is kept grammatical, by automatically rearranging words and changing inflection, if necessary. This is accomplished by combining constraints on syntax trees with a distance measure between trees.
@inproceedings{Ljunglof2011:Editing-Syntax-Trees, Address = {R{\=\i}ga, Latvia}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {Nodalida'11: 18th Nordic Conference of Computational Linguistics}, Keywords = {trees; editing; grammars}, Read = {1}, Title = {Editing Syntax Trees on the Surface}, Year = {2011}, Abstract = {We describe a system for interactive modification of syntax trees by intuitive editing operations on the surface string. The system has a graphical interface, where the user can move, replace, add, and in other ways modify, words or phrases. During editing, the sentence is kept grammatical, by automatically rearranging words and changing inflection, if necessary. This is accomplished by combining constraints on syntax trees with a distance measure between trees.},
2010

P. Ljunglöf. TRIK: A talking and drawing robot for children with communication disabilities. ISAAC-2010, Barcelona, Spain, 2010. Extended abstract.

DownloadAbstractBibTeX
In this project we have developed and evaluated a setup involving a touch-screen computer with a dynamic screen software, and a drawing robot, which can communicate with each other via spoken language. The purpose is to help children with severe communication disabilities to learn language, language use and cooperation, in a playful and inspiring way. The communication board speaks and the robot is able to understand and talk back. This encourages the child to use language and learn to cooperate to reach a common goal, which in this case is to get the robot to draw figures on a paper. The robot has been tested on three children, two with cerebral palsy and one with autism spectrum disorder. During this session we present the preliminary results.
@inproceedings{Ljunglof2010:TRIK:-A-talking-and-drawing, Address = {Barcelona, Spain}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {ISAAC-2010}, Keywords = {AAC-AT-CALL}, Note = {Extended abstract}, Read = {1}, Title = {{TRIK}: A talking and drawing robot for children with communication disabilities}, Year = {2010}, Abstract = {In this project we have developed and evaluated a setup involving a touch-screen computer with a dynamic screen software, and a drawing robot, which can communicate with each other via spoken language. The purpose is to help children with severe communication disabilities to learn language, language use and cooperation, in a playful and inspiring way. The communication board speaks and the robot is able to understand and talk back. This encourages the child to use language and learn to cooperate to reach a common goal, which in this case is to get the robot to draw figures on a paper. The robot has been tested on three children, two with cerebral palsy and one with autism spectrum disorder. During this session we present the preliminary results. },
2010

P. Ljunglöf. GRASP: Grammar-based Language Learning. SLTC'10, 3rd Swedish Language Technology Conference, Linköping, Sweden, 2010.

DownloadAbstractBibTeX
We are developing a pedagogical tool to support language learning and training for children with communicative disabilities. The system has a graphical interface, where the user can move, replace, add, and in other ways modify, words or phrases. The system keeps the sentence grammatical, by automatically rearranging the words and changing inflection, if necessary. In this way we hope that the system stimulates the child to explore the possibilities of language.
@inproceedings{Ljunglof2010:GRASP:-Grammar-based-Language, Address = {Link{\"o}ping, Sweden}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {SLTC'10, 3rd Swedish Language Technology Conference}, Keywords = {AAC-AT-CALL; trees; editing}, Read = {1}, Title = {{GRASP}: Grammar-based Language Learning}, Year = {2010}, Abstract = {We are developing a pedagogical tool to support language learning and training for children with communicative disabilities. The system has a graphical interface, where the user can move, replace, add, and in other ways modify, words or phrases. The system keeps the sentence grammatical, by automatically rearranging the words and changing inflection, if necessary. In this way we hope that the system stimulates the child to explore the possibilities of language.},
2010

P. Ljunglöf and M. Wirén. Syntactic Parsing. N. Indurkhya and F. J. Damerau (eds.), Handbook of Natural Language Processing, 2nd edition, CRC Press, Taylor and Francis, 2010. ISBN 978-1420085921.

DownloadURLAbstractBibTeX
This chapter presents basic techniques for grammar-driven natural language parsing, that is, analysing a string of words (typically a sentence) to determine its structural description according to a formal grammar. Basic parsing concepts are explained after which a number of well-known parsing techniques are described.
@incollection{LjunglofWiren2009:Syntactic-Parsing, Author = {Ljungl{\"o}f, Peter and Wir{\'e}n, Mats}, Booktitle = {Handbook of Natural Language Processing, 2nd edition}, Chapter = {4}, Editor = {Indurkhya, Nitin and Damerau, Fred J.}, Keywords = {parsing}, Note = {ISBN 978-1420085921}, Publisher = {CRC Press, Taylor and Francis}, Read = {Yes}, Title = {Syntactic Parsing}, Year = {2010}, Abstract = {This chapter presents basic techniques for grammar-driven natural language parsing, that is, analysing a string of words (typically a sentence) to determine its structural description according to a formal grammar. Basic parsing concepts are explained after which a number of well-known parsing techniques are described.},
2009

P. Ljunglöf. TRIK: A talking and drawing robot for children with communication disabilities. DiaHolmia'09, 13th Workshop on the Semantics and Pragmatics of Dialogue, Stockholm, Sweden, 2009.

DownloadURLAbstractBibTeX
We will demonstrate a setup involving a communication board (for manual sign communication) and a drawing robot, which can communicate with each other via spoken language. The purpose is to help children with severe communication disabilities to learn language, language use and cooperation, in a playful and inspiring way. The communication board speaks and the robot is able to understand and talk back. This encourages the child to use the language and learn to cooperate to reach a common goal, which in this case is to get the robot to draw figures on a paper.
@inproceedings{Ljunglof2009:TRIK:-A-talking-and-drawing, Address = {Stockholm, Sweden}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {DiaHolmia'09, 13th Workshop on the Semantics and Pragmatics of Dialogue}, Keywords = {AAC-AT-CALL}, Read = {1}, Title = {{TRIK}: A talking and drawing robot for children with communication disabilities}, Year = {2009}, Abstract = {We will demonstrate a setup involving a communication board (for manual sign communication) and a drawing robot, which can communicate with each other via spoken language. The purpose is to help children with severe communication disabilities to learn language, language use and cooperation, in a playful and inspiring way. The communication board speaks and the robot is able to understand and talk back. This encourages the child to use the language and learn to cooperate to reach a common goal, which in this case is to get the robot to draw figures on a paper.}, Rss-Description = {We will demonstrate a setup involving a communication board (for manual sign communication) and a drawing robot, which can communicate with each other via spoken language. The purpose is to help children with severe communication disabilities to learn language, language use and cooperation, in a playful and inspiring way. The communication board speaks and the robot is able to understand and talk back. This encourages the child to use the language and learn to cooperate to reach a common goal, which in this case is to get the robot to draw figures on a paper.},
2009

F. Kronlid and P. Ljunglöf. Lekbot: En pratande och lekande robot för barn med funktionshinder. 2009. Accepted project proposal, written in Swedish.

DownloadAbstractBibTeX
För barn med stora rörelsehinder finns få möjligheter att leka självständigt och att samspela på lika villkor med barn utan funktionshinder. Genom en produkt som barn kan använda oavsett om det har ett funktionhinder eller ej ges barnen möjlighet att samspela och lära av varandra. Vi avser att utveckla en radiostyrd robot som kan användas av barn och ungdomar med svåra fysiska och/eller kommunikativa funktionshinder, såsom cerebral pares eller autism. Roboten styrs av barnet genom att peka på symboler på en pekskärm. Symbolerna översätts till talat språk, så att pekskärmen ''pratar'' med roboten och berättar vad barnet vill. Roboten å sin sida kan ställa frågor tillbaka som barnet svarar på genom att peka på symboler (som återigen översätts till talat språk). Kommunikation med symboler och bilder är det vanligaste kommunikationsstödet både för barn med autismspektrumstörning och för barn med CP.
@unpublished{KronlidLjunglof2009:Lekbot:-En-pratande-och-lekande, Author = {Kronlid, Fredrik and Ljungl{\"o}f, Peter}, Keywords = {AAC-AT-CALL}, Note = {Accepted project proposal, written in Swedish}, Read = {1}, Title = {Lekbot: En pratande och lekande robot f{\"o}r barn med funktionshinder}, Year = {2009}, Abstract = {F{\"o}r barn med stora r{\"o}relsehinder finns f{\aa} m{\"o}jligheter att leka sj{\"a}lvst{\"a}ndigt och att samspela p{\aa} lika villkor med barn utan funktionshinder. Genom en produkt som barn kan anv{\"a}nda oavsett om det har ett funktionhinder eller ej ges barnen m{\"o}jlighet att samspela och l{\"a}ra av varandra. Vi avser att utveckla en radiostyrd robot som kan anv{\"a}ndas av barn och ungdomar med sv{\aa}ra fysiska och/eller kommunikativa funktionshinder, s{\aa}som cerebral pares eller autism. Roboten styrs av barnet genom att peka p{\aa} symboler p{\aa} en peksk{\"a}rm. Symbolerna {\"o}vers{\"a}tts till talat spr{\aa}k, s{\aa} att peksk{\"a}rmen ''pratar'' med roboten och ber{\"a}ttar vad barnet vill. Roboten {\aa} sin sida kan st{\"a}lla fr{\aa}gor tillbaka som barnet svarar p{\aa} genom att peka p{\aa} symboler (som {\aa}terigen {\"o}vers{\"a}tts till talat spr{\aa}k). Kommunikation med symboler och bilder {\"a}r det vanligaste kommunikationsst{\"o}det b{\aa}de f{\"o}r barn med autismspektrumst{\"o}rning och f{\"o}r barn med CP.},
2009

P. Ljunglöf. trindikit.py: An open-source Python library for developing ISU-based dialogue systems. IWSDS'09, 1st International Workshop on Spoken Dialogue Systems Technology, Kloster Irsee, Germany, 2009.

DownloadAbstractBibTeX
TrindiKit is one of the main tools for developing ISU-based dialogue systems, but it is implemented in a non-free dialect of the programming language Prolog. Therefore we have translated the TrindiKit toolkit into an open-source Python package. We have tried to remain close to the original TrindiKit formulation, while making the most of Python classes and objects.
@inproceedings{Ljunglof2009:trindikit.py, Address = {Kloster Irsee, Germany}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {IWSDS'09, 1st International Workshop on Spoken Dialogue Systems Technology}, Keywords = {dialogue}, Read = {Yes}, Title = {trindikit.py: An open-source {Python} library for developing {ISU}-based dialogue systems}, Year = {2009}, Abstract = {TrindiKit is one of the main tools for developing ISU-based dialogue systems, but it is implemented in a non-free dialect of the programming language Prolog. Therefore we have translated the TrindiKit toolkit into an open-source Python package. We have tried to remain close to the original TrindiKit formulation, while making the most of Python classes and objects.},
2009

P. Ljunglöf, M. Heimann, M. Lundälv, and K. Mühlenbock. GRASP: Grammatikbaserad språkinlärning för barn med funktionshinder. 2009. Accepted project proposal, written in Swedish.

DownloadAbstractBibTeX
Vi avser att utveckla ett pedagogiskt hjälpmedel för barn med språkliga funktionshinder. Hjälpmedlet kommer att bestå av ett datorsystem som ger stöd för språkinlärning och språkträning. Systemet är grafiskt, där barnet kan peka på ord eller fraser för att få förklaringar i form av text eller ljud, och också själv kan göra omformuleringar. Barnet kan själv flytta omkring ord i en mening, och systemet flyttar automatiskt omkring andra ord och ändrar böjningar, så att meningen hela tiden blir grammatiskt korrekt. Hjälpmedlet är avsett att på ett lekfullt sätt stimulera barnets vilja att utforska språkets möjligheter.
@unpublished{LjunglofHeimannLundalv2009:GRASP:-Grammatikbaserad-sprakinlarning, Author = {Ljungl{\"o}f, Peter and Heimann, Mikael and Lund{\"a}lv, Mats and M{\"u}hlenbock, Katarina}, Keywords = {AAC-AT-CALL}, Note = {Accepted project proposal, written in Swedish}, Read = {Yes}, Title = {{GRASP}: Grammatikbaserad spr{\aa}kinl{\"a}rning f{\"o}r barn med funktionshinder}, Year = {2009}, Abstract = {Vi avser att utveckla ett pedagogiskt hj{\"a}lpmedel f{\"o}r barn med spr{\aa}kliga funktionshinder. Hj{\"a}lpmedlet kommer att best{\aa} av ett datorsystem som ger st{\"o}d f{\"o}r spr{\aa}kinl{\"a}rning och spr{\aa}ktr{\"a}ning. Systemet {\"a}r grafiskt, d{\"a}r barnet kan peka p{\aa} ord eller fraser f{\"o}r att f{\aa} f{\"o}rklaringar i form av text eller ljud, och ocks{\aa} sj{\"a}lv kan g{\"o}ra omformuleringar. Barnet kan sj{\"a}lv flytta omkring ord i en mening, och systemet flyttar automatiskt omkring andra ord och {\"a}ndrar b{\"o}jningar, s{\aa} att meningen hela tiden blir grammatiskt korrekt. Hj{\"a}lpmedlet {\"a}r avsett att p{\aa} ett lekfullt s{\"a}tt stimulera barnets vilja att utforska spr{\aa}kets m{\"o}jligheter.},
2009

P. Ljunglöf. Dialogue Management as Interactive Tree Building. DiaHolmia'09, 13th Workshop on the Semantics and Pragmatics of Dialogue, Stockholm, Sweden, 2009.

DownloadAbstractBibTeX
We introduce a new dialogue model and a formalism for limited-domain dialogue systems, which works by interactively building dialogue trees. The model borrows its fundamental ideas from type theoretical grammars and Dynamic Syntax. The resulting dialogue theory is a simple and light-weight formalism, which is still capable of advanced dialogue behaviour.
@inproceedings{Ljunglof2009:Dialogue-Management-as-Interactive, Address = {Stockholm, Sweden}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {DiaHolmia'09, 13th Workshop on the Semantics and Pragmatics of Dialogue}, Keywords = {dialogue}, Read = {Yes}, Title = {Dialogue Management as Interactive Tree Building}, Year = {2009}, Abstract = {We introduce a new dialogue model and a formalism for limited-domain dialogue systems, which works by interactively building dialogue trees. The model borrows its fundamental ideas from type theoretical grammars and Dynamic Syntax. The resulting dialogue theory is a simple and light-weight formalism, which is still capable of advanced dialogue behaviour.},
2009

S. Derbring, P. Ljunglöf, and M. Olsson. SubTTS: Light-weight automatic reading of subtitles. Nodalida'09: 17th Nordic Conference of Computational Linguistics, 2009. Short paper and demonstration.

DownloadURLAbstractBibTeX
We present a simple tool that enables the computer to read subtitles of movies and TV shows aloud. The tool works by reading subtitle files, which can be freely downloaded or extracted from a DVD using existing tools, and read the text aloud through a speech synthesizer. The target audience are people who have trouble reading subtitles while watching a movie, for example people with visual impairments and people with reading difficulties, such as dyslexia. The application will be evaluated together with user from these groups to see if this could be an accepted solution to their need.
@inproceedings{DerbringLjunglofOlsson2009:Light-weight-automatic-reading, Author = {Derbring, Sandra and Ljungl{\"o}f, Peter and Olsson, Maria}, Booktitle = {Nodalida'09: 17th Nordic Conference of Computational Linguistics}, Keywords = {AAC-AT-CALL}, Note = {Short paper and demonstration}, Read = {Yes}, Title = {{SubTTS}: Light-weight automatic reading of subtitles}, Year = {2009}, Abstract = {We present a simple tool that enables the computer to read subtitles of movies and TV shows aloud. The tool works by reading subtitle files, which can be freely downloaded or extracted from a DVD using existing tools, and read the text aloud through a speech synthesizer. The target audience are people who have trouble reading subtitles while watching a movie, for example people with visual impairments and people with reading difficulties, such as dyslexia. The application will be evaluated together with user from these groups to see if this could be an accepted solution to their need. },
2009

P. Ljunglöf, S. Larsson, K. Mühlenbock, and G. Thunberg. TRIK: A talking and drawing robot for children with communication disabilities. Nodalida'09: 17th Nordic Conference of Computational Linguistics, 2009. Short paper and demonstration.

DownloadURLAbstractBibTeX
This paper describes an ongoing project where we develop and evaluate setup involving a communication board (for manual sign communication) and a drawing robot, which can communicate with each other via spoken language. The purpose is to help children with severe communication disabilities to learn language, language use and cooperation, in a playful and inspiring way. The communication board speaks and the robot is able to understand and talk back. This encourages the child to use the language and learn to cooperate to reach a common goal, which in this case is to get the robot to draw figures on a paper.
@inproceedings{LjunglofLarssonMuhlenbock2009:TRIK:-A-talking-and-drawing, Author = {Ljungl{\"o}f, Peter and Larsson, Staffan and M{\"u}hlenbock, Katarina and Thunberg, Gunilla}, Booktitle = {Nodalida'09: 17th Nordic Conference of Computational Linguistics}, Keywords = {AAC-AT-CALL}, Note = {Short paper and demonstration}, Read = {Yes}, Title = {{TRIK}: A talking and drawing robot for children with communication disabilities}, Year = {2009}, Abstract = {This paper describes an ongoing project where we develop and evaluate setup involving a communication board (for manual sign communication) and a drawing robot, which can communicate with each other via spoken language. The purpose is to help children with severe communication disabilities to learn language, language use and cooperation, in a playful and inspiring way. The communication board speaks and the robot is able to understand and talk back. This encourages the child to use the language and learn to cooperate to reach a common goal, which in this case is to get the robot to draw figures on a paper. },
2008

P. Ljunglöf. Transition-based parsing. SLTC 2008: Proceedings of the Swedish Language Technology Conference, Stockholm, Sweden, 2008.

DownloadAbstractBibTeX
In this paper we introduce a general framework for transition-based parsing algorithms. Among the algorithms that can be described in this framework are deterministic and generalized LR-parsing (Tomita, 1986), incremental tabular parsing such as the Earley algorithm (Earley, 1970), and projective and non-projective depenency parsing (Nivre, 2008).
@inproceedings{Ljunglof2008:Transition-based-parsing, Address = {Stockholm, Sweden}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {{SLTC} 2008: Proceedings of the Swedish Language Technology Conference}, Keywords = {parsing}, Read = {Yes}, Title = {Transition-based parsing}, Year = {2008}, Abstract = {In this paper we introduce a general framework for transition-based parsing algorithms. Among the algorithms that can be described in this framework are deterministic and generalized LR-parsing (Tomita, 1986), incremental tabular parsing such as the Earley algorithm (Earley, 1970), and projective and non-projective depenency parsing (Nivre, 2008).},
2008

P. Ljunglöf, S. Larsson, K. Mühlenbock, and G. Thunberg. TRIK: A talking and drawing robot for children with communication disabilities. NordiCHI'08 Workshop: Designing Robotic Artefacts With User- and Experience Centred Perspectives, 2008.

DownloadAbstractBibTeX
This paper describes an ongoing project where we develop and evaluate setup involving a communication board (e.g., for Blissymbolics or manual sign communication) and a drawing robot, which can communicate with each other via spoken language. The purpose is to help children with severe communication disabilities to learn language, language use and cooperation, in a playful and inspiring way. The communication board speaks and the robot is able to understand and talk back. This encourages the child to use the language and learn to cooperate to reach a common goal, which in this case is to get the robot to draw figures on a paper.
@inproceedings{LjunglofLarssonMuhlenbock2008:TRIK:-A-talking-and-drawing, Author = {Ljungl{\"o}f, Peter and Larsson, Staffan and M{\"u}hlenbock, Katarina and Thunberg, Gunilla}, Booktitle = {NordiCHI'08 Workshop: Designing Robotic Artefacts With User- and Experience Centred Perspectives}, Keywords = {AAC-AT-CALL}, Read = {Yes}, Title = {{TRIK}: A talking and drawing robot for children with communication disabilities}, Year = {2008}, Abstract = {This paper describes an ongoing project where we develop and evaluate setup involving a communication board (e.g., for Blissymbolics or manual sign communication) and a drawing robot, which can communicate with each other via spoken language. The purpose is to help children with severe communication disabilities to learn language, language use and cooperation, in a playful and inspiring way. The communication board speaks and the robot is able to understand and talk back. This encourages the child to use the language and learn to cooperate to reach a common goal, which in this case is to get the robot to draw figures on a paper.},
2008

P. Ljunglöf and S. Larsson. A Grammar Formalism for Specifying ISU-based Dialogue Systems. GoTAL'08, 6th International Conference on Natural Language Processing, Springer LNCS/LNAI, volume 5221, Gothenburg, Sweden, 2008.

DownloadAbstractBibTeX
We describe how to give a full specification of an ISU-based dialogue system as a grammar. For this we use Grammatical Framework (GF), which separates grammars into abstract and concrete syntax. All components necessary for a working GoDiS dialogue system are specified in the abstract syntax, while the linguistic details are defined in the concrete syntax. Since GF is a multilingual grammar formalism, it is straightforward to extend the dialogue system to several languages. Furthermore, the GF Resource Grammar Library can be used to write a single concrete instance covering 13 different languages.
@inproceedings{LjunglofLarsson2008:A-Grammar-Formalism-for-Specifying, Address = {Gothenburg, Sweden}, Author = {Ljungl{\"o}f, Peter and Larsson, Staffan}, Booktitle = {GoTAL'08, 6th International Conference on Natural Language Processing}, Comment = {Editors: Nordstr{\"o}m, Bengt and Ranta, Aarne}, Keywords = {dialogue; grammars}, Read = {Yes}, Series = {Springer LNCS/LNAI}, Title = {A Grammar Formalism for Specifying {ISU}-based Dialogue Systems}, Volume = {5221}, Year = {2008}, Abstract = {We describe how to give a full specification of an ISU-based dialogue system as a grammar. For this we use Grammatical Framework (GF), which separates grammars into abstract and concrete syntax. All components necessary for a working GoDiS dialogue system are specified in the abstract syntax, while the linguistic details are defined in the concrete syntax. Since GF is a multilingual grammar formalism, it is straightforward to extend the dialogue system to several languages. Furthermore, the GF Resource Grammar Library can be used to write a single concrete instance covering 13 different languages.},
2008

P. Ljunglöf. A Grammar Formalism for Specifying ISU-based Dialogue Systems. Londial'08, 12th Workshop on the Semantics and Pragmatics of Dialogue, London, 2008. Short paper and poster demonstration.

DownloadAbstractBibTeX
We describe how to give a full specification of an ISU-based dialogue system as a grammar. For this we use Grammatical Framework (GF), which separates grammars into abstract and concrete syntax. All components necessary for a complete GoDiS dialogue system are specified in the abstract syntax, while the linguistic details are defined in the concrete syntax. Since GF is a multilingual grammar formalism, it is straightforward to extend the dialogue system to several languages.
@inproceedings{Ljunglof2008:A-Grammar-Formalism-for-Specifying, Address = {London}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {Londial'08, 12th Workshop on the Semantics and Pragmatics of Dialogue}, Keywords = {grammars; dialogue}, Note = {Short paper and poster demonstration}, Read = {Yes}, Title = {A Grammar Formalism for Specifying {ISU}-based Dialogue Systems}, Year = {2008}, Abstract = {We describe how to give a full specification of an ISU-based dialogue system as a grammar. For this we use Grammatical Framework (GF), which separates grammars into abstract and concrete syntax. All components necessary for a complete GoDiS dialogue system are specified in the abstract syntax, while the linguistic details are defined in the concrete syntax. Since GF is a multilingual grammar formalism, it is straightforward to extend the dialogue system to several languages. },
2007

S. Larsson, P. Ljunglöf, M. Lundälv, K. Mühlenbock, G. Thunberg, and J. Villing. TRIK: En talande och ritande robot för barn med kommunikativa funktionshinder. 2007. Accepted project proposal, written in Swedish.

DownloadAbstractBibTeX
För barn med stora rörelsehinder finns få möjligheter att leka självständigt och att samspela på lika villkor med barn utan funktionshinder. Genom en produkt som barn kan använda oavsett om det har ett funktionhinder eller ej ges barnen möjlighet att samspela och lära av varandra. Vi avser att utveckla en radiostyrd robot som kan användas av barn och ungdomar med svåra fysiska och/eller kommunikativa funktionshinder, såsom cerebral pares eller autism. Roboten styrs av barnet genom att peka på symboler på en pekskärm. Symbolerna översätts till talat språk, så att pekskärmen ''pratar'' med roboten och berättar vad barnet vill. Roboten å sin sida kan ställa frågor tillbaka som barnet svarar på genom att peka på symboler (som återigen översätts till talat språk). Kommunikation med symboler och bilder är det vanligaste kommunikationsstödet både för barn med autismspektrumstörning och för barn med CP.
@unpublished{LarssonLjunglofLundalv2007:TRIK:-En-talande-och-ritande, Author = {Larsson, Staffan and Ljungl{\"o}f, Peter and Lund{\"a}lv, Mats and M{\"u}hlenbock, Katarina and Thunberg, Gunilla and Villing, Jessica}, Keywords = {AAC-AT-CALL}, Note = {Accepted project proposal, written in Swedish}, Read = {1}, Title = {{TRIK}: En talande och ritande robot f{\"o}r barn med kommunikativa funktionshinder}, Year = {2007}, Abstract = {F{\"o}r barn med stora r{\"o}relsehinder finns f{\aa} m{\"o}jligheter att leka sj{\"a}lvst{\"a}ndigt och att samspela p{\aa} lika villkor med barn utan funktionshinder. Genom en produkt som barn kan anv{\"a}nda oavsett om det har ett funktionhinder eller ej ges barnen m{\"o}jlighet att samspela och l{\"a}ra av varandra. Vi avser att utveckla en radiostyrd robot som kan anv{\"a}ndas av barn och ungdomar med sv{\aa}ra fysiska och/eller kommunikativa funktionshinder, s{\aa}som cerebral pares eller autism. Roboten styrs av barnet genom att peka p{\aa} symboler p{\aa} en peksk{\"a}rm. Symbolerna {\"o}vers{\"a}tts till talat spr{\aa}k, s{\aa} att peksk{\"a}rmen ''pratar'' med roboten och ber{\"a}ttar vad barnet vill. Roboten {\aa} sin sida kan st{\"a}lla fr{\aa}gor tillbaka som barnet svarar p{\aa} genom att peka p{\aa} symboler (som {\aa}terigen {\"o}vers{\"a}tts till talat spr{\aa}k). Kommunikation med symboler och bilder {\"a}r det vanligaste kommunikationsst{\"o}det b{\aa}de f{\"o}r barn med autismspektrumst{\"o}rning och f{\"o}r barn med CP.},
2007

P. Ljunglöf. Converting Grammatical Framework to Regulus. SPEECHGRAM, Workshop on Grammar-Based Approaches to Spoken Language Processing, Prague, 2007.

DownloadAbstractBibTeX
We present an algorithm for converting Grammatical Framework grammars (Ranta, 2004) into the Regulus unification-based framework (Rayner et al., 2006). The main purpose is to take advantage of the Regulus-to-Nuance compiler for generating optimized speech recognition grammars. But there is also a theoretical interest in knowing how similar the two grammar formalisms are. Since Grammatical Framework is more expressive than Regulus, the resulting Regulus grammars can be overgenerating. We therefore describe a subclass of Grammatical Framework for which the algorithm results in an equivalent Regulus grammar.
@inproceedings{Ljunglof2007:Converting-GF-to-Regulus, Address = {Prague}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {SPEECHGRAM, Workshop on Grammar-Based Approaches to Spoken Language Processing}, Keywords = {grammars}, Read = {Yes}, Title = {Converting {G}rammatical {F}ramework to {R}egulus}, Year = {2007}, Abstract = {We present an algorithm for converting Grammatical Framework grammars (Ranta, 2004) into the Regulus unification-based framework (Rayner et al., 2006). The main purpose is to take advantage of the Regulus-to-Nuance compiler for generating optimized speech recognition grammars. But there is also a theoretical interest in knowing how similar the two grammar formalisms are. Since Grammatical Framework is more expressive than Regulus, the resulting Regulus grammars can be overgenerating. We therefore describe a subclass of Grammatical Framework for which the algorithm results in an equivalent Regulus grammar. },
2007

S. Ericsson (editor), G. Amores, B. Bringert, H. Burden, A.-C. Forslund, D. Hjelm, R. Jonson, S. Larsson, P. Ljunglöf, P. Manchón, D. Milward, G. Pérez, and M. Sandin. Software illustrating a unified approach to multimodality and multilinguality in the in-home domain. number D1.6, TALK Project, 2007.

DownloadURLAbstractBibTeX
This deliverable presents work on Task 1.6 in the TALK project. The research task focuses on multimodality and multilinguality for the Information State Update (ISU) approach in the in-home domain, with particular attention paid to a unified approach to multimodality and multilinguality. Such a unified approach involves contributions in different modalities and different languages as concrete realisations of common abstract representations, creating coherent, powerful, and efficient dialogue systems that allow rapid development and porting.
@techreport{TALK:D1.6, Author = {Ericsson (editor), Stina and Amores, Gabriel and Bringert, Bj{\"o}rn and Burden, H{\aa}kan and Forslund, Ann-Charlotte and Hjelm, David and Jonson, Rebecca and Larsson, Staffan and Ljungl{\"o}f, Peter and Manch{\'o}n, Pilar and Milward, David and P{\'e}rez, Guillermo and Sandin, Mikael}, Institution = {TALK Project}, Keywords = {dialogue}, Number = {D1.6}, Title = {Software illustrating a unified approach to multimodality and multilinguality in the in-home domain}, Type = {Deliverable}, Year = {2007}, Abstract = {This deliverable presents work on Task 1.6 in the TALK project. The research task focuses on multimodality and multilinguality for the Information State Update (ISU) approach in the in-home domain, with particular attention paid to a unified approach to multimodality and multilinguality. Such a unified approach involves contributions in different modalities and different languages as concrete realisations of common abstract representations, creating coherent, powerful, and efficient dialogue systems that allow rapid development and porting.},
2006

P. Ljunglöf, G. Amores, H. Burden, P. Manchón, G. Pérez, and A. Ranta. Enhanced Multimodal Grammar Library. number D1.5, TALK Project, 2006.

DownloadURLAbstractBibTeX
In this deliverable we discuss how dialogue systems, and especially grammars for dialogue systems, can be related to existing knowledge representation systems. We focus on one specific language for knowledge representation, the Web Ontology Language (OWL), which is a W3C standard for ontology descriptions for knowledge representation. Since it is a standard there is already much work done on relating OWL to other ontology formalisms.
@techreport{TALK:D1.5, Author = {Ljungl{\"o}f, Peter and Amores, Gabriel and Burden, H{\aa}kan and Manch{\'o}n, Pilar and P{\'e}rez, Guillermo and Ranta, Aarne}, Institution = {TALK Project}, Keywords = {grammars}, Number = {D1.5}, Read = {Yes}, Title = {Enhanced Multimodal Grammar Library}, Type = {Deliverable}, Year = {2006}, Abstract = {In this deliverable we discuss how dialogue systems, and especially grammars for dialogue systems, can be related to existing knowledge representation systems. We focus on one specific language for knowledge representation, the Web Ontology Language (OWL), which is a W3C standard for ontology descriptions for knowledge representation. Since it is a standard there is already much work done on relating OWL to other ontology formalisms.},
2006

D. Milward, G. Amores, N. Blaylock, S. Larsson, P. Ljunglöf, P. Manchón, and G. Pérez. Dynamic Multimodal Interface Reconfiguration. number D2.2, TALK Project, 2006.

DownloadURLAbstractBibTeX
Wider use of spoken and multi-modal dialogue systems has been hampered by the cost of reconfigurability to new tasks and applications. Dynamic reconfiguration offers the potential for immediate redeployment, and the possibility of more personalised and context dependent interaction with users. This deliverable outlines the challenges for knowledge representation, and how the systems address various levels of reconfigurability up to and including dynamic reconfigurability.
@techreport{TALK:D2.2, Author = {Milward, David and Amores, Gabriel and Blaylock, Nate and Larsson, Staffan and Ljungl{\"o}f, Peter and Manch{\'o}n, Pilar and P{\'e}rez, Guillermo}, Institution = {TALK Project}, Keywords = {dialogue}, Month = {August}, Number = {D2.2}, Title = {Dynamic Multimodal Interface Reconfiguration}, Type = {Deliverable}, Year = {2006}, Abstract = {Wider use of spoken and multi-modal dialogue systems has been hampered by the cost of reconfigurability to new tasks and applications. Dynamic reconfiguration offers the potential for immediate redeployment, and the possibility of more personalised and context dependent interaction with users. This deliverable outlines the challenges for knowledge representation, and how the systems address various levels of reconfigurability up to and including dynamic reconfigurability.},
2006

P. Ljunglöf, G. Amores, R. Cooper, D. Hjelm, P. Manchón, G. Pérez, and A. Ranta. Multimodal Grammar Library. number D1.2b, TALK Project, 2006.

DownloadURLAbstractBibTeX
In this deliverable, we show that by using an abstract representation for grammars, we can further enable rapid porting of dialogue systems between languages, domains and modalities. The main tool in defining such grammars is Grammatical Framework (GF), which is used in collaboration by UGOT, UEDIN and UCAM for making ISU-based dialogue systems. We describe two approaches to adding multimodality to unimodal dialogue systems and grammars. The first approach is to implement multimodality at the grammar level. We give a language- and domain-independent method for how to add multimodal information to a unimodal GF grammar, thus simplifying the transition from a speech-only dialogue system to a multimodal one. The second approach is to implement multimodality at the level of the dialogue manager, which is tried out in the ISU-based dialogue system DelfosNCL, developed by USEV.
@techreport{TALK:D1.2b, Author = {Ljungl{\"o}f, Peter and Amores, Gabriel and Cooper, Robin and Hjelm, David and Manch{\'o}n, Pilar and P{\'e}rez, Guillermo and Ranta, Aarne}, Institution = {TALK Project}, Keywords = {grammars}, Number = {D1.2b}, Read = {Yes}, Title = {Multimodal Grammar Library}, Type = {Deliverable}, Year = {2006}, Abstract = {In this deliverable, we show that by using an abstract representation for grammars, we can further enable rapid porting of dialogue systems between languages, domains and modalities. The main tool in defining such grammars is Grammatical Framework (GF), which is used in collaboration by UGOT, UEDIN and UCAM for making ISU-based dialogue systems. We describe two approaches to adding multimodality to unimodal dialogue systems and grammars. The first approach is to implement multimodality at the grammar level. We give a language- and domain-independent method for how to add multimodal information to a unimodal GF grammar, thus simplifying the transition from a speech-only dialogue system to a multimodal one. The second approach is to implement multimodality at the level of the dialogue manager, which is tried out in the ISU-based dialogue system DelfosNCL, developed by USEV.},
2005

P. Ljunglöf (editor), B. Bringert, R. Cooper, A.-C. Forslund, D. Hjelm, R. Jonson, S. Larsson, and A. Ranta. The TALK Grammar Library: an Integration of GF with TrindiKit. number D1.1, TALK Project, 2005.

DownloadURLAbstractBibTeX
The dialogue toolkit TrindiKit and the generic dialogue system GoDiS built within TrindiKit do not provide any specific support for grammars. In previous systems built with these tools we have used simple phrase spotting to relate user and system utterances to dialogue moves. The correlations are expressed in GoDiS lexicons. For speech recognition we have used Nuance's grammar formalism. In what follows we explain why this situation needs to be improved and how the Grammatical Framework (GF) provides us with an engineering approach to grammar which is very well suited to the needs of maintaining a number of small related grammars as are needed by our approach to dialogue system development.
@techreport{TALK:D1.1, Author = {Ljungl{\"o}f (editor), Peter and Bringert, Bj{\"o}rn and Cooper, Robin and Forslund, Ann-Charlotte and Hjelm, David and Jonson, Rebecca and Larsson, Staffan and Ranta, Aarne}, Institution = {TALK Project}, Keywords = {dialogue; grammars}, Number = {D1.1}, Read = {Yes}, Title = {The {TALK} Grammar Library: an Integration of {GF} with {TrindiKit}}, Type = {Deliverable}, Year = {2005}, Abstract = {The dialogue toolkit TrindiKit and the generic dialogue system GoDiS built within TrindiKit do not provide any specific support for grammars. In previous systems built with these tools we have used simple phrase spotting to relate user and system utterances to dialogue moves. The correlations are expressed in GoDiS lexicons. For speech recognition we have used Nuance's grammar formalism. In what follows we explain why this situation needs to be improved and how the Grammatical Framework (GF) provides us with an engineering approach to grammar which is very well suited to the needs of maintaining a number of small related grammars as are needed by our approach to dialogue system development.},
2005

B. Bringert, R. Cooper, P. Ljunglöf, and A. Ranta. Development of multimodal and multilingual grammars: viability and motivation. number D1.2a, TALK Project, 2005.

DownloadURLAbstractBibTeX
In this deliverable we will explain the nature of the Grammatical Framework and how it may provide us with a solution to this problem. The system is oriented towards the writing of multilingual and multimodal grammars and forces the grammar writer to keep a collection of grammars in sync. It does this by using computer science notions of abstract and concrete syntax. Essentially abstract syntax corresponds to the domain knowledge representation of the system and several concrete syntaxes characterising both natural language representations of the domain and representations in other modalities are related to a single abstract syntax. The system forces the concrete syntaxes to give complete coverage of the abstract syntax and thus will immediately tell the grammar writer if the grammars are not in sync. In addition the framework provides possibilities for converting from one grammar format to another and for combining grammars and extracting subgrammars from larger grammars.
@techreport{TALK:D1.2a, Author = {Bringert, Bj{\"o}rn and Cooper, Robin and Ljungl{\"o}f, Peter and Ranta, Aarne}, Institution = {TALK Project}, Keywords = {grammars}, Number = {D1.2a}, Read = {Yes}, Title = {Development of multimodal and multilingual grammars: viability and motivation}, Type = {Deliverable}, Year = {2005}, Abstract = {In this deliverable we will explain the nature of the Grammatical Framework and how it may provide us with a solution to this problem. The system is oriented towards the writing of multilingual and multimodal grammars and forces the grammar writer to keep a collection of grammars in sync. It does this by using computer science notions of abstract and concrete syntax. Essentially abstract syntax corresponds to the domain knowledge representation of the system and several concrete syntaxes characterising both natural language representations of the domain and representations in other modalities are related to a single abstract syntax. The system forces the concrete syntaxes to give complete coverage of the abstract syntax and thus will immediately tell the grammar writer if the grammars are not in sync. In addition the framework provides possibilities for converting from one grammar format to another and for combining grammars and extracting subgrammars from larger grammars.},
2005

B. Bringert, R. Cooper, P. Ljunglöf, and A. Ranta. Multimodal Dialogue System Grammars. Dialor'05, 9th Workshop on the Semantics and Pragmatics of Dialogue, Nancy, France, 2005.

DownloadAbstractBibTeX
We describe how multimodal grammars for dialogue systems can be written using the Grammatical Framework (GF) formalism. A proof-of-concept dialogue system constructed using these techniques is also presented. The software engineering problem of keeping grammars for different languages, modalities and systems (such as speech recognizers and parsers) in sync is reduced by the formal relationship between the abstract and concrete syntaxes, and by generating equivalent grammars from GF grammars.
@inproceedings{BringertCooperLjunglof2005:Multimodal-Dialogue-System, Address = {Nancy, France}, Author = {Bringert, Bj{\"o}rn and Cooper, Robin and Ljungl{\"o}f, Peter and Ranta, Aarne}, Booktitle = {Dialor'05, 9th Workshop on the Semantics and Pragmatics of Dialogue}, Keywords = {dialogue; grammars}, Read = {Yes}, Title = {Multimodal Dialogue System Grammars}, Year = {2005}, Abstract = {We describe how multimodal grammars for dialogue systems can be written using the Grammatical Framework (GF) formalism. A proof-of-concept dialogue system constructed using these techniques is also presented. The software engineering problem of keeping grammars for different languages, modalities and systems (such as speech recognizers and parsers) in sync is reduced by the formal relationship between the abstract and concrete syntaxes, and by generating equivalent grammars from GF grammars.},
2005

H. Burden and P. Ljunglöf. Parsing Linear Context-Free Rewriting Systems. IWPT'05, 9th International Workshop on Parsing Technologies, Vancouver, Canada, 2005.

DownloadAbstractBibTeX
We describe four different parsing algorithms for Linear Context-Free Rewriting Systems (Vijay-Shanker et al., 1987). The algorithms are described as deduction systems, and possible optimizations are discussed.
@inproceedings{BurdenLjunglof2005:Parsing-LCFRS, Address = {Vancouver, Canada}, Author = {Burden, H{\aa}kan and Ljungl{\"o}f, Peter}, Booktitle = {IWPT'05, 9th International Workshop on Parsing Technologies}, Keywords = {parsing}, Read = {Yes}, Title = {Parsing Linear Context-Free Rewriting Systems}, Year = {2005}, Abstract = {We describe four different parsing algorithms for Linear Context-Free Rewriting Systems (Vijay-Shanker et al., 1987). The algorithms are described as deduction systems, and possible optimizations are discussed. },
2005

P. Ljunglöf. A Polynomial Time Extension of Parallel Multiple Context-Free Grammar. LACL'05, 5th Conference on Logical Aspects of Computational Linguistics, Bordeaux, France, 2005.

DownloadAbstractBibTeX
It is already known that parallel multiple context-free grammar (PMCFG) is an instance of the equivalent formalisms simple literal movement grammar (sLMG) and range concatenation grammar (RCG). In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar, PMCFG becomes equivalent to sLMG and RCG. As a corollary we get that PMCFG with intersection describe exactly the class of languages recognizable in polynomial time.
@inproceedings{Ljunglof2005:A-Polynomial-Time-Extension, Address = {Bordeaux, France}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {LACL'05, 5th Conference on Logical Aspects of Computational Linguistics}, Keywords = {grammars}, Read = {Yes}, Title = {A Polynomial Time Extension of Parallel Multiple Context-Free Grammar}, Year = {2005}, Abstract = {It is already known that parallel multiple context-free grammar (PMCFG) is an instance of the equivalent formalisms simple literal movement grammar (sLMG) and range concatenation grammar (RCG). In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar, PMCFG becomes equivalent to sLMG and RCG. As a corollary we get that PMCFG with intersection describe exactly the class of languages recognizable in polynomial time. },
2004

P. Ljunglöf. Functional Chart Parsing of Context-Free Grammars. Journal of Functional Programming, 14(6), pages 669–680, 2004.

DownloadAbstractBibTeX
This paper implements a simple and elegant version of bottom-up Kilbury chart parsing (Kilbury, 1985; Wirén, 1992). This is one of the many chart parsing variants, which are all based on the data structure of charts. The chart parsing process uses inference rules to add new edges to the chart, and parsing is complete when no further edges can be added. One novel aspect of this implementation is that it doesn't have to rely on a global state for the implementation of the chart. This makes the code clean, elegant and declarative, while still having the same space and time complexity as the standard imperative implementations.
@article{Ljunglof2004:Functional-Chart-Parsing, Author = {Ljungl{\"o}f, Peter}, Journal = {Journal of Functional Programming}, Keywords = {parsing}, Number = {6}, Pages = {669--680}, Read = {Yes}, Title = {Functional Chart Parsing of Context-Free Grammars}, Volume = {14}, Year = {2004}, Abstract = {This paper implements a simple and elegant version of bottom-up Kilbury chart parsing (Kilbury, 1985; Wir{\'e}n, 1992). This is one of the many chart parsing variants, which are all based on the data structure of charts. The chart parsing process uses inference rules to add new edges to the chart, and parsing is complete when no further edges can be added. One novel aspect of this implementation is that it doesn't have to rely on a global state for the implementation of the chart. This makes the code clean, elegant and declarative, while still having the same space and time complexity as the standard imperative implementations. },
2004

P. Ljunglöf. Grammatical Framework and Multiple Context-Free Grammars. FG'04, 9th Conference on Formal Grammar, Nancy, France, 2004.

DownloadAbstractBibTeX
We show that there is a simple one-to-one correspondence between Grammatical Framework with context-free backbone and Multiple Context-Free Grammars (MCFG). Since the parsing complexity for MCFGs is known to be polynomial in the length of the input, we get the same result for context-free GF.
@inproceedings{Ljunglof2004:GF-and-MCFG, Address = {Nancy, France}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {FG'04, 9th Conference on Formal Grammar}, Keywords = {grammars}, Read = {Yes}, Title = {Grammatical {F}ramework and Multiple Context-Free Grammars}, Year = {2004}, Abstract = {We show that there is a simple one-to-one correspondence between Grammatical Framework with context-free backbone and Multiple Context-Free Grammars (MCFG). Since the parsing complexity for MCFGs is known to be polynomial in the length of the input, we get the same result for context-free GF. },
2004

P. Ljunglöf. Expressivity and Complexity of the Grammatical Framework. University of Gothenburg and Chalmers University of Technology, Gothenburg, Sweden, 2004.

DownloadURLAbstractBibTeX
This thesis investigates the expressive power and parsing complexity of the Grammatical Framework (GF), a formalism originally designed for displaying formal propositions and proofs in natural language. This is done by relating gf with two more well-known grammar formalisms; Generalized Context-Free Grammar (GCFG), best seen as a framework for describing various grammar formalisms; and Parallel Multiple Context-Free Grammar (PMCFG), an instance of GCFG.
@phdthesis{Ljunglof2004:Expressivity-and-Complexity-of-GF, Address = {Gothenburg, Sweden}, Author = {Ljungl{\"o}f, Peter}, Keywords = {grammars; parsing}, Read = {Yes}, School = {University of Gothenburg and Chalmers University of Technology}, Title = {Expressivity and Complexity of the Grammatical Framework}, Year = {2004}, Abstract = {This thesis investigates the expressive power and parsing complexity of the Grammatical Framework (GF), a formalism originally designed for displaying formal propositions and proofs in natural language. This is done by relating gf with two more well-known grammar formalisms; Generalized Context-Free Grammar (GCFG), best seen as a framework for describing various grammar formalisms; and Parallel Multiple Context-Free Grammar (PMCFG), an instance of GCFG.},
2003

P. Ljunglöf. An Abstract View of Generalized LR Parsing. NWPT'03, 15th Nordic Workshop on Programming Theory, Turku, Finland, 2003.

DownloadAbstractBibTeX
In this paper we argue that GLR parsing is really just a natural extension of deterministic LR parsing, by abstracting away the implementation of the nondeterminstic parse stack.
@inproceedings{Ljunglof2003:An-Abstract-View-of-Generalized, Address = {Turku, Finland}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {NWPT'03, 15th Nordic Workshop on Programming Theory}, Keywords = {parsing}, Read = {Yes}, Title = {An Abstract View of Generalized {LR} Parsing}, Year = {2003}, Abstract = {In this paper we argue that GLR parsing is really just a natural extension of deterministic LR parsing, by abstracting away the implementation of the nondeterminstic parse stack. },
2002

P. Ljunglöf. Functional Programming and NLP. Chalmers University of Technology, University of Gothenburg, 2002.

DownloadAbstractBibTeX
Most of today's NLP software is developed using either a logic programming language such as Prolog, or a low-level imperative language such as C or C++. In this paper I will try to argue why the paradigm of functional programming (as opposed to logic and imperative programming) matters for natural language processing.
@techreport{Ljunglof2002:Functional-Programming-and-NLP, Author = {Ljungl{\"o}f, Peter}, Institution = {University of Gothenburg}, Read = {Yes}, School = {Chalmers University of Technology}, Title = {Functional Programming and {NLP}}, Type = {Term paper for the GSLT graduate course Natural Language Processing}, Year = {2002}, Abstract = {Most of today's NLP software is developed using either a logic programming language such as Prolog, or a low-level imperative language such as C or C++. In this paper I will try to argue why the paradigm of functional programming (as opposed to logic and imperative programming) matters for natural language processing. },
2002

P. Ljunglöf. Pure Functional Parsing – an advanced tutorial. Department of Computer Science, Gothenburg University and Chalmers University of Technology, 2002.

DownloadAbstractBibTeX
Parsing is the problem of deciding whether a sequence of tokens is recognized by a given grammar, and in that case returning the grammatical structure of the sequence. This thesis investigates different aspects of the parsing problem from the view- point of a functional programmer. It is conceptually divided into two parts, discussing the parsing problem from different perspectives; first as a comprehensive survey of possible implementations of combinator parsers; and second as pure functional implementations of standard context-free parsing algorithms.
@phdthesis{Ljunglof2002:Pure-Functional-Parsing, Author = {Ljungl{\"o}f, Peter}, Keywords = {parsing}, Read = {Yes}, School = {Department of Computer Science, Gothenburg University and Chalmers University of Technology}, Title = {Pure Functional Parsing -- an advanced tutorial}, Type = {Licenciate Thesis}, Year = {2002}, Abstract = {Parsing is the problem of deciding whether a sequence of tokens is recognized by a given grammar, and in that case returning the grammatical structure of the sequence. This thesis investigates different aspects of the parsing problem from the view- point of a functional programmer. It is conceptually divided into two parts, discussing the parsing problem from different perspectives; first as a comprehensive survey of possible implementations of combinator parsers; and second as pure functional implementations of standard context-free parsing algorithms.},
2000

K. Claessen and P. Ljunglöf. Typed Logical Variables in Haskell. Electronic Notes in Theoretical Computer Science, 41(1), 2000.

DownloadAbstractBibTeX
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey. To get full static typing we need to use the Haskell extensions of quantified types and the ST-monad.
@article{ClaessenLjunglof2000:Typed-Logical-Variables-ENTCS, Author = {Claessen, Koen and Ljungl{\"o}f, Peter}, Comment = {Originally in Proceedings of Haskell Workshop 2000, Montreal}, Journal = {Electronic Notes in Theoretical Computer Science}, Keywords = {programming - logic}, Number = {1}, Read = {Yes}, Title = {Typed Logical Variables in {Haskell}}, Volume = {41}, Year = {2000}, Abstract = {We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey. To get full static typing we need to use the Haskell extensions of quantified types and the ST-monad.},
2000

S. Larsson, A. Berman, J. Bos, L. Grönqvist, P. Ljunglöf, and D. Traum. TrindiKit 2.0 Manual. TRINDIKIT 2.0 Manual, number D5.3, TRINDI Project, 2000.

DownloadURLAbstractBibTeX
This is a manual for the TrindiKit, a toolkit for building and experimenting with dialogue move engines and information states, that has been developed in the TRINDI project.
@techreport{LarssonBermanBos2000:TRINDIKIT-2.0-Manual, Author = {Larsson, Staffan and Berman, Alexander and Bos, Johan and Gr{\"o}nqvist, Leif and Ljungl{\"o}f, Peter and Traum, David}, Booktitle = {TRINDIKIT 2.0 Manual}, Institution = {TRINDI Project}, Keywords = {dialogue}, Number = {D5.3}, Title = {{TrindiKit} 2.0 Manual}, Type = {Deliverable}, Year = {2000}, Abstract = {This is a manual for the TrindiKit, a toolkit for building and experimenting with dialogue move engines and information states, that has been developed in the TRINDI project. },
2000

J. Bos, S. Ericsson, S. Larsson, I. Lewin, P. Ljunglöf, and C. Matheson. Dialogue Dynamics in Restricted Dialogue Systems. number D3.2, TRINDI Project, 2000.

DownloadURLBibTeX
@techreport{BosEricssonLarsson2000:Dialogue-Dynamics, Author = {Bos, Johan and Ericsson, Stina and Larsson, Staffan and Lewin, Ian and Ljungl{\"o}f, Peter and Matheson, Colin}, Institution = {TRINDI Project}, Keywords = {dialogue}, Number = {D3.2}, Title = {Dialogue Dynamics in Restricted Dialogue Systems}, Type = {Deliverable}, Year = {2000},
2000

D. Traum, P. Bohlin, J. Bos, S. Ericsson, S. Larsson, I. Lewin, C. Matheson, and D. Milward. Dialogue Dynamics and Levels of Interaction. number D3.1, TRINDI Project, 2000.

DownloadURLBibTeX
@techreport{TraumBohlinBos2000:Dialogue-Dynamics, Author = {Traum, David and Bohlin, Peter and Bos, Johan and Ericsson, Stina and Larsson, Staffan and Lewin, Ian and Matheson, Colin and Milward, David}, Institution = {TRINDI Project}, Keywords = {dialogue}, Month = {February}, Number = {D3.1}, Title = {Dialogue Dynamics and Levels of Interaction}, Type = {Deliverable}, Year = {2000},
2000

S. Larsson, P. Ljunglöf, R. Cooper, E. Engdahl, and S. Ericsson. GoDiS – An Accommodating Dialogue System. ANLP–NAACL'00 Workshop on Conversational Systems, Seattle, Washington, 2000.

DownloadURLAbstractBibTeX
This paper accompanies a demo of the GoDiS system. Work on this system was reported at IJCAI-99 (Bohlin et al., 1999). GoDiS is a prototype dialogue system for information-seeking dialogue, capable of accommodating questions and tasks to enable the user to present information in any desired order, without explicitly naming the dialogue task. GoDiS is implemented using the TRINDIKIT software package, which enables implementation of these behaviours in a compact and natural way.
@inproceedings{LarssonLjunglofCooper2000:GoDiS----An-Accommodating, Address = {Seattle, Washington}, Author = {Larsson, Staffan and Ljungl{\"o}f, Peter and Cooper, Robin and Engdahl, Elisabet and Ericsson, Stina}, Booktitle = {ANLP--NAACL'00 Workshop on Conversational Systems}, Keywords = {dialogue}, Read = {1}, Title = {{GoDiS} -- An Accommodating Dialogue System}, Year = {2000}, Abstract = {This paper accompanies a demo of the GoDiS system. Work on this system was reported at IJCAI-99 (Bohlin et al., 1999). GoDiS is a prototype dialogue system for information-seeking dialogue, capable of accommodating questions and tasks to enable the user to present information in any desired order, without explicitly naming the dialogue task. GoDiS is implemented using the TRINDIKIT software package, which enables implementation of these behaviours in a compact and natural way. },
2000

P. Ljunglöf. Formalizing the Dialogue Move Engine. Götalog'00, 4th Workshop on Semantics and Pragmatics of Dialogue, Gothenburg, Sweden, 2000.

DownloadAbstractBibTeX
In this paper we present a calculus for reasoning mathematically about rule-based dialogue systems – so called dialogue move engines developed in the TRINDI project. The calculus is similar to term rewriting systems and dynamic logic. It is defined using monads, which are used for describing programming languages, and in functional programming to capture computations with side-effects.
@inproceedings{Ljunglof2000:Formalizing-the-Dialogue-Move, Address = {Gothenburg, Sweden}, Author = {Ljungl{\"o}f, Peter}, Booktitle = {G{\"o}talog'00, 4th Workshop on Semantics and Pragmatics of Dialogue}, Keywords = {dialogue}, Read = {Yes}, Title = {Formalizing the Dialogue Move Engine}, Year = {2000}, Abstract = {In this paper we present a calculus for reasoning mathematically about rule-based dialogue systems -- so called dialogue move engines developed in the TRINDI project. The calculus is similar to term rewriting systems and dynamic logic. It is defined using monads, which are used for describing programming languages, and in functional programming to capture computations with side-effects. },
1999

P. Bohlin. Implikation i satslogik. Institutionen för lingvistik, Göteborgs universitet, 1999. Written in Swedish.

DownloadBibTeX
@techreport{Bohlin1999:Implikation-i-satslogik, Author = {Bohlin, Peter}, Institution = {Institutionen f{\"o}r lingvistik, G{\"o}teborgs universitet}, Keywords = {logic}, Note = {Written in Swedish}, Read = {1}, Title = {Implikation i satslogik}, Year = {1999},
1999

S. Larsson, P. Bohlin, J. Bos, and D. Traum. TrindiKit 1.0 Manual. TRINDIKIT 1.0 Manual, number D2.2, TRINDI Project, 1999.

DownloadURLBibTeX
@techreport{LarssonBohlinBos1999:TRINDIKIT-1.0-Manual, Author = {Larsson, Staffan and Bohlin, Peter and Bos, Johan and Traum, David}, Booktitle = {TRINDIKIT 1.0 Manual}, Institution = {TRINDI Project}, Keywords = {dialogue}, Month = {November}, Number = {D2.2}, Title = {{TrindiKit} 1.0 Manual}, Type = {Deliverable}, Year = {1999},
1999

P. Bohlin, J. Bos, S. Larsson, I. Lewin, C. Matheson, and D. Milward. Survey of Existing Interactive Systems. number D1.3, TRINDI Project, 1999.

DownloadURLBibTeX
@techreport{BohlinBosLarsson1999:Survey-of-Existing, Author = {Bohlin, Peter and Bos, Johan and Larsson, Staffan and Lewin, Ian and Matheson, Colin and Milward, David}, Institution = {TRINDI Project}, Keywords = {dialogue}, Number = {D1.3}, Read = {0}, Title = {Survey of Existing Interactive Systems}, Type = {Deliverable}, Year = {1999},
1999

P. Bohlin, R. Cooper, E. Engdahl, and S. Larsson. Accomodating Information States in Dialogue. 3rd Tbilisi Symposium on Language, Logic and Computation, Batumi, Georgia, 1999.

DownloadAbstractBibTeX
In this paper we will look at the role of accommodation in information state transitions associated with dialogue updates. We will point to examples of three kinds of accommodation: accommodation of grounding information, of questions under discussion and of dialogue plan. The informal representation of dialogue information states we present here has been developed in the TRINDI, SDS and INDI projects to explore the nature of dialogue moves.
@inproceedings{BohlinEtal1999-Accomodating, Address = {Batumi, Georgia}, Author = {Bohlin, Peter and Cooper, Robin and Engdahl, Elisabet and Larsson, Staffan}, Booktitle = {3rd Tbilisi Symposium on Language, Logic and Computation}, Keywords = {dialogue}, Read = {1}, Title = {Accomodating Information States in Dialogue}, Year = {1999}, Abstract = {In this paper we will look at the role of accommodation in information state transitions associated with dialogue updates. We will point to examples of three kinds of accommodation: accommodation of grounding information, of questions under discussion and of dialogue plan. The informal representation of dialogue information states we present here has been developed in the TRINDI, SDS and INDI projects to explore the nature of dialogue moves. },
1999

P. Bohlin, R. Cooper, E. Engdahl, and S. Larsson. Information States and Dialogue Move Engines. J. Alexandersson (ed.), IJCAI-99 Workshop on Knowledge and Reasoning in Practical Dialogue Systems, 1999.

DownloadAbstractBibTeX
We explore the notion of information state in relation to dialogue systems, and in particular to the part of a dialogue system we call the dialogue move engine. We use a framework for experimenting with information states and dialogue move engines, and show how an experimental dialogue system currently being developed in Göteborg within the framework can be provided with rules to handle accommodation of questions and plans in dialogue.
@inproceedings{BohlinEtal1999-IS-DME, Author = {Bohlin, Peter and Cooper, Robin and Engdahl, Elisabet and Larsson, Staffan}, Booktitle = {IJCAI-99 Workshop on Knowledge and Reasoning in Practical Dialogue Systems}, Editor = {Alexandersson, Jan}, Keywords = {dialogue}, Read = {1}, Title = {Information States and Dialogue Move Engines}, Year = {1999}, Abstract = {We explore the notion of information state in relation to dialogue systems, and in particular to the part of a dialogue system we call the dialogue move engine. We use a framework for experimenting with information states and dialogue move engines, and show how an experimental dialogue system currently being developed in G{\"o}teborg within the framework can be provided with rules to handle accommodation of questions and plans in dialogue. },
1999

P. Bohlin and S. Larsson. GoDiS and the Dialogue Move Engine Toolkit. ACL'99, 37th Annual Meeting of the Association for Computational Linguistics, College Park, Maryland, 1999.

DownloadBibTeX
@inproceedings{BohlinLarsson1999-GoDiS, Address = {College Park, Maryland}, Author = {Bohlin, Peter and Larsson, Staffan}, Booktitle = {ACL'99, 37th Annual Meeting of the Association for Computational Linguistics}, Keywords = {dialogue}, Read = {1}, Title = {{GoDiS} and the Dialogue Move Engine Toolkit}, Year = {1999},
1998

P. Bohlin. Konstruktiv Mängdteori. University of Gothenburg, 1998. Written in Swedish.

DownloadAbstractBibTeX
Denna uppsats är ett försök att beskriva hur man kan formulera den traditionella mängdteorin konstruktivt. En del ickekonstruktiva axiom måste bytas ut mot alternativa varianter. Den teori som uppkommer är Peter Aczels konstruktiva Zermelo-Fraenkel. Det konstruktiva i teorin rättfärdigas genom tolkning i Martin-Löfs typteori.
@mastersthesis{Bohlin1998-mastersthesis, Author = {Bohlin, Peter}, Keywords = {intuitionism}, Note = {Written in Swedish}, Read = {Yes}, School = {University of Gothenburg}, Title = {Konstruktiv M{\"a}ngdteori}, Type = {Master's thesis}, Year = {1998}, Abstract = {Denna uppsats {\"a}r ett f{\"o}rs{\"o}k att beskriva hur man kan formulera den traditionella m{\"a}ngdteorin konstruktivt. En del ickekonstruktiva axiom m{\aa}ste bytas ut mot alternativa varianter. Den teori som uppkommer {\"a}r Peter Aczels konstruktiva Zermelo-Fraenkel. Det konstruktiva i teorin r{\"a}ttf{\"a}rdigas genom tolkning i Martin-L{\"o}fs typteori.},
1998

P. Bohlin. Beräkning av implikatur och presupposition. University of Gothenburg, 1998. Written in Swedish.

DownloadAbstractBibTeX
Syftet med denna uppsats är att beskriva en möjlig datorimplementering av Gazdars (1979) teori för att beräkna kvantitetsimplikatur och presupposition, och samtidigt undkomma projektionsproblemet.
@techreport{Bohlin1998:Berakning-av-implikatur-och-presupposition, Author = {Bohlin, Peter}, Institution = {University of Gothenburg}, Keywords = {semantics}, Note = {Written in Swedish}, Read = {1}, Title = {Ber{\"a}kning av implikatur och presupposition}, Type = {Term paper for the undergraduate course Pragmatics}, Year = {1998}, Abstract = {Syftet med denna uppsats {\"a}r att beskriva en m{\"o}jlig datorimplementering av Gazdars (1979) teori f{\"o}r att ber{\"a}kna kvantitetsimplikatur och presupposition, och samtidigt undkomma projektionsproblemet.},
1998

P. Bohlin, V. Nilsson, and M. Siverbo. Bamse-land: A Virtual Theatre with Entertaining Agents Based on Well-Known Characters. Extended Abstracts of CHI'98, Los Angeles, California, 1998.

DownloadAbstractBibTeX
The virtual theatre Bamse-land is an entertaining virtual world, where characters taken from the Swedish comic book Bamse are implemented as autonomous agents. The agents interact with each other according to their different personalities, which were derived from the comic. Our main concern has been to make an entertaining and believable application, and by keeping the algorithms non-complicated show that there can be easy solutions to the problem of designing believable agent applications. Experiences with users show that entertaining agents based on well-known characters bring many advantages, including a simplified design process and higher user involvement.
@inproceedings{BohlinEtal1998-bamseland, Address = {Los Angeles, California}, Author = {Bohlin, Peter and Nilsson, Victoria and Siverbo, Magdalena}, Booktitle = {Extended Abstracts of CHI'98}, Read = {Yes}, Title = {Bamse-land: A Virtual Theatre with Entertaining Agents Based on Well-Known Characters}, Year = {1998}, Abstract = {The virtual theatre Bamse-land is an entertaining virtual world, where characters taken from the Swedish comic book Bamse are implemented as autonomous agents. The agents interact with each other according to their different personalities, which were derived from the comic. Our main concern has been to make an entertaining and believable application, and by keeping the algorithms non-complicated show that there can be easy solutions to the problem of designing believable agent applications. Experiences with users show that entertaining agents based on well-known characters bring many advantages, including a simplified design process and higher user involvement. },