Filters








39,850 Hits in 5.9 sec

Page 1439 of Mathematical Reviews Vol. , Issue 2000b [page]

2000 Mathematical Reviews  
) Descriptional complexity of multi-continuous grammars.  ...  “The present paper discusses the descriptional complexity of multi-continuous grammars [see H. C. M. Kleijn and G. Rozen- berg, Internat. J. Comput.  ... 

Descriptional complexity of multi-parallel grammars

Tomáš Masopust
2008 Information Processing Letters  
This paper studies the descriptional complexity of multi-parallel grammars with respect to the number of nonterminals and selectors, and the length of these selectors.  ...  As a result, it proves that every recursively enumerable language is generated by a multi-parallel grammar with no more than seven nonterminals and four selectors of length five.  ...  The present paper studies the descriptional complexity of multi-parallel grammars originally introduced (as multi grammars) by Kleijn and Rozenberg in 1983 (see [2] ).  ... 
doi:10.1016/j.ipl.2008.04.002 fatcat:2yar6rcwufav3lc724s5bcmtu4

Incremental Generation of Visually Grounded Language in Situated Dialogue (demonstration system)

Yanchao Yu, Arash Eshghi, Oliver Lemon
2016 Proceedings of the 9th International Natural Language Generation conference  
The combination of deep semantic representations in TTR with an incremental grammar (Dynamic Syntax) allows for complex multi-turn dialogues to be parsed and generated .  ...  We present a multi-modal dialogue system for interactive learning of perceptually grounded word meanings from a human tutor (Yu et al., ) .  ... 
doi:10.18653/v1/w16-6619 dblp:conf/inlg/YuEL16 fatcat:576so57oq5auhfaynhshraprwm

High-level methodologies for grammar engineering, introduction to the special issue

Denys Duchier, Yannick Parmentier
2015 Journal of Language Modelling  
Grammar engineering is the task of designing and implementing linguistically motivated electronic descriptions of natural language (socalled grammars).  ...  The first attempts at designing large-scale resource grammars were costly because of the complexity of the task (Erbach 1990) and of the number of persons that were needed (see e.g.  ...  These formal grammars differ in terms of expressive power and computational complexity.  ... 
doi:10.15398/jlm.v3i1.117 fatcat:c2bo6drgmrg4pasyvgb5x7bmpq

Meta-modelling and graph grammars for multi-paradigm modelling in AToM3

Juan de Lara, Hans Vangheluwe, Manuel Alfonseca
2004 Journal of Software and Systems Modeling  
As an example of multi-paradigm modelling we present a meta-model for the Object-Oriented Continuous Simulation Language OOCSMP, in which we combine ideas from UML class diagrams (to express the OOCSMP  ...  AToM 3 supports modelling of complex systems using different formalisms, all meta-modelled in their own right.  ...  Hans Vangheluwe gratefully acknowledges partial support for this work by a National Sciences and Engineering Research Council of Canada (NSERC) Individual Research Grant.  ... 
doi:10.1007/s10270-003-0047-5 fatcat:vpk5s4b7ojcazjiryf45i2hg4i

Modeling the Complexity and Descriptive Adequacy of Construction Grammars [article]

Jonathan Dunn
2019 arXiv   pre-print
This paper uses the Minimum Description Length paradigm to model the complexity of CxGs (operationalized as the encoding size of a grammar) alongside their descriptive adequacy (operationalized as the  ...  encoding size of a corpus given a grammar).  ...  Department of Energy and NGA. The views expressed in this presentation are the author's and do not imply endorsement by the DoD or the NGA.  ... 
arXiv:1904.05588v1 fatcat:xwdxclyfnrhejcfte3ebctz5ku

Page 2374 of Mathematical Reviews Vol. , Issue 80F [page]

1980 Mathematical Reviews  
One only has to observe that all functions considered are space-constructible in the sense of complexity theory.  ...  Author’s summary: “We show that all quasirealtime one-way multi-counter languages can be generated by a context-free e-free programmed grammar (even under the free interpretation).  ... 

Page 3604 of Mathematical Reviews Vol. , Issue 90F [page]

1990 Mathematical Reviews  
Chapter 6 continues the investigation of KIMMO systems with an analysis of constraint propagation.  ...  An analysis of the complexity of grammar formalisms using so-called immediate dominance rules and linear precedence con- straints is the topic of Chapter 7.  ... 

Toward an Alternative Comparison between Different Genetic Programming Systems [chapter]

Nguyen Xuan Hoai, R. I. (Bob) McKay, D. Essam, H. A. Abbass
2004 Lecture Notes in Computer Science  
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and separate out the effects  ...  Experimental results are given, comparing the performance and search behavior of Tree Adjoining Grammar Guided Genetic Programming (TAG3P) and Standard Genetic Programming (GP) on some standard problems  ...  The Use of Multi-objective Techniques for Comparisons To solve the problem of adjusting chromosome complexity bounds, one option might be to remove the bounds.  ... 
doi:10.1007/978-3-540-24650-3_7 fatcat:iusrra3aqjcxbanmt2a64me7qe

Multi-agent System for Recognition of Hand Postures [chapter]

Mariusz Flasiński, Janusz Jurek, Szymon Myśliński
2009 Lecture Notes in Computer Science  
A multi-agent system for a recognition of hand postures of the Polish Sign Language is presented in the paper.  ...  An occurrence of a variety of styles of performing hand postures requires an introduction of many grammar productions that differ each from other slightly.  ...  IE-graphs belong to a parsable class of ETPL(k) graph grammars [2, 4, 7] . The ETPL(k) parsing algorithm is of a very good computational complexity, namely O(n 2 ) [4] .  ... 
doi:10.1007/978-3-642-01973-9_91 fatcat:xprzvswfebfgncr2wyskxxneqm

Towards a formalization of multi-touch gestures

Dietrich Kammer, Jan Wojdziak, Mandy Keck, Rainer Groh, Severin Taranko
2010 ACM International Conference on Interactive Tabletops and Surfaces - ITS '10  
To address this problem, we contribute a discussion of strategies towards a formalization of gestural interaction on multi-touch surfaces.  ...  Current multi-touch frameworks offer a set of standard gestures that are easy to use when developing an application.  ...  Our goal is to describe gestures in such a human-readable manner, but with a formally defined grammar. The resulting textural description is similar to the informal description of gesture production.  ... 
doi:10.1145/1936652.1936662 dblp:conf/tabletop/KammerWKGT10 fatcat:gtw57eom3ng3lldv6pyzrh2uau

Introduction to this Special Issue

STEPHAN OEPEN, DAN FLICKINGER, HANS USZKOREIT, JUN-ICHI TSUJII
2000 Natural Language Engineering  
In retrospect, it may seem little has changed in the past five years. hpsg and lfg continue to be the most widely accepted unification-based theories of grammar within computational linguistics, and are  ...  processing techniques, many of them aiming for (often very complex) query processing, dialogue system, or machine translation applications.  ...  Acknowledgements The guest editors for this Special Issue are very grateful to authors and external reviewers, who have all demonstrated an outstanding degree of cooperativity,  ... 
doi:10.1017/s1351324900002333 fatcat:rvkoavtuibgx5nz2dp4ctkp5yy

Introduction to This Special Issue

Ronald L. Braithwaite, Jean J. Bonhomme, C. Debra Furr-Holden
2011 Journal of correctional health care  
In retrospect, it may seem little has changed in the past five years. hpsg and lfg continue to be the most widely accepted unification-based theories of grammar within computational linguistics, and are  ...  processing techniques, many of them aiming for (often very complex) query processing, dialogue system, or machine translation applications.  ...  Acknowledgements The guest editors for this Special Issue are very grateful to authors and external reviewers, who have all demonstrated an outstanding degree of cooperativity,  ... 
doi:10.1177/1078345811415968 pmid:22067115 fatcat:qtudsau6jfbplmdppo4yqx3dse

Introduction to This Special Issue

1994 Folia linguistica  
In retrospect, it may seem little has changed in the past five years. hpsg and lfg continue to be the most widely accepted unification-based theories of grammar within computational linguistics, and are  ...  processing techniques, many of them aiming for (often very complex) query processing, dialogue system, or machine translation applications.  ...  Acknowledgements The guest editors for this Special Issue are very grateful to authors and external reviewers, who have all demonstrated an outstanding degree of cooperativity,  ... 
doi:10.1515/flin.1994.28.1-2.1 fatcat:ebxvub6qebfgfbusnadyrfkxbi

Introduction to this Special Issue

2000 The Plant Journal  
In retrospect, it may seem little has changed in the past five years. hpsg and lfg continue to be the most widely accepted unification-based theories of grammar within computational linguistics, and are  ...  processing techniques, many of them aiming for (often very complex) query processing, dialogue system, or machine translation applications.  ...  Acknowledgements The guest editors for this Special Issue are very grateful to authors and external reviewers, who have all demonstrated an outstanding degree of cooperativity,  ... 
doi:10.1046/j.1365-313x.2000.00815.x fatcat:oadrw4ytprc7daez2aqn2fihji
« Previous Showing results 1 — 15 out of 39,850 results