Results 1 - 10 of 483

Unsafe Order-2 Tree Languages are Context-Sensitive1

by Naoki Kobayashi, Kazuhiro Inaba, Takeshi Tsukada, Google Inc
"... Abstract. Higher-order grammars have been extensively studied in 1980’s and interests in them have revived recently in the context of higher-order model checking and program verification, where higher-order grammars are used as models of higher-order functional programs. A lot of theoret-ical questi ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
questions remain open, however, for unsafe higher-order grammars (grammars without the so-called safety condition). In this paper, we show that any tree languages generated by order-2 unsafe grammars are context-sensitive. This also implies that any unsafe order-3 word lan-guages are context-sensitive

Locksmith: context-sensitive correlation analysis for race detection

by Polyvios Pratikakis, Jeffrey S. Foster, Michael Hicks - In PLDI ’06: Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation , 2006
"... One common technique for preventing data races in multi-threaded programs is to ensure that all accesses to shared locations are consistently protected by a lock. We present a tool called Locksmith for detecting data races in C programs by looking for violations of this pattern. We call the relation ..."
Abstract - Cited by 118 (10 self) - Add to MetaCart
the relationship between locks and the locations they protect consistent correlation, and the core of our technique is a novel constraint-based analysis that infers consistent correlation context-sensitively, using the results to check that locations are properly guarded by locks. We present the core of our

Nondeterministic Space is Closed Under Complementation

by Neil Immerman , 1988
"... this paper we show that nondeterministic space s(n) is closed under complementation, for s(n) greater than or equal to log n. It immediately follows that the context-sensitive languages are closed under complementation, thus settling a question raised by Kuroda in 1964 [9]. See Hartmanis and Hunt [4 ..."
Abstract - Cited by 262 (14 self) - Add to MetaCart
this paper we show that nondeterministic space s(n) is closed under complementation, for s(n) greater than or equal to log n. It immediately follows that the context-sensitive languages are closed under complementation, thus settling a question raised by Kuroda in 1964 [9]. See Hartmanis and Hunt

Chinese Number-Names, Tree Adjoining Languages, and Mild Context-Sensitivity

by Daniel Radzinski - COMPUTATIONAL LINGUISTICS , 1991
"... ... this paper that the number-name system of Chinese is generated neither by this formalism nor by any other equivalent or weaker ones, suggesting that such a task might require the use of the more powerful Indexed Grammar formalism. Given that our formal results apply only to a proper subset of Ch ..."
Abstract - Cited by 21 (0 self) - Add to MetaCart
. Consequently, either Tree Adjoining Grammars, as currently defined, fail to generate the class of natural languages in a way that discriminates between linguistically warranted sublanguages, or formalisms with generative power equivalent to Tree Adjoining Grammar cannot serve as a basis for the interface

Abstract LOCKSMITH: Context-Sensitive Correlation

by Polyvios Pratikakis, Analysis For Race Detection, Jeffrey S. Foster
"... One common technique for preventing data races in multi-threaded programs is to ensure that all accesses to shared locations are consistently protected by a lock. We present a tool called LOCKSMITH for detecting data races in C programs by looking for violations of this pattern. We call the relation ..."
Abstract - Add to MetaCart
the relationship between locks and the locations they protect consistent correlation, and the core of our technique is a novel constraint-based analysis that infers consistent correlation context-sensitively, using the results to check that locations are properly guarded by locks. We present the core of our

Context-Sensitive Spoken Dialogue Processing with the DOP Model

by Rens Bod - Natural Language Engineering , 1999
"... We show how the DOP model can be used for fast and robust context-sensitive processing of spoken input in a practical spoken dialogue system called OVIS. OVIS, Openbaar Vervoer Informatie Systeem ("Public Transport Information System"), is a Dutch spoken language information system which o ..."
Abstract - Cited by 13 (9 self) - Add to MetaCart
We show how the DOP model can be used for fast and robust context-sensitive processing of spoken input in a practical spoken dialogue system called OVIS. OVIS, Openbaar Vervoer Informatie Systeem ("Public Transport Information System"), is a Dutch spoken language information system which

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

by Nirina Andrianarivelo, Nirina Andrianarivelo
"... Abstract. For any left-linear context-sensitive term rewrite system and any regular language of ground terms I, we build a finite tree automa-ton that recognizes a superset of the descendants of I, i.e. of the terms reachable from I by context-sensitive rewriting. 1 ..."
Abstract - Add to MetaCart
Abstract. For any left-linear context-sensitive term rewrite system and any regular language of ground terms I, we build a finite tree automa-ton that recognizes a superset of the descendants of I, i.e. of the terms reachable from I by context-sensitive rewriting. 1

A Regular Query for Context-Sensitive Relations

by Uwe Mönnich, Frank Morawietz, Stephan Kepser - IRCS Workshop Linguistic Databases 2001 , 2001
"... One of the fundamental problems when defining a query language for databases consists in finding a balance between the desiderata of a sufficiently large expressive power on the one hand and an adequate computability of queries on the other. This problem occurs of course also with linguistic treeban ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
treebanks, the prototype of non-relational semistructured databases. There are many linguistic phenomena which can be adequately annotated by using trees, and for which there exists a powerful yet decidable query language, namely monadic second order logic (MSO). But on the other hand there exist linguistic

Minimal-length linearizations for mildly context-sensitive dependency trees

by Y. Albert Park, Roger Levy - In Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics , 2009
"... The extent to which the organization of natural language grammars reflects a drive to minimize dependency length remains little explored. We present the first algorithm polynomial-time in sentence length for obtaining the minimal-length linearization of a dependency tree subject to constraints of mi ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
of mild context sensitivity. For the minimally contextsensitive case of gap-degree 1 dependency trees, we prove several properties of minimallength linearizations which allow us to improve the efficiency of our algorithm to the point that it can be used on most naturallyoccurring sentences. We use

From Regular To Context-Free To Mildly Context-Sensitive Tree Rewriting Systems: The Path Of Child Language Acquisition

by Robert Frank - Tree Adjoining Grammars: Formalisms, Linguistic Analysis and Processing. CSLI , 2000
"... this paper, I will develop an alternative to these suggestions, incorporating certain insights from each. I propose that children's acquisitional difficulties result not from problems in grammatical knowledge or lexical acquisition per se, but rather from their limited abilities in performing c ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
that the sequence of stages we observe in the development of complex sentences is best understood as the reflection of increasing generative complexity of the underlying formal grammatical system used by the child to construct her tree structure representations. As these changes in the underlying formal grammar
Results 1 - 10 of 483