Filters








45 Hits in 2.3 sec

Decision problems for Clark-congruential languages [article]

Makoto Kanazawa, Tobias Kappé
2018 arXiv   pre-print
We answer this question positively for the class of Clark-congruential grammars, which are of interest to grammatical inference.  ...  We also consider the problem of checking whether a given CFG is Clark-congruential, and show that it is decidable given that the CFG is a DCFG.  ...  Acknowledgements We would like to thank the anonymous referees of LearnAut and ICGI for their comments, which helped improve this paper.  ... 
arXiv:1805.04402v2 fatcat:zpykighi3jbmhctyztyvhd2pum

PCFG Induction for Unsupervised Parsing and Language Modelling

James Scicluna, Colin de la Higuera
2014 Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)  
In this work, we describe a new algorithm for PCFG induction based on a principled approach and capable of inducing accurate yet compact artificial natural language grammars and typical context-free grammars  ...  . * ⇒ w} and the language generated by a grammar G is L(G) = S∈I L(S). A CFG is in Chomsky Normal Form (CNF) if ev-  ...  Congruential Grammars Clark (2010a) defines Congruential CFGs (C-CFGs) as being all the CFGs G which, for any non-terminal A, if u ∈ L(A) then L(A) ⊆ [u] ≡ L(G) (where [u] ≡ L(G) is the syntactic congruence  ... 
doi:10.3115/v1/d14-1141 dblp:conf/emnlp/SciclunaH14 fatcat:7mwrhfeymzhczntgjtaxbufm4i

Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher [chapter]

Alexander Clark
2010 Lecture Notes in Computer Science  
Clark and Eyraud (2007) showed that some context free grammars can be identified in the limit from positive data alone by identifying the congruence classes of the language.  ...  In this paper we consider learnability of context free languages using a mat.  ...  Acknowledgments I am very grateful to two anonymous reviewers for their helpful suggestions, and to Ryo Yoshinaka for some technical suggestions and corrections.  ... 
doi:10.1007/978-3-642-15488-1_4 fatcat:rjydzjrgw5ajdnt2qtuxppji6i

Towards General Algorithms for Grammatical Inference [chapter]

Alexander Clark
2010 Lecture Notes in Computer Science  
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of strings, and a set of  ...  Using this general framework, which we cast as a process of logical inference, we re-analyse Angluin's famous lstar algorithm and several recent algorithms for the inference of context-free grammars and  ...  Acknowledgments I am very grateful to Shalom Lappin and Ryo Yoshinaka for comments and corrections on a draft of this paper; any remaining errors are of course my own.  ... 
doi:10.1007/978-3-642-16108-7_2 fatcat:cam7vezlnra63iewpzcp2zcyy4

Towards General Algorithms for Grammatical Inference [chapter]

Alexander Clark
2010 Lecture Notes in Computer Science  
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of strings, and a set of  ...  Using this general framework, which we cast as a process of logical inference, we re-analyse Angluin's famous lstar algorithm and several recent algorithms for the inference of context-free grammars and  ...  Acknowledgments I am very grateful to Shalom Lappin and Ryo Yoshinaka for comments and corrections on a draft of this paper; any remaining errors are of course my own.  ... 
doi:10.1007/978-3-642-16184-1_29 fatcat:2r7y6s767vh73amtjjo74dppk4

Abstracts of Current Computer Literature

1968 IEEE transactions on computers  
Clark (G.M., Milwaukee); IEEE Trans. Electronic Computers, vol.  ...  5582 Optical -see Lasers Optimal Computer-Programming Languages Programming Languages for Automata 5544 Microprogrammed Control in Problem- Oriented Languages 5574 LINGO Programming Language  ... 
doi:10.1109/tc.1968.229105 fatcat:2ijvliiwarh2jc2lxnwiyktyjq

Computationally intensive econometrics using a distributed matrix-programming language

J. A. Doornik, D. F. Hendry, N. Shephard
2002 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
This paper reviews the need for powerful computing facilities in econometrics, focusing on concrete problems which arise in financial economics and in macroeconomics.  ...  Our response is to extend, in a number of directions, the well known matrix-programming interpreted language Ox developed by the first author.  ...  Acknowledgements We wish to thank Richard Gascoigne and Steve Moyle for invaluable help with the construction of the computational environments. Financial support from the U.K.  ... 
doi:10.1098/rsta.2002.0994 pmid:12804277 fatcat:bvqxa3vepzekbbz2baaiocqg5q

Monte Carlo theory and practice

F James
1980 Reports on progress in physics (Print)  
The Monte Carlo method has long been recognised as a powerful technique for performing certain calculations, generally those too complicated for a more classical approach.  ...  An important theme of this review will be the comparison of Monte Carlo, quasi-Monte Carlo and numerical quadrature for the integration of functions, especially in many dimensions.  ...  Let us express the solution of the problem as a result F, which may be a real number, a set of numbers, a yes/no decision, etc.  ... 
doi:10.1088/0034-4885/43/9/002 fatcat:irwajrznxbhwzizooxnl3nypq4

Monte Carlo theory and practice [chapter]

F James
1991 Experimental Techniques in High-Energy Nuclear and Particle Physics  
The Monte Carlo method has long been recognised as a powerful technique for performing certain calculations, generally those too complicated for a more classical approach.  ...  An important theme of this review will be the comparison of Monte Carlo, quasi-Monte Carlo and numerical quadrature for the integration of functions, especially in many dimensions.  ...  Let us express the solution of the problem as a result F, which may be a real number, a set of numbers, a yes/no decision, etc.  ... 
doi:10.1142/9789814355988_0012 fatcat:ja56s4vomzfl5cum7ougbkgjrq

Subject Index to Volumes 1–75

2001 Information Processing Letters  
to compute, 436, 1930, 3515 for all but finitely many inputs, 1707 infinitely often, 1707 hardcopy computer output, 59 Härder, 790 hardest, 740 context free language, 740 language, 740 optimization  ...  , 2560 P k, l language, 160 #P, 674, 2179 , 2434 , 2453 , 2526 , 2870 , 3550 #P complete, 1442 , 2887 , 2894 problems, 2894 #P completeness, 2887 hard problem, 2813 p-measure, 0, 3438 P -language, 535  ...  problem, 694 rank of a matrix, 3196 order n matrices, 623 tensors, 719 the adjacency matrix of a line graph, 252 rank one matrices, 1164 matrix, 472 rank queries, 1761 r decision trees, 2406 rankable  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e

A method for determining cost-efficient inspection strategies in multistage production systems

Sofie Van Volsem
2007 4OR  
EA/1 is coded in the C++ programming language, a PC with a 2.53 GHz processor was used for program calculation.  ...  Any of a set of computational problems with the same bounds (Θ(n)) on time and space, for deterministic and nondeterministic machines. Definition C.9 (decision problem).  ...  The values of c and k must be fixed for the function f and must not depend on n. Definition C.2 (Θ notation).  ... 
doi:10.1007/s10288-006-0030-4 fatcat:ohdgyyhktjbupkroz5xbihljsu

Model Checking of Component Connectors

Mohammad Izadi, Ali Movaghar, Farhad Arbab
2007 Computer Software and Applications Conference (COMPSAC) Proceedings of the IEEE International  
Figure 7 . 2 : 72 Binary decision diagram for switching function f = z1 ∧ (¬z2 ∨ z3) [29] .  ...  This type of semantics for Reo and its extension called tile logic [21] suffer from a number of other problems. For a survey of these problems see [36] .  ... 
doi:10.1109/compsac.2007.153 dblp:conf/compsac/IzadiMA07 fatcat:lysriwrovfalxdsge5jm7xxuvi

MRD Hashing [chapter]

Rei Safavi-Naini, Shahram Bakhtiari, Chris Charnes
1998 Lecture Notes in Computer Science  
The authors also show equivalence for the discrete log problem certi ed over Z p or for the discrete log problem The author shows that the discrete logarithm problem is trivial in trace one curves; in  ...  AJ Clark, Computers and Security v 16 no 8 1997 pp 669 674 The author discusses strong cryptography, k ey escrow and recovery.  ... 
doi:10.1007/3-540-69710-1_10 fatcat:mezaspbmk5c4nhu227gayoeejq

Vol. 2, No. 1 (Full Issue)

2003 Journal of Modern Applied Statistical Methods  
, as a basis for enrollment decisions.  ...  But first I will provide a summary discussion of congruential RNGs, because they remain the most common kind, and of xorshift RNGs, because they are as fast and simple as congruential but better behaved  ...  Statistical Pronouncements 280 "Sampling is the central problem in statistics" -George W. Snedecor (1946, Statistical methods, p. 453) . "Modern statistical method is a science in itself" -S. S.  ... 
doi:10.22237/jmasm/1051747200 fatcat:ocysn75vi5e5lgk2il76ctuxyy

Vol. 10, No. 1 (Full Issue)

2011 Journal of Modern Applied Statistical Methods  
Acknowledgements The author would like to thank her colleague David Jarrett for his valuable comments on this article and Professor Bob Gilchrist for suggesting the use of the software R for the simulation  ...  Acknowledgement The author would like to acknowledge the use of the Microsoft's EXCEL spread sheet to facilitate numerical calculations for Tables 2-4 .  ...  Answering these questions using a single GPGMM circumvents this problem, especially when the entropy is high (Clark & Muthén, 2009) .  ... 
doi:10.22237/jmasm/1304224500 fatcat:o53ftagxzzgdhkvwedzkdt6r6y
« Previous Showing results 1 — 15 out of 45 results