4,140 Hits in 5.5 sec

Page 5790 of Mathematical Reviews Vol. , Issue 86m [page]

1986 Mathematical Reviews  
Author summary: “We are interested in the minimum time T(S) necessary for computing a family S = {(s;, 3;): 3;, 8; € R?, (1,7) € E} of inner products of order p, on a systolic array of order p x 2.  ...  A position of an w-regular set A in this hierarchy is given by a ‘minimal’ Boolean expression for A over the sets definable by deterministic Biichi automata.  ... 

Structurally and Arithmetically Controlled Grammars

S Ashaari, SHERZOD TURAEV, A Okhunov
2016 International Journal on Perceptive and Cognitive Computing  
In this paper, a new controlled grammar that can be generated using both control mechanismstogether is proposed for future research.  ...  widely in a great variety of scientific disciplines ranging from Linguistics through DNA Computing upto the Informatics and recently come to Big Data Analytics.  ...  For example, if a production has one terminal symbol "a" and two terminal symbol "b", its multiset will be counting as "1" for "a" and "2" for "b" in vector form.  ... 
doi:10.31436/ijpcc.v2i2.39 fatcat:jwoix3ktnvbvfnv6ihpbedbuda

The generative power of rule orderings in formal grammars

1980 Linguistics  
total and partial orderings.  ...  If, for any grammar obeying rule ordering conditions A there is a grammar obeying rule ordering conditions B which contains exactly the same class of derivations, then rule ordering theory B is at least  ...  For 'set of input' we intend a set containing at least one symbol member (e.g.  ... 
doi:10.1515/ling.1980.18.1-2.17 fatcat:4pzmpyfmlbfnheut4bmsfnjcgu

Grammar enumeration and inference

R.M. Wharton
1977 Information and Control  
These techniques are implemented in a general purpose grammar enumerator which is readily adaptable to a variety of classes of grammars, criteria for halting, and measures of grammar complexity.  ...  While enumerative procedures for grammar inference have important formal strengths, they typically require unacceptably large amounts of computation.  ...  The set of nonempty strings over V, denoted V +, is defined as V* --A. The length of a string a is denoted l(~). For any vocabulary V a language over V is a subset of V*.  ... 
doi:10.1016/s0019-9958(77)80005-3 fatcat:txvpxaha7rhs5ouiqocqlbgjgi

Dynamics and computation in functional shifts

Jun Namikawa, Takashi Hashimoto
2004 Nonlinearity  
This shift dynamics is called a functional shift that is defined by a set of bi-infinite sequences of some functions on a set of symbols.  ...  We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation.  ...  This work is partly supported by Research Fellowship Program of Canon Foundation in Europe, and a Grant-in-Aid for Scientific Research (No.12780269) from the Ministry of Education, Culture, Sports, Science  ... 
doi:10.1088/0951-7715/17/4/009 fatcat:da26s2jd2fc2xlexd6cdhru2ji

Language as a Social Institution: Why Phonemes and Words Do Not Live in the Brain

Robert F. Port
2010 Ecological psychology  
A language is the product of a community of speakers who develop its phonological, lexical, and phrasal patterns over many generations.  ...  But our writing system is a further set of conventions that approximate the high-dimensional spoken language in a consistent and regularized graphical form.  ...  And speakers have production skills that allow control over an almost unlimited set of subtle articulatory properties.  ... 
doi:10.1080/10407413.2010.517122 fatcat:r7zu3hj7rfflpheofm6syvmuaq

Tile Rewriting Grammars [chapter]

Stefano Crespi Reghizzi, Matteo Pradella
2003 Lecture Notes in Computer Science  
In a renewed attempt, a model named Tile Rewriting Grammar is introduced combining the rewriting rules with the Tiling System of Giammaresi and Restivo which define the family of Recognizable 2D languages  ...  Past proposals for applying to pictures or 2D languages the generative grammar approach do not match in our opinion the elegance and descriptive adequacy that made Context Free grammars so successful for  ...  We thank Alessandra Cherubini and Pierluigi San Pietro for their comments, and the anonymous referees for helpful suggestions.  ... 
doi:10.1007/3-540-45007-6_16 fatcat:r72wdcardbg7zgn5hz42btkcpy

Against linguistic Cartesianism: Toward a naturalistic model of human language origins and functioning

Francesco Ferretti, Ines Adornetti
2014 Language & Communication  
Hence, we propose a model of language origins and functioning based on two hypotheses: (a) the origin of human language is interpretable in reference to the grounding of language in context; (b) the capacities  ...  There is a conceptual obstacle at the basis of this skepticism: the connection with Cartesian tradition.  ...  Acknowledgements We are very grateful to two anonymous reviewers for valuable and helpful comments on the paper.  ... 
doi:10.1016/j.langcom.2014.04.003 fatcat:5dgl25xj7nef5mm5apixxvwfcu

Computational Linguistics: Analysis of The Functional Use of Microsoft Text Word Processor Text Corrector

Priscilla Chantal Duarte Silva, Ricardo Luiz Perez Teixeira, Victoria Olivia Araujo Vilas Boas
2019 International Journal of Linguistics Literature and Culture  
This indicates that it is necessary to review the conditions and operations of the Microsfot Word reviser engine.  ...  Some phrases in the mother tongue were selected and inserted into Word as tests to fix possible grammatical errors and to check the current text corrector limitations, for later analysis and collection  ...  Note that to establish grammar goals significantly, it is sufficient to assume a partial knowledge of sentences and non-sentences.  ... 
doi:10.19044/llc.v6no2a2 fatcat:eafnc5zzmneh7ftr3wuakhp6ga

Acceptors for the derivation languages of phrase-structure grammars

Johnson M. Hart
1974 Information and Control  
The words in the derivation language of a grammar correspond exactly to the "syntactical graphs" of Loeckx (1970).  ...  Theorem 1.4 is a necessary (but not sufficient) condition for a word to be a derivation word.  ...  In the next section, we give a necessary and sufficient condition. This condition can be' tested for algorithmically, thus leading to the concept of acceptors for a derivation language.  ... 
doi:10.1016/s0019-9958(74)90810-9 fatcat:pffbexrmkzgh3lc6yrj3wfmcai

Page 1756 of Mathematical Reviews Vol. 52, Issue 5 [page]

1976 Mathematical Reviews  
The author gives a necessary and sufficient condition, namely the satisfying of at least one of four technical properties, in order for a power language to be LR(k) for some k.  ...  K. 12435 Necessary and sufficient conditions for a power language to be deterministic. 12434 Internat. J. Comput. Math. 5 (1975), no. 2, 133-142.  ... 

La gramàtica generativa i la facultat del llenguatge: descobriments, preguntes i desafiaments

Noam Chomsky, Ángel J. Gallego, Dennis Ott
2019 Catalan Journal of Linguistics  
Es tractaran algunes de les visions a què aquest enfocament del llenguatge ha donat lloc, incloent-hi èxits importants en la comprensió de * For feedback and suggestions, we are indebted to  ...  We discuss some of the insights this approach to language has produced, including substantial achievements in the understanding of basic properties of language and its interactions with interfacing systems  ...  But complex graph-theoretic objects are not defined by simplest MERGE, and no COPY operation is necessary given that copies are simply a by-product of IM (on standard set-theoretic assumptions).  ... 
doi:10.5565/rev/catjl.288 fatcat:uldgrathijevzamehvew5vip5i

Mathematics, Recursion, and Universals in Human Languages [article]

P. Gilkey, S. Lopez Ornat, A. Karousou
2009 arXiv   pre-print
As a byproduct, we obtain an insight into certain "soft universals" of human languages, which are related to cognitive constructs necessary to implement mathematical reasoning, i.e. mathematical model  ...  There are many scientific problems generated by the multiple and conflicting alternative definitions of linguistic recursion and human recursive processing that exist in the literature.  ...  Acknowledgments: Research of the authors partially supported by Project DGI SEJ2007-67810 and MTM2006-01432.  ... 
arXiv:0909.3591v1 fatcat:okto2ueinzal7axfplkjafsko4

The Faculty of Language: What's Special about It? [chapter]

Ray Jackendoff
2013 Language, Cognition, and Human Nature  
We contest related arguments that language is not an adaptation, namely that it is "perfect," non-redundant, unusable in any partial form, and badly designed for 0022-2860/$ -see front matter q  ...  We examine the question of which aspects of language are uniquely human and uniquely linguistic in light of recent suggestions by Hauser, Chomsky, and Fitch that the only such aspect is syntactic recursion  ...  And unlike motor programs, phonological structure is a level of representation that is crucially used both in perception and production. 8 Moreover, every language contains a set of partly arbitrary, learned  ... 
doi:10.1093/acprof:oso/9780199328741.003.0009 fatcat:7ro3rhcrnbaxfecrhc4tfpxpxe

Multiset-valued linear index grammars

Owen Rambow
1994 Proceedings of the 32nd annual meeting on Association for Computational Linguistics -  
The former models certain uses of multisetvalued feature structures in unification-based formalisms, while the latter is motivated by word order variation and by "quasi-trees", a generalization of trees  ...  The two formalisms are weakly equivalent, and an important subset is at most context-sensitive and polynomially parsable.  ...  For a given vector v E V, the dominance links form a binary relation domv over the set of occurrences of non-terminals in the productions of v such that if domv(A, B), then A (an instance of a symbol)  ... 
doi:10.3115/981732.981768 dblp:conf/acl/Rambow94 fatcat:uwragzo4afgo7l66q34j5io2b4
« Previous Showing results 1 — 15 out of 4,140 results