Modeling Mobile Intention Recognition Problems with Spatially Constrained Tree-Adjoining Grammars
نویسنده
چکیده
The problem of inferring an agent’s intentions from her spatio-temporal behavior is called mobile intention recognition problem. Using formal grammars we can state these problems as parsing problems. We argue that context-free formalisms are not sufficient for important use cases. We introduce Spatially Constrained Tree-Adjoining Grammars which enrich TAGs with knowledge about the structure of space, and about how space and intentions are connected.
منابع مشابه
Spatially Constrained Grammars for Mobile Intention Recognition
Mobile intention recognition is the problem of inferring a mobile agent’s intentions from her spatio-temporal behavior. The intentions an agent can have in a specific situation depend on the spatial context, and on the spatially contextualized behavior history. We introduce two spatially constrained grammars that allow for modeling of complex constraints between space and intentions, one based ...
متن کاملSCTAG: A Mildly Context-Sensitive Formalism for Modeling Complex Intentions in Spatially Structured Environments
The way we represent intentions, behaviors, and the spatial context, is crucial for any approach to mobile intention recognition. Formal grammars are cognitively comprehensible and make expressiveness properties explicit. By adding spatial domain knowledge to a grammar we can reduce parsing ambiguities. We argue that there are a number of mobile intention recognition problems which require the ...
متن کاملExploring Context-Sensitivity in Spatial Intention Recognition
In its most general form, the problem of inferring the intentions of a mobile user from his or her spatial behavior is equivalent to the plan recognition problem which is known to be intractable. Tractable special cases of the problem are therefore of great practical interest. Using formal grammars, intention recognition problems can be stated as parsing problems in a way that makes the connect...
متن کاملPreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملParsing Some Constrained Grammar Formalisms
In this paper we present a scheme to extend a recognition algorithm for Context-Free Grammars (CFG) that can be used to derive polynomial-time recognition algorithms for a set of formalisms that generate a superset of languages generated by CFG. We describe the scheme by developing a Cocke-Kasami-Younger (CKY)-like pure bottom-up recognition algorithm for Linear Indexed Grammars and show how it...
متن کامل