| 31. |
- Ljunglöf, Peter, 1971, et al.
(författare)
-
A grammar formalism for specifying ISU-based dialogue systems
- 2008
-
Ingår i: Lecture Notes in Computer Science. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 0302-9743 .- 1611-3349.
-
Konferensbidrag (refereegranskat)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.
|
|
| 32. |
- Ljunglöf, Peter, 1971
(författare)
-
A polynomial time extension of parallel multiple context-free grammar
- 2005
-
Ingår i: LACL-05, 5th Conference on Logical Aspects of Computational Linguistics.
-
Konferensbidrag (refereegranskat)abstract
- It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2, 3] and range concatenation grammar (RCG) [4, 5]. In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], 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.
|
|
| 33. |
|
|
| 34. |
- Ljunglöf, Peter, 1971, et al.
(författare)
-
Assessing the quality of Språkbanken’s annotations
- 2019
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Most of the corpora in Språkbanken Text consist of unannotated plain text, such as almost all newspaper texts, social media texts, novels and official documents. We also have some corpora that are manually annotated in different ways, such as Talbanken (annotated for part-of-speech and syntactic structure), and the Stockholm Umeå Corpus (annotated for part-of-speech). Språkbanken’s annotation pipeline Sparv aims to automatise the work of automatically annotating all our corpora, while still keeping the manual annotations intact. When all corpora are annotated, they can be made available, e.g., in the corpus searh tools Korp and Strix. Until now there has not been any comprehensive overview of the annotation tools and models that Sparv has been using for the last eight years. Some of them have not been updated since the start, such as the part-of-speech tagger Hunpos and the dependency parser MaltParser. There are also annotation tools that we still have not included, such as a constituency-based parser. Therefore Språkbanken initiated a project with the aim of conducting such an overview. This document is the outcome of that project, and it contains descriptions of the types of manual and automatic annotations that we currently have in Språkbanken, as well as an incomplete overview of the state-of-the-art with regards to annotation tools and models.
|
|
| 35. |
- Ljunglöf, Peter, 1971, et al.
(författare)
-
Bamse-land: A virtual theatre with entertaining agents based on well-known characters
- 1998
-
Ingår i: Extended Abstracts of CHI'98, Conference on Human Factors in Computing Systems.
-
Konferensbidrag (refereegranskat)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.
|
|
| 36. |
- Ljunglöf, Peter, 1971
(författare)
-
Converting Grammatical Framework to Regulus
- 2007
-
Ingår i: SPEECHGRAM, Workshop on Grammar-Based Approaches to Spoken Language Processing.
-
Konferensbidrag (refereegranskat)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.
|
|
| 37. |
- Ljunglöf, Peter, 1971
(författare)
-
Dialogue Management as Interactive Tree Building
- 2009
-
Ingår i: DiaHolmia'09, 13th Workshop on the Semantics and Pragmatics of Dialogue.
-
Konferensbidrag (refereegranskat)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.
|
|
| 38. |
- Ljunglöf, Peter, 1971
(författare)
-
Editing Syntax Trees on the Surface
- 2011
-
Ingår i: Nodalida'11: 18th Nordic Conference of Computational Linguistics.
-
Konferensbidrag (refereegranskat)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.
|
|
| 39. |
- Ljunglöf, Peter, 1971, et al.
(författare)
-
Efficient corpus search using unary and binary indexes
- 2022
-
Ingår i: Swedish Language Technology Conference.
-
Konferensbidrag (refereegranskat)abstract
- We investigate how disk-based inverted indexes can be used for efficient searching in large annotated corpora. We give a formal semantics for simple corpus queries, and show how they can be translated into lookups in unary and binary indexes.
|
|
| 40. |
|
|
