نتایج جستجو برای: context sensitive grammar

تعداد نتایج: 721372  

2009
Peter Kiefer

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 ...

2010
Maribel Romero Tilman Becker Emily Bender Pierre Boullier John Chen David Chiang Eric de la Clergerie Claire Gardent Chung-hye Han Karin Harbusch Aravind Joshi Laura Kallmeyer Marco Kuhlmann Alessandro Mazzei David McDonald Martha Palmer Owen Rambow James Rogers Anoop Sarkar Sylvain Schmitz Hiroyuki Seki Vijay Shanker Mark Steedman Amanda Stent Matthew Stone Bonnie Webber Fei Xia Naoki Yoshinaga

This tutorial will describe the use of a factored probabilistic sequence model for parsing speech and text using a bounded store of three to four incomplete constituents over time, in line with recent estimates of human shortterm working memory capacity. This formulation uses a grammar transform to minimize memory usage during parsing. Incremental operations on incomplete constituents in this t...

Journal: :Kybernetika 1969
Ivan M. Havel

In this note it is proved that so called one-sided context-sensitive grammars can generate languages which cannot be generated by any context-free grammar. This fact is not quite new. It has been proved in [3], [4] and [5] (as far as the author knows). In [3] it is proved that a special one-sided context-sensitive grammar suggested by Dr. Fris ([1]) generates a language {a m b'"c"; Hn^ m} which...

2014
Guglielmo Cinque

The need to distinguish two syntactic sources for adnominal adjectives (a direct modification and a relative clause one), with the associated interpretive properties, turns out to have certain implications for the semantic classification of adjectives. We will see that it provides evidence for the existence of a class of truly privative adjectives, and for the conclusion that subsective adjecti...

Journal: :J. Inf., Comm, Ethics in Society 2010
Robin Mansell

This article presents a brief history of the Information Society and a research framework that is intended to address the challenges of ensuring that information and communication technologies are applied in ways that are enabling and responsive to the varied contexts in which people live their lives. ICT policies have come to be reasonably well-accepted as components of broader development pol...

2016
Paul H. Thibodeau David Myers Stephen J. Flusberg

Popular approaches to modeling analogical reasoning have captured a wide range of developmental and cognitive phenomena, but the use of structured symbolic representations makes it difficult to account for the dynamic and context sensitive nature of similarity judgments. Here, the results of a novel behavioral task are offered as an additional challenge for these approaches. Participants were p...

Journal: :Information and Control 1968
Ivan Fris

I t is wel] known tha t context-sensitive languages can be generated by means of monotonic grammars (see Ginsburg, Greibach, 1966) i.e. grammars whose rules have the form f --~ g, where I f ] , the length of f, is not greater than I g I . Such a g rammar generates the language, but almost no grammatical structure of the language is given. When such a structure is also investigated the original ...

2009
Germain Poizat Myriam Fréjus Yvon Haradji

The aim of this study was to analyzing and modeling domestic activities (i.e. what people do in the home). The ultimate goal is to help to design ubiquitous technologies which are context sensitive and which really fit with our needs.

2009
Adrian-Horia Dediu Catalin Ionut Tîrnauca

We use evolutionary algorithms to speed up a rather complex process, the tree adjoining grammars parsing. This improvement is due due to a linear matching function which compares the fitness of different individuals. Internally, derived trees are processed as tree-to-string representations. Moreover, we present some practical results and a post running analysis that may encourage the use of evo...

2017
Alexander Meduna Jakub Martisko

Are propagating scattered context grammars as powerful as context sensitive grammars? This question customarily referred to as the L (PSCG) = L (CS) (see [4]) problem, represents a long standing open problem in formal language theory. The present paper reformulates and answers this question in terms of CD grammar systems. More precisely, the paper introduces CD grammar systems whose components ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید