| 1. |
|
|
| 2. |
- Bringert, Björn, 1979, et al.
(författare)
-
Multimodal Dialogue System Grammars
- 2005
-
Ingår i: Proceedings of DIALOR'05, Ninth Workshop on the Semantics and Pragmatics of Dialogue.
-
Tidskriftsartikel (refereegranskat)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.
|
|
| 3. |
- Burden, Håkan, 1976, et al.
(författare)
-
Parsing linear context-free rewriting systems
- 2005
-
Ingår i: IWPT'05, 9th International Workshop on Parsing Technologies.
-
Konferensbidrag (refereegranskat)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.
|
|
| 4. |
- Derbring, Sandra, et al.
(författare)
-
SubTTS: Light-weight automatic reading of subtitles
- 2009
-
Ingår i: Proceedings of the 17th Nordic Conference of Computational Linguistics NODALIDA 2009. - 1736-6305.
-
Konferensbidrag (refereegranskat)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.
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
- Ljunglöf, Peter, 1971
(författare)
-
A grammar formalism for specifying ISU-based dialogue systems
- 2008
-
Ingår i: LONDIAL’08, 12th Workshop on the Semantics and Pragmatics of Dialogue.
-
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 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.
|
|
| 8. |
- 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.
|
|
| 9. |
- 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.
|
|
| 10. |
- 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.
|
|
