Grammars - PDFSEARCH.IO - Document Search Engine

Grammars
Results: 385

#	Item
331	Are Very Large Context-Free Grammars Tractable? Pierre Boullier & Benoˆıt Sagot INRIA-Rocquencourt Domaine de Voluceau, Rocquencourt BP[removed]Le Chesnay Cedex, France {Pierre.Boullier,Benoit.Sagot}@inria.fr Add to Reading List Source URL: alpage.inria.fr Language: English - Date: 2008-03-11 13:21:02 Mathematics Context-free grammar LL parser Formal grammar Parsing Earley parser Filter Support Controlled grammar Formal languages Software engineering Grammar
332	Parsing Directed Acyclic Graphs with Range Concatenation Grammars Pierre Boullier and Benoˆıt Sagot Alpage, INRIA Paris-Rocquencourt & Universit´e Paris 7 Domaine de Voluceau — Rocquencourt, BP 105 — 78153 Le Ches Add to Reading List Source URL: alpage.inria.fr Language: English - Date: 2009-09-26 13:51:54 Function Symbol Linguistics Predicate Mathematics 4I Directed acyclic graph
333	Linguistic facts as predicates over ranges of the sentence Benoˆıt Sagot INRIA-Rocquencourt, Projet Atoll, Domaine de Voluceau, Rocquencourt B.P[removed]Le Chesnay Cedex, France Add to Reading List Source URL: alpage.inria.fr Language: English - Date: 2008-03-11 13:21:02 Grammar Range concatenation grammars Predicate Categorial grammar Verb phrase Subject Dependency grammar Logic programming Parsing Linguistics Syntax Formal languages
334	Typesetting TEX documents containing computer code W9lodek Bzyl [removed] Abstract I would like to present a preprocessor driven by grammars able to automatically Add to Reading List Source URL: tug.org Language: English - Date: 2001-06-19 07:56:36 Typesetting Typography Procedural programming languages Donald Knuth Cross-platform software TeX Prettyprint Computers and Typesetting ALGOL 68 Computing Software engineering Computer programming
335	MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars Application Note Srinivas Bangalore AT&T Labs – Research Add to Reading List Source URL: alpage.inria.fr Language: English - Date: 2009-09-26 13:15:17 Grammar Compiler construction Parsing SYNTAX Tree-adjoining grammar Earley parser Parse tree Dependency grammar Context-free grammar Linguistics Formal languages Programming language implementation
336	On Business Activity Modeling using Grammars Savitha Srinivasan, Arnon Amir, Prasad Deshpande, and Vladimir Zbarsky IBM Almaden Research Center, 650 Harry Road, San Jose, CA[removed][removed]removed] Add to Reading List Source URL: www2005.org Language: English - Date: 2005-04-05 11:32:07 Time management Workflow Statistics Data management Business Data analysis Data mining Web mining
337	Multi-Component Tree Insertion Grammars Pierre Boullier & Benoˆıt Sagot Alpage, INRIA Paris-Rocquencourt & Universit´e Paris 7 Domaine de Voluceau — Rocquencourt, BP[removed]Le Chesnay Cedex, France {Pierre.Boulli Add to Reading List Source URL: alpage.inria.fr Language: English - Date: 2010-01-11 17:47:51 Symbol Tree Context-free grammar Adjoint functors R-tree Generative linguistics Linguistics Tree-adjoining grammar
338	HAMPI: A Solver for Word Equations over Strings, Regular Expressions, and Context-Free Grammars ADAM KIEZUN, Brigham and Women’s Hospital / Harvard Medical School VIJAY GANESH, Massachusetts Institute of Technology SHA Add to Reading List Source URL: www.pgbovine.net Language: English - Date: 2014-01-03 23:24:44 Theoretical computer science SQL injection SQL Hampi Context-free grammar String Constraint programming Boolean satisfiability problem Formal grammar Formal languages Computing Software engineering
339	An Introduction to Synchronous Grammars David Chiang∗ 21 June[removed]Introduction Synchronous context-free grammars are a generalization of context-free grammars (CFGs) that generate Add to Reading List Source URL: www.isi.edu Language: English - Date: 2006-07-10 17:40:14 Mathematics CYK algorithm Context-free grammar Stochastic context-free grammar Parsing expression grammar Parse tree Synchronous context-free grammar Parsing P versus NP problem Formal languages Theoretical computer science Linguistics
340	Inferring Chemical Reaction Patterns Using Rule Composition in Graph Grammars Jakob Lykke Andersen1 , Christoph Flamm2 , Daniel Merkle1 , Peter F. Stadler2−7 1 Department for Mathematics and Computer Science, Universi Add to Reading List Source URL: www.tbi.univie.ac.at Language: English - Date: 2012-11-10 11:56:10 Morphisms Graph rewriting Graph homomorphism Matching Graph isomorphism Chemical reaction Mathematics Graph theory Theoretical computer science

UPDATE