Filters








13,327 Hits in 2.9 sec

Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets [chapter]

Katsuhiko Nakamura
2006 Lecture Notes in Computer Science  
. • For reducing the computation time, we divide the learning of translation into two steps, and use incremental learning. First step: arithmetic expressions with +, −, * , /.  ...  Example: A DCG for a non-context-free language A DCG for the language {a n b n c n | n ≥ 1}: p(1) --> [a]. p(t(N)) --> [a],p(N). q(1) --> [b]. q(t(N)) --> [b],q(N). r(1) --> [c]. r(t(N)) --> [c],r(N).  ...  Step 2: By incremental learning, Synapse synthesized the four additional rules after generating 1.8 × 10 7 rules in 4400 sec.  ... 
doi:10.1007/11872436_7 fatcat:sdf2jchjozau3gkvcaqepnbvny

Search for Minimal and Semi-Minimal Rule Sets in Incremental Learning of Context-Free and Definite Clause Grammars

Keita IMADA, Katsuhiko NAKAMURA
2010 IEICE transactions on information and systems  
Keita IMADA †a) , Nonmember and Katsuhiko NAKAMURA †b) , Member SUMMARY This paper describes recent improvements to Synapse system for incremental learning of general context-free grammars (CFGs) and definite  ...  An important feature of our approach is incremental learning, which is realized by a rule generation mechanism called "bridging" based on bottom-up parsing for positive samples and the search for rule  ...  This work is partially supported by KAKENHI 21500148 and the Research Institute for Technology of Tokyo Denki University, Q09J-06.  ... 
doi:10.1587/transinf.e93.d.1197 fatcat:2374p2s63vbl5ddfoo5zrwtvvq

Synthesizing program input grammars

Osbert Bastani, Rahul Sharma, Alex Aiken, Percy Liang
2017 SIGPLAN notices  
We present an algorithm for synthesizing a context-free grammar encoding the language of valid program inputs from a set of input examples and blackbox access to the program.  ...  Our algorithm addresses shortcomings of existing grammar inference algorithms, which both severely overgeneralize and are prohibitively slow.  ...  . • Repetitions: If the current language is P [α]repQ, Phase Two: Generalizing to Context-Free Grammars A number of impossibility results highlight the difficulty of learning context-free grammars [  ... 
doi:10.1145/3140587.3062349 fatcat:3gepkfw7nrhwnduhlzpzuu63sy

Efficiency in the Identification in the Limit Learning Paradigm [chapter]

Rémi Eyraud, Jeffrey Heinz, Ryo Yoshinaka
2016 Topics in Grammatical Inference  
Such models provide a framework to study the behavior of learning algorithms and to formally establish their soundness.  ...  On the one hand, the practical approach consists in using the available data to test the quality of the learning algorithm (for instance the widely used cross-validation technique).  ...  Example 3 illustrates the problem for the IPTD-learning of nonregular languages. It proves that context-free languages cannot be learned under this criterion using context-free grammars.  ... 
doi:10.1007/978-3-662-48395-4_2 fatcat:6wfzms6wy5dhjaglpxccvczqg4

Synthesizing program input grammars

Osbert Bastani, Rahul Sharma, Alex Aiken, Percy Liang
2017 Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2017  
We present an algorithm for synthesizing a context-free grammar encoding the language of valid program inputs from a set of input examples and blackbox access to the program.  ...  Our algorithm addresses shortcomings of existing grammar inference algorithms, which both severely overgeneralize and are prohibitively slow.  ...  . • Repetitions: If the current language is P [α]repQ, Phase Two: Generalizing to Context-Free Grammars A number of impossibility results highlight the difficulty of learning context-free grammars [  ... 
doi:10.1145/3062341.3062349 dblp:conf/pldi/Bastani0AL17 fatcat:cys6fsvn3vffto2cjqhhijg3wa

INCREMENTAL REFINEMENT OF FAÇADE MODELS WITH ATTRIBUTE GRAMMAR FROM 3D POINT CLOUDS

Y. Dehbi, C. Staat, L. Mandtler, L. Pl¨umer
2016 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
The parser enables a model refinement based on new observations with respect to a weighted attribute context-free grammar (WACFG). The falsification or rejection of hypotheses is supported as well.  ...  An incremental interpretation of the data stream is inevitable. This paper presents an incremental parser of grammar rules for an automatic 3D building reconstruction.  ...  ACKNOWLEDGEMENTS This work was supported by the German Research Foundation (DFG) as part of the project "Mapping on Demand" (FOR 1505, PL 188/10-1).  ... 
doi:10.5194/isprsannals-iii-3-311-2016 fatcat:fcysvttatzgxxilkbwharheaxu

INCREMENTAL REFINEMENT OF FAÇADE MODELS WITH ATTRIBUTE GRAMMAR FROM 3D POINT CLOUDS

Y. Dehbi, C. Staat, L. Mandtler, L. Pl¨umer
2016 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
The parser enables a model refinement based on new observations with respect to a weighted attribute context-free grammar (WACFG). The falsification or rejection of hypotheses is supported as well.  ...  An incremental interpretation of the data stream is inevitable. This paper presents an incremental parser of grammar rules for an automatic 3D building reconstruction.  ...  ACKNOWLEDGEMENTS This work was supported by the German Research Foundation (DFG) as part of the project "Mapping on Demand" (FOR 1505, PL 188/10-1).  ... 
doi:10.5194/isprs-annals-iii-3-311-2016 fatcat:qpabevtisnaetnbsw2ramwvnxu

Incremental Discovery of Sequential Pattern from Semi-structured Document Using Grammatical Inference [chapter]

Ramesh Thakur, Suresh Jain, Narendra S. Chaudhari
2012 Lecture Notes in Computer Science  
The result is strictly a context-free grammar rules, which provide a compact summary of corpora that aids understanding of its properties.  ...  We are using hybrid technique of association analysis and sequential algorithm to generate context free grammar rules from semi-structured document (HTML document).  ...  N SFβ = Σ count of β in sentence × length of / length of sentence i=1 Where N= number of sentences in Corpora C and β is a candidate sub-sequence for replacement.  ... 
doi:10.1007/978-3-642-28073-3_30 fatcat:ib5a3nkuonet3looczehprmgj4

Estimating Grammar Parameters Using Bounded Memory [chapter]

Tim Oates, Brent Heeringa
2002 Lecture Notes in Computer Science  
Estimating the parameters of stochastic context-free grammars (SCFGs) from data is an important, well-studied problem.  ...  The memory used by HOLA is bounded by the size of the grammar, not by the amount of training data.  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements either expressed or implied, of DARPA  ... 
doi:10.1007/3-540-45790-9_15 fatcat:x4nyvipd7naeha57wntemxrezq

Synthesizing Program Input Grammars [article]

Osbert Bastani, Rahul Sharma, Alex Aiken, Percy Liang
2017 arXiv   pre-print
We present an algorithm for synthesizing a context-free grammar encoding the language of valid program inputs from a set of input examples and blackbox access to the program.  ...  Our algorithm addresses shortcomings of existing grammar inference algorithms, which both severely overgeneralize and are prohibitively slow.  ...  The views and conclusions herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements either expressed or implied of DARPA or the U.S  ... 
arXiv:1608.01723v2 fatcat:boqqbfxqgjff3du3k3sj2xj6zu

Grammatical Inference in Software Engineering: An Overview of the State of the Art [chapter]

Andrew Stevenson, James R. Cordy
2013 Lecture Notes in Computer Science  
Grammatical inference -used successfully in a variety of fields such as pattern recognition, computational biology and natural language processing -is the process of automatically inferring a grammar by  ...  Unlike the aforementioned fields, which use grammars as a convenient tool to model naturally occuring patterns, software engineering treats grammars as first-class objects typically created and maintained  ...  and context-free grammars.  ... 
doi:10.1007/978-3-642-36089-3_12 fatcat:3qp3xzhhqjgwdhguesrjnvotra

Some Classes of Regular Languages Identifiable in the Limit from Positive Data [chapter]

François Denis, Aurélien Lemay, Alain Terlutte
2002 Lecture Notes in Computer Science  
Inference with Multinomial Tests p. 149 Learning Languages with Help p. 161 Incremental Learning of Context Free Grammars p. 174 Estimating Grammar Parameters Using Bounded Memory p. 185 Stochastic  ...  for Inductive Learning of Typed-Unification Grammars p. 299 A Tool for Language Learning Based on Categorial Grammars and Semantic Information p. 303 'NAIL': Artificial Intelligence Software for  ... 
doi:10.1007/3-540-45790-9_6 fatcat:nmlknwqoyfbybhb6rpomqrn7qy

Page 1314 of Cognitive Science Vol. 32, Issue 8 [page]

2008 Cognitive Science  
language that context-free grammars do not naturally capture.  ...  Two criticisms of this approach concern ability. First, most current corpora, including the Penn Treebdank, are based on context-free, or even less powerful, grammars.  ... 

Incremental Monoidal Grammars [article]

Dan Shiebler, Alexis Toumi, Mehrnoosh Sadrzadeh
2020 arXiv   pre-print
In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata.  ...  This allows us to link the categorical viewpoint on natural language to the standard machine learning notion of probabilistic language model.  ...  Empirically, the complexity of human languages has been shown to lie somewhere in between that of context-free and unrestricted grammars [Shi87] , see the line of work on midly context-sensitive grammars  ... 
arXiv:2001.02296v2 fatcat:6i2w3xlizractausumhfjjwkqi

A survey of grammatical inference in software engineering

Andrew Stevenson, James R. Cordy
2014 Science of Computer Programming  
Grammatical inference -used successfully in a variety of fields such as pattern recognition, computational biology and natural language processing -is the process of automatically inferring a grammar by  ...  Unlike these other fields, which use grammars as a convenient tool to model naturally occuring patterns, software engineering treats grammars as first-class objects typically created and maintained for  ...  context-free grammars.  ... 
doi:10.1016/j.scico.2014.05.008 fatcat:xwasotc745ekbhaoq2n43vrufm
« Previous Showing results 1 — 15 out of 13,327 results