Grammatical Inference Systems

Notes:

Grammar induction, also known as grammatical inference or syntactic pattern recognition, is a subfield of machine learning and natural language processing that deals with the automatic induction of grammar from a corpus of sample sentences. Grammar induction algorithms use machine learning techniques to analyze the sample sentences and to infer the underlying grammar that generated them.

Grammar induction algorithms typically work by using a set of sample sentences to learn the rules and patterns of the grammar. The algorithms analyze the sample sentences, looking for common patterns and regularities that can be used to generate new sentences. By learning the rules and patterns of the grammar, the algorithms can infer the underlying grammar that generated the sample sentences.

Grammar induction algorithms can be used in a variety of applications, including natural language processing, speech recognition, and text generation. By inferring the underlying grammar of a language, grammar induction algorithms can help to improve the performance and accuracy of these applications, and to enable them to generate and understand natural language more effectively.

References:

A Learning Algorithm for Multimodal Grammar Inference (2011)

[CITATION] Grammatical inference techniques in pattern analysis TG Evans – Software engineering, 1971 – by JT Tou (Academic, New York … Cited by 58 – Related articles

Grammatical inference: introduction and survey-part I KS Fu… – Pattern Analysis and Machine Intelligence, …, 1986 – ieeexplore.ieee.org Page 1. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. PAMI-8, NO. 3, MAY 1986 Grammatical Inference: Introduction and Survey Part I KING-SUN FU, FELLOW, IEEE, AND TAYLOR L. BOOTH, SENIOR MEMBER, IEEE … Cited by 59 – Related articles – All 9 versions

[CITATION] A syntactic pattern recognition system with learning capability HC Lee… – Proc. Fourth International Symposium on Computer …, 1972 Cited by 25 – Related articles – All 2 versions

[PDF] A multilingual parallel parsed corpus as gold standard for grammatical inference evaluation [PDF] from andy-roberts.net M Van Zaanen, A Roberts… – Proceedings of the Workshop …, 2004 – andy-roberts.net … This method requires (syntactically) structured corpora in multiple languages to test for language independency of the grammatical inference system and corpora structured using different annotation schemes to diminish the influence the annotation has on the evaluation. … Cited by 15 – Related articles – View as HTML – All 26 versions

[BOOK] Grammatical inference: learning automata and grammars [PDF] from videolectures.net C De la Higuera – 2010 – books.google.com Page 1. Grammatical inference Learning Automata and Grammars Colin de la Higuera Page 2. GRAMMATICAL INFERENCE The problem of inducing, learning or inferring grammars has been studied for decades, but only in … Cited by 48 – Related articles – Library Search – All 7 versions

A tree system approach for fingerprint pattern recognition B Moayer… – Pattern Analysis and Machine Intelligence, …, 1986 – ieeexplore.ieee.org … A set of regular tree languages is used to describe the fingerprint patterns and a set of tree automata is used to recognize the coded patterns. In order to infer the structural configuration of the encoded fingerprints, a grammatical inference system is developed. … Cited by 83 – Related articles – All 7 versions

Problems with evaluation of unsupervised empirical grammatical inference systems [PDF] from cosmion.net M van Zaanen… – Grammatical Inference: Algorithms and …, 2008 – Springer Empirical grammatical inference systems are practical systems that learn structure from sequences, in contrast to theoretical grammatical inference systems, which prove learnability of certain classes of grammars. All current empirical grammatical inference … Cited by 4 – Related articles – All 7 versions

A tree system approach for fingerprint pattern recognition B Moayer… – Computers, IEEE Transactions on, 1976 – ieeexplore.ieee.org Page 1. 262 IEEE TRANSACTIONS ON COMPUTERS, VOL. C-25, NO. 3, MARCH 1976 [131 H. Chang, TC Chen, and C. Tung, “The realization ofsymmet- topics in mathematics, such as functions of complex variables, combi … Cited by 80 – Related articles – All 4 versions

Synthesizing context free grammars from sample strings based on inductive CYK algorithm K Nakamura… – Grammatical Inference: Algorithms and …, 2000 – Springer … 1-12-6 Kudankita, Thiyoda-ku, Tokyo, 102-0073 Japan. ishiwata@comsoft.co.jp Abstract. This paper describes a method of synthesizing context free grammars from positive and negative sample strings, which is imple- mented in a grammatical inference system called Synapse. … Cited by 24 – Related articles – BL Direct – All 6 versions

Grammatical inference using suffix trees [PDF] from cosmion.net J Geertzen… – Grammatical Inference: Algorithms and …, 2004 – Springer … This poses no problem for small corpora (of roughly up to 10,000 sentences), but learning from much larger corpora is currently not feasible. Previous work [6] showed that ABL outperforms the EMILE grammatical inference system [7] on small corpora. … Cited by 10 – Related articles – BL Direct – All 11 versions

[BOOK] Grammatical inference: algorithms and applications: 9th international colloquium, ICGI 2008, Saint-Malo, France, September 22-24, 2008: proceedings A Clark, F Coste… – 2008 – books.google.com … 298 Olgierd Unold Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems….. 301 Menno van Zaanen and Jeroen Geertzen Author Index….. 305 Page 11. Cited by 6 – Related articles – Library Search – All 6 versions

The Omphalos context-free grammar learning competition [PDF] from psu.edu B Starkie, F Coste… – Grammatical Inference: Algorithms …, 2004 – Springer … Van Zaanen et al. [1] describe several approaches to the evaluation of grammatical inference systems. These include the following: … In addition this technique requires that all grammatical inference systems be capable of generating example sentences. … Cited by 18 – Related articles – BL Direct – All 16 versions

Fundamental mechanisms in machine learning and inductive inference A Biermann – Fundamentals of Artificial Intelligence, 1986 – Springer … sonable guess might be that every string ends in an A. A grammatical inference system would specify its guessed rule for the class by giving a grammar. … v –~ iv v-*Bv v —* A If one has a successful grammatical inference system, it can find a grammar that represents the set to be … Cited by 19 – Related articles – All 5 versions

Grammar-based workload modeling of communication systems W Dulz… – 1991 – Citeseer … Proceeding from this basic model we built a grammatical inference system for automated construction of proper attributed grammars and a syntax-driven workload generator which can easily be adjusted to any performance modeling environment running under the UNIX op… … Cited by 9 – Related articles – Cached – All 2 versions

[CITATION] Incremental learning of context free grammars by extended inductive cyk algorithm K Nakamura – Workshop and Tutorial at ECML/PKDD: Learning …, 2003 Cited by 13 – Related articles – All 3 versions

Computational grammatical inference P Adriaans… – Innovations in Machine Learning, 2006 – Springer … Kampen.pdf. The actual algorithmic properties of the processes are still vague. Even though, the grammatical inference systems try to model these implicitly. Natural language learning can be roughly grouped in several phases. A … Cited by 5 – Related articles – All 4 versions

Skeletal structural descriptions* LS Levy… – Information and Control, 1978 – Elsevier … We also provide a theoretical basis for methods of grammatical inference based solelyon the phrase structures, but leave open the development of practical grammatical inference systems based on these structuraldescrip- tions. … Cited by 48 – Related articles – Library Search – All 2 versions

Phase transition within grammatical inference [PDF] from pascal-network.org N Pernot, A Cornuéjols… – 2005 – eprints.pascal-network.org … interval. It is consequently of utmost importance to examine the search heuristics that are used in the classical grammatical inference systems. First, are they able to thwart the a pri- ori very low density of hypotheses in the gap? … Cited by 5 – Related articles – All 16 versions

Object generation with neural networks (when spurious memories are useful) AA Ezhov… – Neural networks, 1996 – Elsevier … The treatment of object generating single-class neural systems leads us to the syntactic rather than to discriminant recognition systems (Fu, 1982). Indeed, it is possible to consider them as nonclassical grammatical inference systems. … Cited by 14 – Related articles – BL Direct – All 6 versions

Incremental learning of context free grammars by bridging rule generation and search for semi-optimum rule sets K Nakamura – Grammatical Inference: Algorithms and Applications, 2006 – Springer … [14], whereas many other grammatical inference systems for CFGs, including GRIDS [5] and Emile [16], are classified into generalization based approach, in which the systems generate the rules by analyzing the samples, and generalizing and abstracting the generated rules. … Cited by 8 – Related articles – BL Direct – All 2 versions

Finding structure via compression [PDF] from upenn.edu JL Hutchens… – Proceedings of the Joint Conferences on New …, 1998 – dl.acm.org Page 1. m m / / / / / Finding Structure via Compression Jason L. Hutchens Dept. of E&E Engineering University of Western Australia Nedlands WA 6907, Australia hut ch~ciips, ee. uwa. edu. au Michael D. Alder Dept. … Cited by 12 – Related articles – All 21 versions

Inference of parsable graph grammars for syntactic pattern recognition M Flasinski – Fundamenta Informaticae, 2007 – IOS Press Page 1. Fundamenta Informaticae 80 (2007) 379-413 379 IOS Press Inference of Parsable Graph Grammars for Syntactic Pattern Recognition Mariusz Flasinski* Chair of Information Technology Systems, Jagiellonian University ul. … Cited by 11 – Related articles – All 3 versions

A general framework for adaptive processing of data structures [PDF] from unifi.it P Frasconi, M Gori… – Neural Networks, IEEE …, 1998 – ieeexplore.ieee.org Page 1. 768 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 9, NO. 5, SEPTEMBER 1998 A General Framework for Adaptive Processing of Data Structures Paolo Frasconi, Member, IEEE, Marco Gori, Senior Member, IEEE, and Alessandro Sperduti … Cited by 286 – Related articles – BL Direct – All 27 versions

Grammatical inference as class discrimination [PDF] from uvt.nl M Van Zaanen… – Grammatical Inference: Theoretical Results …, 2010 – Springer … The underlying grammar from which the example sequences are generated is often unknown, which means that evaluation of the effectiveness of the empirical grammatical inference system needs to be performed according to the classification of unseen sequences. … Cited by 2 – Related articles – All 9 versions

Grammatical inference system based on case grammar and semi-syntactic features. HR Smith – Dissertation Abstracts International Part B: Science and …, 1982 – csa.com SGRD is a system which infers grammatical relations from sentences and their corresponding deep case structures without the use of illegal constructs (“near miss” inputs) to assist it. These deep case structures include both syntactic and semantic features and … Cited by 1 – Related articles – Library Search – All 2 versions

[PDF] Question classification by structure induction [PDF] from uvt.nl M Van Zaanen, LA Pizzato… – … JOINT CONFERENCE ON …, 2005 – ilk.uvt.nl … text only. It has been ap- plied to several corpora in different languages with good re- sults [van Zaanen, 2002] and it also compares well against other grammatical inference systems [van Zaanen and Adri- aans, 2001]. The … Cited by 6 – Related articles – View as HTML – BL Direct – All 8 versions

Classifying sentences using induced structure [PDF] from mq.edu.au M Van Zaanen, L Pizzato… – String Processing and Information …, 2005 – Springer … Fig. 1. Overview of the structure induction classification process In the next two sections, we will describe two classifiers that fit into this approach. The alignment-based learning classifier uses a grammatical inference system to find structure in the sentences explicitly. … Cited by 4 – Related articles – BL Direct – All 11 versions

Comparison of Geometric, Connections and Structural Techniques on a Difficult Isolated Word Recognition Task MJ Castro, JC Perez – Third European Conference on Speech …, 1993 – isca-speech.org … Universidad Politécnica de Valencia. Cno. Vera s/n. 46071, Valencia (Spain). ABSTRACT The sequential structure and variable length of speech data suggest the use of structural techniques such as Hidden Markov Models or Grammatical Inference systems. … Cited by 3 – Related articles – All 3 versions

[PDF] A probabilistic model for learning concatenative morphology [PDF] from nips.cc MG Snover… – Proceedings of Neural Information …, 2002 – books.nips.cc … We are particularly interested in devel- oping automated morphological analysis as a first stage of a larger grammatical inference system, and hence we favor a conservative analysis that identifies primarily productive morphological processes (those that can be applied to new … Cited by 16 – Related articles – View as HTML – BL Direct – All 24 versions

Transferability of a rule-based control structure to a new knowledge domain [PDF] from nih.gov RE Brooks… – Proceedings of the Annual Symposium on …, 1979 – ncbi.nlm.nih.gov … of the PDMs …. Examples of PDISs are production systems, grammatical inference systems, or any deductive or inductive inference system that uses patterns or rules to guide the decision-making process. An important type … Cited by 16 – Related articles

Towards machine learning of grammars and compilers of programming languages [PDF] from videolectures.net K Imada… – Machine Learning and Knowledge Discovery in …, 2008 – Springer … Many other grammatical inference systems for CFGs and their extensions are classified into the generalization based approach, in which the systems generate rules by analyzing the samples and generalizing and abstracting the rules. … Cited by 7 – Related articles – All 6 versions

A framework for the competitive evaluation of model inference techniques [PDF] from psu.edu N Walkinshaw, K Bogdanov, C Damas… – Proceedings of the First …, 2010 – dl.acm.org Page 1. A Framework for the Competitive Evaluation of Model Inference Techniques Neil Walkinshaw Department of Computer Science The University of Sheffield Sheffield, UK nw@dcs.shef.ac.uk Kirill Bogdanov Department … Cited by 3 – Related articles – All 9 versions

Robust syntactic recognition techniques for OCR S Lucas, A Amiri… – Handwriting Analysis and …, 1994 – ieeexplore.ieee.org … The other main advantage is that once we have installed in our software base a robust parsing and grammatical inference system, we can use exactly the same software for processing documents or recog- nising speech The only thing that changes is the grammar, which in … Cited by 1 – Related articles

A note on phase transitions and computational pitfalls of learning from sequences [PDF] from pascal-network.org A Cornuéjols… – Journal of Intelligent Information Systems, 2008 – Springer … least one learning example. Most of the standard grammatical inference systems have been devised following this assumption since it confers desirable properties to the search space (see Section 3 below). For instance, the … Cited by 1 – Related articles – All 9 versions

Quantitative structural information for inferring context free grammars with an extended Cocke-Younger-Kasami algorithm MH Zhang – Pattern Recognition Letters, 2011 – Elsevier … discussed their linguistic capability; Nakamura and Ishi- wata (2000) and Nakamura and Matsumoto (2005) synthesized context free grammars from samples by using of inductive CYK algorithm, ie, bottom- up parsing and search and achieved a grammatical inference system. … Cited by 1 – Related articles – All 3 versions

A Multilingual parallel parsed corpus as gold standard for grammatical inference evaluation| Macquarie University ResearchOnline M van Zaanen, A Roberts, E Atwell – 2004 – researchonline.mq.edu.au … This method requires (syntactically) structured corpora in multiple languages to test for language independency of the grammatical inference system and corpora structured using different annotation schemes to diminish the influence the annotation has on the evaluation. …

[PDF] A Study on the Portability of a Grammatical Inference System [PDF] from aclclp.org.tw HH Shih… – 1997 – aclclp.org.tw 1 Abstract This paper presents a study on the portability of our grammatical inference system called CAGC (Computer Assisted Grammar Construction). The CAGC system has been developed [1] to generate broad-coverage grammars for large natural language corpora. It … Related articles – All 7 versions

A SYSTEM AND PROCESS FOR GRAMMATICAL INFERENCE WO Patent WO/2004/097,663, 2004 – wipo.int A grammatical inference system for inferring a grammar from a plurality of example sentences. … Title: A SYSTEM AND PROCESS FOR GRAMMATICAL INFERENCE. Abstract: A grammatical inference system for inferring a grammar from a plurality of example sentences. … Cached – All 2 versions

A System and Process For Grammatical Interference BC Starkie – US Patent App. 10/554,861, 2004 – Google Patents … 29, 2003 (AU) 2003902020 Publication Classification (51) Int. CI. G10L 15/18 (52) US CI (57) (2006.01) 704/9; 704/E 15.022 ABSTRACT A grammatical inference system for inferring a grammar from a plurality of example sentences. …

[CITATION] AIR FORCE CAMBRIDGE RESEARCH LABORATORIES BEDFORD, MASSACHUSETTS TG Evans – Computer and information sciences, 1971 – Academic Press Related articles

Grammatical Inference: Algorithms and Applications-9th International Colloquium, ICGI 2008. Saint-Malo, France, September 22-24, 2008. Proceedings-/Clark, … LCR Languages, AC Gómez… – Lecture Notes in …, 2008 – europa.sim.ucm.es … Inducing Regular Languages Using Grammar-Based Classifier System / Unold, Olgierd, 298-300. Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems / Zaanen, Menno van / Geertzen, Jeroen, 301-304. Author Index /, 305. … Cached

[CITATION] Need for a Unified Theory of Pattern Recognition and Computer Vision DD Mqjumder – Systems and signal processing, 1991 – Oxford & IBH Pub. Co. Related articles

[PDF] String Alignment in Grammatical Inference [PDF] from cosmion.net J Geertzen – 2003 – cosmion.net Page 1. String Alignment in Grammatical Inference what suffix trees can do A thesis submitted in partial fulfilment of the requirements for the degree of Master of Arts at Tilburg University by Jeroen Geertzen Supervised by : Dr. MM van Zaanen Computational Linguistics and AI … Related articles – View as HTML – All 9 versions

[PDF] Stochastic Context Free Grammars for modeling RNAs [PDF] from psu.edu K Abhishek – Citeseer … Our system consists of two major subsystems: (i) Intron detector system, (ii)Grammatical inference system. … B. Grammatical Inference System The grammatical inference system is concerned with inferring stochastic context free grammar from RNA sequences without introns. … Related articles – View as HTML – All 3 versions

[CITATION] Grammar-based Workload Modeling of Communication Systems G Balbo… – … techniques and tools: proceedings of the …, 1992 – Elsevier Science Ltd Related articles

[CITATION] Bootstrapping syntax B Cramer Related articles

[CITATION] Synatactic Methods In Pattern Recognition A Torokhti – 1974 – Elsevier Science & Technology Library Search

[PDF] Problems and possibilities of the evaluation of computational language learning systems [PDF] from uvt.nl F Yang – 2012 – ilk.uvt.nl Page 1. Problems and possibilities of the evaluation of computational language learning systems Fan Yang ANR: 807242 HAIT Master Thesis series nr. 12-002 THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS … View as HTML

[PDF] The Object-oriented Architecture of the Syntactic Pattern-recognition System Based on GDPLL (k) Grammars1 [PDF] from uj.edu.pl J Jurek – Schedae Informaticae, 2004 – ii.uj.edu.pl … A so-called polynomial specifica- tion of the language is obtained as the result of the phase. 2. In the second phase the polynomial specification of the language is verified and refined by the human user of the grammatical inference system. … Related articles – View as HTML – All 6 versions

A System and Process For Grammatical Interference BC Starkie – US Patent App. 20,080/126,078, 2004 – freepatentsonline.com A grammatical inference system for inferring a grammar from a plurality of example sentences. The system selects sentences having a common suffix or prefix component; identifies the other of said suff. … Cached

Rademacher complexity and grammar induction algorithms: what it may (not) tell us [PDF] from uvt.nl S Katrenko, M Van Zaanen – Grammatical Inference: Theoretical Results …, 2010 – Springer … In: Proceedings of the Belgian-Dutch Conference on Artificial Intelligence (BNAIC), pp. 315-322 (2001) 5. van Zaanen, M., Geertzen, J.: Problems with evaluation of unsupervised empirical grammatical inference systems. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. … Related articles – All 9 versions

ROCLING 1997 Poster Papers ??????????????????? – aclweb.org … O97-2004: Hsue-Hueh Shih; Steve Young A Study on the Portability of a Grammatical Inference System. O97-2005: Marco A. Torres; Susumu Kuroyanagi; Akira Iwate Fast Lexical Post-Processing on Cursive Script Recognition. … Cached – All 5 versions

[PDF] ROBERT F. SIMMONS [PDF] from utexas.edu RF SIMMONS – 2003 – www-math.cc.utexas.edu … Robert Lee Young, “Explorations in Story Understanding Using Contextually Accessed Semantic Networks,”1982. Howard Reed Smith, “A Grammatical Inference System Based on Case Grammar and Semo-Syntactic Features,” 1982. … View as HTML – All 5 versions

[PDF] Finding Structure via Compression Jason L. Hutchens Dept. of E&E Engineering University of Western Australia Nedlands WA 6907, Australia [PDF] from ua.ac.be JL Hutchens – cnts.ua.ac.be Page 1. Finding Structure via Compression Jason L. Hutchens Dept. of E&E Engineering University of Western Australia Nedlands WA 6907, Australia hutch@ciips . ee . uwa . edu . au Michael D. Alder Dept. of Mathematics University … Related articles – View as HTML – All 2 versions

[PDF] In 5th International Conference on“Modeling Techniques and Tools for Computer Performance Evaluation”, Turin 1991 [PDF] from psu.edu W Dulz… – Citeseer … Proceeding from this basic model we built a grammatical inference system for automated construction of proper at- tributed grammars and a syntax-driven workload generator which can easily be adjusted to any performance modeling environment running under the UNIX … Related articles – View as HTML – All 2 versions

[TXT] LINK FROM FREER, TTY 77 [TXT] from nih.gov S HI… – profiles.nlm.nih.gov … This led to theoretical results in the area of stochastic grammars – an area which promises to provide formal support for our work in medical modeling. (v) Development of a grammatical inference system using a “developmental paradigm” (W. Fabens). … Cached – All 2 versions

[PDF] Prosodic Phrase Break Prediction: Problems in the Evaluation of Models against a Gold Standard. [PDF] from atala.org CBE Atwell – atala.org … or collection of variant syntactic analyses of sentences can be used for comparative evaluation of rival parsing programs (Atwell, 1996), corpus linguists’ parsing schemes (Atwell et al, 2000), and unsupervised machine learning Grammatical Inference systems (van Zaanen et al … Related articles – View as HTML – All 4 versions

[PDF] Claire Brierley-Eric Atwell [PDF] from leeds.ac.uk W Lane – comp.leeds.ac.uk … or collection of variant syntactic analyses of sentences can be used for comparative evaluation of rival parsing programs (Atwell, 1996), corpus linguists’ parsing schemes (Atwell et al, 2000), and unsupervised machine learning Grammatical Inference systems (van Zaanen et al … Related articles – View as HTML – All 2 versions

[BOOK] Syntactic methods in pattern recognition KS Fu – 1974 – books.google.com … 204 7.4 Bayesian Inference of Stochastic Grammars . . . . . 211 7.5 Synthesis of Stochastic Finite-State Automata . . . . . 212 7.6 A Practical Grammatical Inference System . . . . . 217 7.7 Approximation of Stochastic Languages . . . . . 222 References . . . . . … Cited by 790 – Related articles – Library Search – All 4 versions

Multithreaded parsing for predicting RNA secondary structures MS Al-Mulhem – International Journal of Bioinformatics Research and …, 2010 – Inderscience … The system uses a combination of HMMs and genetic algorithm to identify introns and infer SCFG for RNAs without introns. The system consists of two major subsystems: Intron detector system and grammatical inference system. … Related articles – All 7 versions

[TXT] IV. A. 2. f RUTGERS COMPUTERS IN BIOMEDICINE [TXT] from nih.gov S Amarel – profiles.nlm.nih.gov … (d) The impact of this work on the automated construction of production-rule based AI systems is now under study. 130 Computing in this project is done on the Rutgers-lo. (iii) Development of a grammatical inference system using a “developmental paradigm” (W. Fabens). … Cached – All 2 versions

On KBCS approach in image processing, pattern recognition and computer vision D Dutta Majumder – Knowledge Based Computer Systems, 1990 – Springer … Well known examples of PDISs are production system, grammatical inference system any in deductive or induction analytic or synthetic rule-based inference system that uses patterns or rules to guide the decision making process. … Related articles – All 3 versions

Towards formal structural representation of spoken language: An evolving transformation system (ets) approach [PDF] from ed.ac.uk G Alexander – 2006 – era.lib.ed.ac.uk Page 1. Towards Formal Structural Representation of Spoken Language: An Evolving Transformation System (ETS) Approach Alexander Gutkin T H E U NIVER S I T Y O F E DI NBU R G H Thesis submitted for the degree of Doctor of Philosophy School of Informatics … Cited by 7 – Related articles – Library Search – All 10 versions

Bounding the maximal parsing performance of Non-Terminally Separated grammars F Luque… – Grammatical Inference: Theoretical Results …, 2010 – Springer Page 1. Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars Franco M. Luque and Gabriel Infante-Lopez Grupo de Procesamiento de Lenguaje Natural Universidad Nacional de Córdoba & Conicet … Cited by 1 – Related articles – All 3 versions

?????????????????? ????, ????… – ??????????????. KBSE, …, 1998 – ci.nii.ac.jp … In this paper, how to acquire implicit constraint using grammatical inference from the documents is described. We propose a grammatical inference system which uses inference rules based on logic, and show that the system can learn easy pattern of character lists. … Cached

[PDF] ????????????????? [PDF] from aclweb.org ???… – aclweb.org … We also give a brief introduction to our Chinese grammatical inference system, showing how the system will use the sem-syn initial grammar to generalize structure from the Corpus. 109 Page 12. 1. Introduction Grammar plays an indispensable role in most NLP systems. … All 4 versions

[PDF] ?????????????????? [PDF] from nii.ac.jp KHHTT Nishida – www-kasm.nii.ac.jp … In this paper, how to acquire implicit constraint using grammatical inference from the documents is described. We propose a grammatical inference system which uses inference rules based on logic, and show that the system can learn easy pattern of character lists. …

[PDF] On the Learnability of Mildly Context-Sensitive Languages using Positive Data and Correction Queries [PDF] from grlmc.com LB BONACHE – grammars.grlmc.com Page 1. UNIVERSITAT ROVIRA I VIRGILI FACULTAT DE LLETRES DEPARTAMENT DE FILOLOGIES ROM`ANIQUES On the Learnability of Mildly Context-Sensitive Languages using Positive Data and Correction Queries DOCTORAL DISSERTATION Presented by … Related articles – View as HTML – All 2 versions

On-line learning: where are we so far? [PDF] from lri.fr A Cornuéjols – Ubiquitous knowledge discovery, 2010 – Springer … However, this rule was completely overturned in the 80s. A wealth of new algorithms were developed: viz. decision trees, feed-forward neural networks, support vector machines, grammatical inference systems, and many more. … Cited by 1 – Related articles – All 6 versions

[PDF] Minutiae-based Fingerprint Extraction and Recognition [PDF] from intechopen.com N Zaeri – intechopen.com … for feature extraction. A set of regular tree languages is used to describe the fingerprint patterns. In order to infer the structural configuration of the encoded fingerprints, a grammatical inference system is developed. In (Maio & … Related articles – View as HTML

Prosody resources and symbolic prosodic features for automated phrase break prediction [PDF] from whiterose.ac.uk C Brierley – 2011 – etheses.whiterose.ac.uk Page 1. Prosody Resources and Symbolic Prosodic Features for Automated Phrase Break Prediction Claire Brierley Submitted in accordance with the requirements for the degree of Doctor of Philosophy The University of Leeds School of Computing September 2011 …