Grammars - PDFSEARCH.IO - Document Search Engine

Grammars
Results: 385

#	Item
371	Learning Context-Free Grammars with a Simplicity Bias Pat Langley and Sean Stromsten DaimlerChrysler Research and Technology Center 1510 Page Mill Road, Palo Alto, CA[removed]USA [removed] Add to Reading List Source URL: www.isle.org Language: English - Date: 2008-06-09 15:25:16 Syntax Context-free grammar Parsing Formal grammar Grammar induction Stochastic context-free grammar Terminal and nonterminal symbols Verb phrase Bottom-up parsing Formal languages Linguistics Science
372	Relations between Grammars Add to Reading List Source URL: roa.rutgers.edu Language: English - Date: 2011-11-08 08:40:45 Mathematical optimization Markedness Linguistic universal Parsing Linguistics Phonology Optimality theory
373	Chapter 1 Global Index Grammars and Descriptive Power Add to Reading List Source URL: glyc.dc.uba.ar Language: English - Date: 2007-10-19 04:35:13 Global index grammar Indexed grammar Latin script Diaeresis C1 Controls and Latin-1 Supplement World glyph set Formal languages Linguistics Grammar
374	Tree-Adjoining Grammars Aravind K. Joshi1 and Yves Schabes2 Add to Reading List Source URL: www.seas.upenn.edu Language: English - Date: 2006-06-15 22:55:54 Tree-adjoining grammar Mathematics Tree Regular tree grammar Mildly context-sensitive language B-tree Context-free grammar Formal grammar T-tree Formal languages Linguistics Grammar
375	Statistical Properties of Probabilistic Context-Free Grammars Z h i y i Chi* Add to Reading List Source URL: acl.ldc.upenn.edu Language: English - Date: 2002-06-11 09:28:00 Stochastic context-free grammar Kullback–Leibler divergence Entropy Principle of maximum entropy Expectation–maximization algorithm Information theory Distribution Expected value Information bottleneck method Statistics Probability and statistics Statistical theory
376	Removing Left Recursion from Context-Free Grammars£ Robert C. Moore Microsoft Research Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2001-09-07 21:56:25 Computer programming Left recursion Context-free grammar Top-down parsing Terminal and nonterminal symbols Formal grammar Greibach normal form Parsing Production Formal languages Software engineering Computing
377	Parsing Expression Grammars for Structured Data Fabio Mascarenhas1 , S´ergio Medeiros2 , Roberto Ierusalimschy3 Add to Reading List Source URL: www.lbd.dcc.ufmg.br Language: English - Date: 2011-11-01 13:15:44 Parsing Computing Programming language theory Parsing expression grammar Syntactic predicate Formal grammar Roberto Ierusalimschy Top-down parsing Attribute grammar Formal languages Compiler construction Software engineering
378	NEW FRONTIERS BEYOND CONTEXT-FREENESS: DI-GRAMMARS AND DI-AUTOMATA. Peter Staudacher Add to Reading List Source URL: acl.ldc.upenn.edu Language: English - Date: 2002-04-04 17:22:54 Models of computation Theoretical computer science Computer science Applied mathematics Pushdown automaton Global index grammar Formal languages Automata theory Indexed grammar
379	The world’s simplest grammars are creole grammars JOHN H. MCWHORTER Add to Reading List Source URL: elementy.ru Language: English - Date: 2013-10-12 06:56:20 Philosophy of language Language acquisition Creole language Formal languages Creolistics Saramaccan language Universal grammar Pidgin Formal grammar Linguistics Language contact Language
380	Chapter 3 Regular grammars Add to Reading List Source URL: www.montefiore.ulg.ac.be Language: English - Date: 2009-09-17 04:30:34 Mathematics Regular grammar Symbol Regular language Formal grammar Regular expression Prefix grammar Context-sensitive grammar Formal languages Combinatorics Theoretical computer science

UPDATE