| 51. |
- Ljunglöf, Peter, 1971
(författare)
-
Konstruktiv mängdteori : Constructive Set Theory
- 1998
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- 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.
|
|
| 52. |
- Ljunglöf, Peter, 1971
(författare)
-
Konstruktiv mängdteori
- 1998
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- 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.
|
|
| 53. |
- Ljunglöf, Peter, 1971, et al.
(författare)
-
Lekbot: A talking and playing robot for children with disabilities
- 2011
-
Ingår i: SLPAT'11: 2nd Workshop on Speech and Language Processing for Assistive Technologies.
-
Konferensbidrag (refereegranskat)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.
|
|
| 54. |
|
|
| 55. |
|
|
| 56. |
- Ljunglöf, Peter, 1971
(författare)
-
Practical Parsing of Parallel Multiple Context-Free Grammars
- 2012
-
Ingår i: TAG+11, 11th International Workshop on Tree Adjoining Grammar and Related Formalisms.
-
Konferensbidrag (refereegranskat)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.
|
|
| 57. |
- Ljunglöf, Peter, 1971
(författare)
-
Pure Functional Parsing - an advanced tutorial
- 2002
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)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 di erent aspects of the parsing problem from the viewpoint of a functional programmer. It is conceptually divided into two parts, discussing the parsing problem from di erent perspectives; rst as a comprehensive survey of possible implementations of combinator parsers; and second as pure functional implementations of standard context-free parsing algorithms. The rst part of the thesis is a survey of the possible implementations of combinator parsers that have previously been suggested in the litterature, relating their dirrefent usages. A number of previously unknown parser implementations are also given, especially e cient for small and medium-sized natural language applications. The second part of the thesis de ne elegant and declarative, pure functional versions of some standard parsing algorithms for context-free grammars. The goal has been to implement the algorithms in a way that is close to their intuitive formulations, not sacri cing computational e ciency. The implementations only use simple data structures not relying on a global updateable state, thus opening the way for nice functional implementations. Finally the thesis implements parser combinators that can collect the grammatical structure in the program, to be able to use any suitable parsing algorithm and not just recursive descent. However, this requires an mildly impure extension of the host language Haskell.
|
|
| 58. |
- Ljunglöf, Peter, 1971
(författare)
-
ShrdLite: Semantic Parsing Using a Handmade Grammar
- 2014
-
Ingår i: SemEval-2014 Task 6: Supervised Semantic Parsing of Robotic Spatial Commands.
-
Konferensbidrag (refereegranskat)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%.
|
|
| 59. |
- Ljunglöf, Peter, 1971, et al.
(författare)
-
Syntactic parsing
- 2010
-
Ingår i: Handbook of Natural Language Processing, 2nd edition. - : CRC Press, Taylor and Francis. - 9781420085921
-
Bokkapitel (refereegranskat)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.
|
|
| 60. |
- Ljunglöf, Peter, 1971-, et al.
(författare)
-
Syntactic parsing
- 2010. - 2
-
Ingår i: Handbook of Natural Language Processing. - Boca Raton, Florida : Chapman & Hall/CRC. ; , s. 59-91
-
Bokkapitel (populärvet., debatt m.m.)abstract
- This chapter presents basic techniques for grammar-driven natural language parsing, that is, analyzing a string of words (typically a sentence) to determine its structural description according to a formal grammar. In most circumstances, this is not a goal in itself but rather an intermediary step for the purpose of further processing, such as the assignment of a meaning to the sentence. To this end, the desired output of grammar-driven parsing is typically a hierarchical, syntactic structure suitable for semantic interpretation (the topic of Chapter 5). The string of words constituting the input will usually have been processed in separate phases of tokenization (Chapter 2) and lexical analysis (Chapter 3), which is hence not part of parsing proper.
|
|
