A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
On the number of components in cooperating distributed grammar systems
2005
Theoretical Computer Science
Preserved Fulltext
Moreover, it is shown that CD grammar systems in sf-mode with only one component can generate only the context-free languages but they can generate non-context-free languages if two components are used ...
protocol which has been considered first for CD grammar systems. ...
In a cooperating distributed grammar system (CD grammar system, for short) several (context-free) grammars, called components of the system, work on a common sentential form in turns, according to some ...
doi:10.1016/j.tcs.2004.03.071
fatcat:sew7dcbe5nc7vdnrksrc55ussq
Teams of pushdown automata
2004
International Journal of Computer Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We introduce team pushdown automata (PDAs) as a theoretical framework capable of modelling various communication and cooperation strategies in complex, distributed systems. ...
At any moment in time one team of PDAs, each with the same symbol on top of its stack, is active: each PDA in the active team replaces the topmost symbol of its stack and changes state, while the current ...
Acknowledgements The first author was supported by an ERCIM postdoctoral fellowship and the third author was supported by the Centre of Excellence in Information Technology, Computer Science and Control ...
doi:10.1080/00207160310001650099
fatcat:3eb3csen6jgkhc3o6z7gyrw37q
Teams of Pushdown Automata
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We introduce team pushdown automata (PDAs) as a theoretical framework capable of modelling various communication and cooperation strategies in complex, distributed systems. ...
At any moment in time one team of PDAs, each with the same symbol on top of its stack, is active: each PDA in the active team replaces the topmost symbol of its stack and changes state, while the current ...
Acknowledgements The first author was supported by an ERCIM postdoctoral fellowship and the third author was supported by the Centre of Excellence in Information Technology, Computer Science and Control ...
doi:10.1007/978-3-540-39866-0_32
fatcat:xz3bllte7vbs7bgwkp3v75ibuq
Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We study the generative power of CD grammar systems (CDGSs) that use a cooperation protocol based on the level of competence on a sentential form -and the competence of their components does not increase ...
cooperation protocol, for various k, with that of context-free forbidding random context grammars, (random context) ET0L systems, and context-free programmed grammars with appearance checking. ...
Acknowledgements We thank an anonymous referee of [7] for suggesting to consider also a dynamic definition of nonincreasing competence-based derivation. ...
doi:10.1007/978-3-642-20000-7_7
fatcat:anqokasphzckhbcuz62547fhei
Page 6954 of Mathematical Reviews Vol. , Issue 95k
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
We show that the family of languages generated by CD grammar systems with the level of competence ‘total’ is a full AFL. ...
Summary: “This paper deals with the problem of constituting teams in a cooperating distributed (CD) grammar system. ...
Learnability in Optimality Theory Bruce Tesar and Paul Smolensky (Rutgers University and The Johns Hopkins University) Cambridge, MA: The MIT Press, 2000, vii+140 pp; hardbound, ISBN 0-262-20126-7, $25.00
2001
Computational Linguistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Chapter 3 introduces constraint demotion (CD) as the grammar-learning part in the expectation-maximization set-up explained earlier. ...
OT claims that all languages have in common a set of constraints on well-formedness, and differ only in which constraints have priority in case of conflict. ...
Chapter 4 focuses on robust interpretive parsing (RIP, the parsing part in the expectation-maximization set-up) and its combination with constraint demotion (RIP/CD learning for short) in the context of ...
doi:10.1162/coli.2000.27.2.316
fatcat:htaffl6jkngjfcfl5rdvtv4f2y
On Competence in CD Grammar Systems
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying sentential form. ...
(context-free) languages and the biologically motivated family of languages generated by ET0L systems with random context. ...
Competence in CD Grammar Systems A cooperating distributed grammar system (CDGS) of degree n, with n ≥ 1, is an (n + 3)-tuple G = (N, T, α, P 1 , . . . , P n ), in which N and T are its disjoint alphabets ...
doi:10.1007/978-3-540-30550-7_7
fatcat:oq56o6xs4fb5jg6afu26fxho5i
On the Degree of Team Cooperation in CD Grammar Systems
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finally, we prove that the degree of team cooperation of a given cooperating/distributed grammar system cannot be algorithmically computed and discuss a decisión problem. * Work partially supported by ...
In this paper, we introduce a dynamical complexity measure, namely the degree of team cooperation, in the aim of investigating "how much" the components of a grammar system cooperate when forming a team ...
ETOL and the class of matrix grammars, are strictly included in the class of languages generated by teams in CD grammar systems [9] . ...
doi:10.1007/978-3-642-22600-7_6
fatcat:nzmf5ujf5zhfnf4lyrt47ikdsa
Page 2566 of Mathematical Reviews Vol. , Issue 98D
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
; Magdeburg); Csuhaj-Varja, Erzsébet (H-AOS-C; Budapest) On competence and completeness in CD grammar systems. ...
The authors consider cooperating distributed grammar systems, and in particular the effects of (in)competence and completeness on the generating power of basic models. ...
Computational design synthesis
2014
Artificial intelligence for engineering design, analysis and manufacturing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Computational design synthesis (CDS) is a research area focused on approaches to automating synthesis activities in design. ...
Unlike an expert system, the grammar rules are more about capturing design logic concisely than about ...
As humans continue to design more complex systems, structures, products, and buildings, the reliance on CDS will likely increase. ...
doi:10.1017/s0890060414000171
fatcat:wnd7254navcyvbd573mx6z7d3q
Learnability in Optimality Theory
1998
Linguistic Inquiry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this article we show how Optimality Theory yields a highly general Constraint Demotion principle for grammar learning. ...
The structure imposed on the space of possible grammars by Optimality Theory allows efficient convergence to a correct grammar. ...
CD accomplishes learning precisely on the basis of the comparison of entire structural descriptions. 9 Further discussion and exemplification of EDCD can be found in Tesar, in press a, and in Tesar and ...
doi:10.1162/002438998553734
fatcat:6tcwtoc525bdti42u6jpu3n57e
Page 611 of Computational Linguistics Vol. 34, Issue 4
[page]
2008
Computational Linguistics
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
For example we could easily measure the precision and recall of an automatic system
(NP (CD six) (NNS months)) — (NP (PDT half) (DT a) (NN year)) (NP (J] United) (NNS Nations)) — (NN UN) (ADVP (RB all) ...
Much previous research has focused on lexical paraphrases (but see Lin and Pantel [2001] and Pang, Knight, and Marcu [2003] for exceptions). ...
Page 32 of Examiner, a Weekly Paper on Politics, Literature, Music, and the Fine Arts Vol. , Issue 2137
[page]
1849
Examiner, a Weekly Paper on Politics, Literature, Music, and the Fine Arts
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Enirlish Grammar. Tenth Edition, A First Book on Geometry. Fourth Edition,
It. Cd.
Easy Poetry for Children. Third Edition, ls.6d. ...
Qassittl Texts, Carefully revised from Uie
A SYSTEM OF
UNIVERSAL GEOGRAPHY.
FOUNDED ON- THE WORKS OF MALTE BliUN AND BALBI.
beat ikditkm.
Easy Lessons on Reasoning. Fourth Edition, cKdSSSwt!!' ...
Page 708 of Linguistics and Language Behavior Abstracts: LLBA Vol. 26, Issue 2
[page]
1992
Linguistics and Language Behavior Abstracts: LLBA
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Joachim, Integrating Database, Expert System, and Hy-
permedia: The Shakespeare CD-ROM Project, Literary & Linguistic
Computing, 1991, 6, 3, 187-191. 1 A brief description of the self-contained CD-ROM ...
It is argued that the development of tools for rapid prototyping & testing of domain-competent grammars should have priority over the settlement of existing grammar theories. ...
Courseware Reviews
1996
IALLT Journal of Language Learning Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A QuickTime version will be available by the end of 1996, which will run simply off of the CD-ROM drive on any computer system; the user will no longer have to make use of the videodisks. ...
The minimum equipment specifications for the Macintosh version are: 250MB hard disk with 8MB RAM, Videologic video board, videodisk player, sound input device, and headphones (CD-ROM player required with ...
The main emphasis is on promoting communicative competence in Spanish. The screen design helps the user go easily from one screen to another and complete the activities for each lesson. ...
doi:10.17161/iallt.v29i2.9623
fatcat:fzudidyebzhztjlpzvticw72ym
« Previous
Showing results 1 — 15 out of 7,646 results