106,360 Hits in 1.6 sec

Grammar enumeration and inference

R.M. Wharton
1977 Information and Control  
An unidentified language can be identified by inferring a grammar which generates it.  ...  One approach to the problem of grammar inference requires the exhaustive enumeration of the solution space of grammars.  ...  For example, Pao (1969) infers regular grammars and delimited grammars , Gips (in Feldman et al., 1969) infers pivot grammars, and Crespi-Reghizzi (1970) infers free operator precedence grammars.  ... 
doi:10.1016/s0019-9958(77)80005-3 fatcat:txvpxaha7rhs5ouiqocqlbgjgi

Inference of high dimensional grammars

K. S. Fu
1978 Zhongguó gongchéng xuékan  
ABSI RACI Inference of high-dimensional grammars such as tree grammars and web rammars Ii discussed.  ...  ', d identify by block numb. ,) L -~~~~ Inference of hi gh-dimensiona l grammars such as tree grammars and web grammars Is discussed .  ... 
doi:10.1080/02533839.1978.9676600 fatcat:wnsqk7axkraxphoxoebmmmrslm

Inference for transition network grammars

S.M. Chou, K.S. Fu
1979 Computer languages  
aw 6 ffl77 I d yes a brief introduction to trans A survey of 1i~~~~~r A Abstract e in th~ area of gramaatical 2 6 itlon networks and proposes an approach to the in-Inference can be found In .  ...  . , where ristic methods during the process of Inference. GIps £ has describ ed a method to infer a pivot grammar which . 1Is an operator grammar in a very restricted form .d.  ...  An attempt to tlonal constraints are placed upon the grammar bei ng pop an empty stack when the last input symbol has Just inferred 4 .  ... 
doi:10.1016/0096-0551(79)90002-x fatcat:v2qtsttwlfdjpjpoqslcaz2tau

From Grammar Inference to Semantic Inference—An Evolutionary Approach

Željko Kovačević, Marjan Mernik, Miha Ravber, Matej Črepinšek
2020 Mathematics  
This paper describes a research work on Semantic Inference, which can be regarded as an extension of Grammar Inference.  ...  Successfully applying Grammar Inference can result only in identifying the correct syntax of a language.  ...  Inferred DESK grammar.  ... 
doi:10.3390/math8050816 fatcat:xuo62whvrrgrthea6wpwsnygw4

Online Adaptor Grammars with Hybrid Inference

Ke Zhai, Jordan Boyd-Graber, Shay B. Cohen
2014 Transactions of the Association for Computational Linguistics  
Adaptor grammars are a flexible, powerful formalism for defining nonparametric, unsupervised models of grammar productions. This flexibility comes at the cost of expensive inference.  ...  We address the difficulty of inference through an online algorithm which uses a hybrid of Markov chain Monte Carlo and variational inference.  ...  We show that their complicated model and online inference can be captured and extended via an appropriate PCFG grammar and our online adaptor grammar inference algorithm.  ... 
doi:10.1162/tacl_a_00196 fatcat:vb4upczv65dxfarxgpp2mrjhpi

Inference of node replacement graph grammars

Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
2007 Intelligent Data Analysis  
We briefly discuss other grammar inference systems indicating that our study extends classes of learnable graph grammars.  ...  We validate this approach in experiments where we generate graphs from known grammars and measure how well our system infers the original grammar from the generated graph.  ...  We are continuing our research in graph grammar inference to develop methods allowing for discovery of more powerful classes of graph grammars than discussed in this paper.  ... 
doi:10.3233/ida-2007-11405 fatcat:twxdznlcnfg3rln7r3wy2tn57e


2008 International journal on artificial intelligence tools  
We show experiments where we generate graphs from known graph grammars, use our method to infer the grammar from the generated graphs, and then measure the error between the original and inferred grammars  ...  We describe an algorithm and experiments for inference of edge replacement graph grammars.  ...  the inferred grammar can generate the input set of graphs.  ... 
doi:10.1142/s0218213008004047 fatcat:cksdmrmqyfexfht4ifnbyterki

Inference of Finite-State Probabilistic Grammars

Maryanski, Booth
1977 IEEE transactions on computers  
measures for determining how well an inferred probabilistic grammar approximates a sample set.  ...  The problem of the inference of finite-state probabilistic grammars is studied from two points of view. First, the theoretical aspects of grammatical inference are considered.  ...  THE INFERENCE ALGORITHM The key portion of the inference process shown in Fig. 1 is the generation and testing of the grammars which make up the candidates grammar set S?.  ... 
doi:10.1109/tc.1977.1674878 fatcat:5imtlccd6zfshbzao6u45bqmlq

Search-based inference of dialect grammars

Massimiliano Di Penta, Pierpaolo Lombardi, Kunal Taneja, Luigi Troiano
2007 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
Grammar inference is a possible, challenging approach for obtaining suitable grammars from program examples.  ...  Results obtained experimenting the inference of C dialect rules show that the algorithm is able to successfully evolve the grammar.  ...  Grammar inference During recent years, several studies attempted to infer language grammars.  ... 
doi:10.1007/s00500-007-0216-5 fatcat:33wo24imqrdjrc4y6pidh5vwju

Grammar Induction for Minimalist Grammars using Variational Bayesian Inference : A Technical Report [article]

Eva Portelance, Amelia Bruno, Daniel Harasim, Leon Bergen, Timothy J. O'Donnell
2019 arXiv   pre-print
We then present an algorithm for the application of variational Bayesian inference to this formalization.  ...  The following technical report presents a formal approach to probabilistic minimalist grammar parameter estimation. We describe a formalization of a minimalist grammar.  ...  Variational inference for mildly context sensitive language grammars Given that variational Bayesian inference transforms an inference problem into an optimization one, unlike sampling-based methods of  ... 
arXiv:1710.11350v3 fatcat:y2xm4aciozh6pbevqq5qfnsqw4

RL-GRIT: Reinforcement Learning for Grammar Inference [article]

Walt Woods
2021 arXiv   pre-print
Grammar inference can aid in describing the practical language generator behind examples of a data format.  ...  We propose a novel set of mechanisms for grammar inference, RL-GRIT, and apply them to understanding de facto data formats.  ...  Overview of the RL + grammar inference approach.  ... 
arXiv:2105.13114v1 fatcat:3iinemwmm5ebflun4kmdglmyae

Intuitive Theories as Grammars for Causal Inference [chapter]

Joshua B. Tenenbaum, Thomas L. Griffiths, Sourabh Niyogi
2007 Causal Learning  
Again, UG should clearly allow grammars of this sort. How could language learners infer which of these grammars is the true generative system for their language?  ...  The primary functional role of a grammar for causal inference is essentially the same as the role played by grammar in language comprehension: to provide the constraints that make possible successful inductive  ... 
doi:10.1093/acprof:oso/9780195176803.003.0020 fatcat:p2ht7xcejfdzfjrey5kqd5nz7y

On the inference of stochastic regular grammars

A. Van Der Mude, Adrian Walker
1978 Information and Control  
A grammatical inference problem is presented in which the least complex stochastic regular grammar is sought which describes a given set of strings.  ...  The relevance of grammatical inference techniques to the semiautomatic construction from empirical data, of a model of human decision making, is outlined.  ...  Although we consider only regular grammars, we do consider an ambiguous grammar to be a possible output from a grammatical inference program.  ... 
doi:10.1016/s0019-9958(78)90106-7 fatcat:goijxgwlefdlbblbrrugntrqvi

Grammar Inference Technology Applications in Software Engineering [chapter]

Barrett R. Bryant, Marjan Mernik, Dejan Hrnčič, Faizan Javed, Qichao Liu, Alan Sprague
2010 Lecture Notes in Computer Science  
Inferred Grammar Inferred Metamodel 7 Evaluation  The inference is considered successful if we are able to load the model instances into the modeling tool using the inferred metamodel.  ...  : Perimeter -> Network ; } ... 2 3 LISA Grammar Inference Engine NETDIAGRAM -> <<MODEL>> netdiagram { PARTS0 } PARTS0 -> MODELATOM0 FIELDS0 MODELATOM0 -> NETWORKS NETDIAGRAMS WSGROUPS  ... 
doi:10.1007/978-3-642-15488-1_25 fatcat:rbac7lf66rb5dmyie6eytmha2y

Inference of Node Replacement Recursive Graph Grammars [chapter]

Jacek P. Kukluk, Lawrence B. Holder, Diane J. Cook
2006 Proceedings of the 2006 SIAM International Conference on Data Mining  
We briefly discuss other grammar inference systems indicating that our study extends classes of learnable graph grammars.  ...  We briefly discuss other grammar inference systems indicating that our study extends classes of learnable graph grammars.  ...  to the inferred grammar.  ... 
doi:10.1137/1.9781611972764.57 dblp:conf/sdm/KuklukHC06 fatcat:hqee2y7q2ffdtkdg2ok3xq27ju
« Previous Showing results 1 — 15 out of 106,360 results