| 1. |
- Abedin, Md Reaz Ashraful, et al.
(författare)
-
Self-supervised language grounding by active sensing combined with Internet acquired images and text
- 2017
-
Ingår i: Proceedings of the Fourth International Workshop on Recognition and Action for Scene Understanding (REACTS2017). - Málaga : REACTS. - 9788460881766 ; , s. 71-83
-
Konferensbidrag (refereegranskat)abstract
- For natural and efficient verbal communication between a robot and humans, the robot should be able to learn names and appearances of new objects it encounters. In this paper we present a solution combining active sensing of images with text based and image based search on the Internet. The approach allows the robot to learn both object name and how to recognise similar objects in the future, all self-supervised without human assistance. One part of the solution is a novel iterative method to determine the object name using image classi- fication, acquisition of images from additional viewpoints, and Internet search. In this paper, the algorithmic part of the proposed solution is presented together with evaluations using manually acquired camera images, while Internet data was acquired through direct and reverse image search with Google, Bing, and Yandex. Classification with multi-classSVM and with five different features settings were evaluated. With five object classes, the best performing classifier used a combination of Pyramid of Histogram of Visual Words (PHOW) and Pyramid of Histogram of Oriented Gradient (PHOG) features, and reached a precision of 80% and a recall of 78%.
|
|
| 2. |
- Baranwal, Neha, 1988-, et al.
(författare)
-
Extracting Primary Objects and Spatial Relations from Sentences
- 2019
-
Konferensbidrag (refereegranskat)abstract
- In verbal human-robot interaction natural language utterances have to be grounded in visual scenes by the robot. Visual language grounding is a challenging task that includes identifying a primary object among several objects, together with the object properties and spatial relations among the objects. In this paper we focus on extracting this information from sentences only. We propose two language modelling techniques, one uses regular expressions and the other one utilizes Euclidian distance. We compare these two proposed techniques with two other techniques that utilize tree structures, namely an extended Hobb’s algorithm and an algorithm that utilizes a Stanford parse tree. A comparative analysis between all language modelling techniques shows that our proposed two approaches require less computational time than the tree-based approaches. All approaches perform good identifying the primary object and its property, but for spatial relation extraction the Stanford parse tree algorithm performs better than the other language modelling techniques. Time elapsed for the Stanford parse tree algorithm is higher than for the other techniques.
|
|
| 3. |
- Becerra-Bonache, Leonor, et al.
(författare)
-
L systems as Bio-MAS for natural language processing
- 2010
-
Ingår i: Trends in practical applications of agents and multiagent systems. - Berlin : Springer. - 9783642123832 ; , s. 395-402
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we claim that Lindenmayer systems (L systems) –more precisely, ET0L systems– can be considered as bio-inspired multi-agent systems that, because of its inherent features, can be usefully applied to the field of natural language processing (NLP). L systems are a biologically inspired branch of the field of formal languages that provide a parallel and non-sequential grammatical formalism and that can be expressed as a multi-agent system. Taking into account these features and the benefits of the multi-agent approach to NLP, we propose to apply L systems to the description, analysis and processing of natural languages.
|
|
| 4. |
- Becerra-Bonache, Leonor, et al.
(författare)
-
The linguistic relevance of Lindenmayer systems
- 2010
-
Ingår i: Proceedings of the international conference on agents and artificial intelligence. - Valencia : INSTICC Press. ; , s. 395-402
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we investigate the linguistic relevance of Lindenmayer Systems (L Systems). L systems were introduced in the late sixties by Aristid Lindemayer as a mathematical theory of biological development. Thus they can be considered as one of the first bio-inspired models in the theory of formal languages. Two main properties in L systems are 1) the idea of parallelism in the rewriting process and 2) their expressiveness to describe non-context free structures that can be found in natural languages. Therefore, the linguistic relevance of this formalism is clearly based on three main features: bio-inspiration, parallelism and generation of non-context free languages. Despite these interesting properties, L systems have not been investigated from a linguistic point of view. With this paper we point out the interest of applying these bio-inspired systems to the description and processing of natural language.
|
|
| 5. |
- Bensch, Suna, et al.
(författare)
-
Algorithmic properties of Millstream systems
- 2010
-
Ingår i: Developments in Language Theory. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783642144547 - 9783642144554 ; , s. 54-65
-
Konferensbidrag (refereegranskat)abstract
- Millstream systems have recently been proposed as a formalization of the linguistic idea that natural language should be described as a combination of different modules related by interfaces. In this paper we investigate algorithmic properties of Millstream systems having regular tree grammars as modules and MSO logic as interface logic. We focus on the so-called completion problem: Given trees generated by a subset of the modules, can they be completed into a valid configuration of the Millstream system?
|
|
| 6. |
- Bensch, Suna, et al.
(författare)
-
Correct readers for the incremental construction of Millstream configurations by graph transformation
- 2012
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Millstream systems have been proposed as a non-hierarchical method for modelling natural language. Millstream congurations represent and connect multiple structural aspects of sentences. We present a method by which the Millstream congurations corresponding to a sentence are constructed. The construction is incremental, that is, it proceeds as the sentence is being read and is complete when the end of the sentence is reached. It is based on graph transformations and a lexicon which associates words with rules for the graph transformations.
|
|
| 7. |
|
|
| 8. |
- Bensch, Suna, et al.
(författare)
-
Describing resource allocation to dynamically formed groups with grammars
- 2019
-
Ingår i: Simulation and modeling methodologies, technologies and applications. - Cham : Springer. - 9783030014698 - 9783030014704 ; , s. 153-176
-
Bokkapitel (refereegranskat)abstract
- In this paper we model dynamic group formation and resource allocation with grammars in order to gain a deeper understanding into the involved processes. Modelling with grammars allows us to describe resource allocation and group formation as generative processes that provide, at any given time, information about at what stage the process of group formation and resource allocation is. We divide our model into four phases: (1) resource supply, (2) candidate group formation, (3) final group formation, and (4) resource distribution. In particular, we show that we can use permitting random context grammars to describe the first two phases. For the third phase we introduce an algorithm that determines based on a resource allocation strategy the final group to which resources are distributed. The last phase is described with random context grammars under a specific leftmost derivation mode. Our model shows that if information about the available resource and candidate group formation is distributed and kept separate, then the synchronisation of this information at a later stage (i.e. resource distribution phase) needs a more powerful grammar model.
|
|
| 9. |
- Bensch, Suna, et al.
(författare)
-
Deterministic Stack Transducers
- 2016
-
Ingår i: Implementation and Application of Automata. - Cham : Springer. - 9783319409450 - 9783319409467 ; , s. 27-38
-
Konferensbidrag (refereegranskat)abstract
- We introduce and investigate stack transducers, which are one-way stack automata with an output tape. A one-way stack automaton is a classical pushdown automaton with the additional ability to move the stack head inside the stack without altering the contents. For stack transducers, we distinguish between a digging and a non-digging mode. In digging mode, the stack transducer can write on the output tape when its stack head is inside the stack, whereas in non-digging mode, the stack transducer is only allowed to emit symbols when its stack head is at the top of the stack. These stack transducers have a motivation from natural language interface applications, as they capture long-distance dependencies in syntactic, semantic, and discourse structures.We study the computational capacity for deterministic digging and non-digging stack transducers, as well as for their non-erasing and checking versions. We finally show that even for the strongest variant of stack transducers the stack languages are regular.
|
|
| 10. |
- Bensch, Suna, et al.
(författare)
-
Deterministic Stack Transducers
- 2017
-
Ingår i: International Journal of Foundations of Computer Science. - : World Scientific Publishing Co. Pte. Ltd.. - 0129-0541. ; 28:5, s. 583-601
-
Tidskriftsartikel (refereegranskat)abstract
- We introduce and investigate stack transducers, which are one-way stack automata with an output tape. A one-way stack automaton is a classical pushdown automaton with the additional ability to move the stack head inside the stack without altering the contents. For stack transducers, we distinguish between a digging and a non-digging mode. In digging mode, the stack transducer can write on the output tape when its stack head is inside the stack, whereas in non-digging mode, the stack transducer is only allowed to emit symbols when its stack head is at the top of the stack. These stack transducers have a motivation from natural-language interface applications, as they capture long-distance dependencies in syntactic, semantic, and discourse structures. We study the computational capacity for deterministic digging and non-digging stack transducers, as well as for their non-erasing and checking versions. We finally show that even for the strongest variant of stack transducers the stack languages are regular.
|
|
