Sander Vermolen - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged grammar

Heterogeneous Coupled Evolution of Software LanguagesSander Vermolen, Eelco Visser. MoDELS 2008: 630-644 [doi]

Type-Theoretical Bulgarian GrammarKrasimir Angelov. tal 2008: 52-64 [doi]

Toward discourse representation via pregroup grammarsAnne Preller. jolli, 16(2):173-194, 2007. [doi]

Executable Grammars in NewspeakGilad Bracha. ENTCS, 193:3-18, 2007. [doi]

On the Descriptional Complexity of External Hybrid Cooperating Distributed Grammar SystemsBettina Sunckel. jalc, 11(4):435-447, 2006.

End-Marked Maximal Depth-First Contextual GrammarsK. Lakshmanan. dlt 2006: 339-350 [doi]

The Rise and Fall of Periphrastic do in Affirmative Declaratives: A Grammar Efficiency ModelRelja Vulanovic. jql, 12(1):1-31, 2005. [doi]

Automata and AB-Categorial GrammarsIsabelle Tellier. wia 2006: 353-355 [doi]

Spelling and grammar checking using the Web as a text repositoryKai A. Olsen, James G. Williams. jasis, 55(11):1020-1023, 2004. [doi]

Global Index Grammars and Descriptive PowerJosé M. Castaño. jolli, 13(4):403-419, 2004. [doi]

Finite {/Mathbb L} -Fuzzy Acceptors, Regular {/Mathbb L} -Fuzzy Grammars And Syntactic Pattern RecognitionKetty Peeva. ijufks, 12(1):89-104, 2004. [doi]

An algorithm for constructing an even grammar from a language sampleMargaret Ann Francel, David J. John. ACMse 2004: 240-245 [doi]

Computational Benefits of a Totally Lexicalist GrammarKatalin Balogh, Judit Kleiber. TSD 2003: 114-119 [doi]

Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hardChristophe Costa Florêncio. icgi 2002: 49-62 [doi]

A Tale of Four GrammarsClaudia Casadio, Joachim Lambek. sLogica, 71(3):315-329, 2002.

From Contextual Grammars to Range Concatenation GrammarsPierre Boullier. ENTCS, 53:41-52, 2001. [doi]

A Model-Theoretic Description of Tree Adjoining GrammarsFrank Morawietz, Uwe Mönnich. ENTCS, 53:210-232, 2001. [doi]

Robustness of decentralized knowledge systems: a grammar-theoretic viewJozef Kelemen, Gheorghe Paun. jetai, 12(1):91-100, 2000.

Robustness in Tabular Deduction for Multimodal Logical Grammar - Part 1Geert-Jan M. Kruijff. TSD 1999: 345-348 [doi]

Using formal grammars to encode expert problem solving knowledgeClyde Matthews. ACMse 1999: [doi]

Grammar Model and Grammar Induction in the System NL PAGEVlado Keselj. icgi 1998: 57-66 [doi]

Progreedings of the MFCS 98 Satellite Workshop on Grammar Systems, Brno, Czech Republic, August 22-23, 1998Alica Kelemenová, editor, Silesian University, Institute of Computer Science, Opava, Czech Republic, 1998.

Modern Phrase Structure Grammar, Blackwell Textbooks in Linguistics 11Stephen Nightingale. mt, 13(2-3):229-232, 1998. [doi]

The Strong Equivalence of ET0L GrammarsGabriel Istrate. ipl, 62(4):171-176, 1997. [doi]

Grammar Systems with Counting Derivation and Dynamical PrioritiesTudor Balanescu, Horia Georgescu, Marian Gheorghe. BIRTHDAY 1997: 150-166

On the Generative Capacity of Splicing Grammar SystemsGianina Georgescu. BIRTHDAY 1997: 330-345

Grammar Systems for the Description of Certain Natural Language FactsMaria Dolores Jiménez-López, Carlos Martín-Vide. BIRTHDAY 1997: 288-298

Accepting Cooperating Distributed Grammar Systems with Terminal DerivationValeria Mihalache. eatcs, 61, 1997.

Charts, Interaction-free Grammars, and the Compact Representation of AmbiguityMarc Dymetman. IJCAI 1997: 1002-1009

Stochastic Inversion Transduction Grammars, with Application to Segmentation, Bracketing, and Alignment of Parallel CorporaDekai Wu. IJCAI 1995: 1328-1337

On Commutative and Nonassociative Syntactic Calculi and Categorial GrammarsMaciej Kandulski. mlq, 41:217-235, 1995.

Non-associative Lambek Categorial Grammar in Polynormal TimeKees Trautwein, Erik Aarts. mlq, 41:476-484, 1995.

Marcus Contextual GrammarsGheorghe Paun. eatcs, 52:263-273, 1994.

Extended Conditional Tabled Eco-Grammar SystemsValeria Mihalache. eik, 30(4):213-229, 1994.

One-dimensional matrix array grammarsRudolf Freund, Gheorghe Paun. eik, 29(6):357-374, 1993.

Closed Categories and Categorial GrammarDaniel J. Dougherty. ndjfl, 34(1):36-49, 1993.

Hyperedge Replacement: Grammars and LanguagesAnnegret Habel. Volume 643 of Lecture Notes in Computer Science, Springer, 1992.

A General Method for Learning Idiosyncratic GrammarsJill Fain Lehman. icml 1990: 368-376

The structure of index sets and reduced indexed grammarsRainer Parchmann, Jürgen Duske. ita, 24:89-108, 1990.

Combinators and Categorial GrammarPeter Simons. ndjfl, 30(2):241-261, 1989.

The Incorporation of Early Interface Evaluation into Command Language GrammarBrian Sharratt. bcshci 1987: 11-28

Dependency Unification GrammarPeter Hellwig. COLING 1986: 195-198

Grammars and L Forms: An IntroductionDerick Wood. Volume 91 of Lecture Notes in Computer Science, Springer, 1980.

Remarks on the Nonexistence of some Covering GrammarsEsko Ukkonen. tcs 1979: 298-309

On Strict Interpretations of Grammar FormsSeymour Ginsburg, Benton L. Leong, Otto Mayer, Detlef Wotschke. mst, 12:233-252, 1979.

Dynamic Syntax Specification Using Grammar FormsSeymour Ginsburg, Erica M. Rounds. TSE, 4(1):44-55, 1978.

Lower Bounds and Reductions Between Grammar ProblemsHarry B. Hunt III, Thomas G. Szymanski. JACM, 25(1):32-51, 1978. [doi]

Metamorphosis GrammarsAlain Colmerauer. db-workshops 1978: 133-189

On the generative capacity of the strict global grammarsSorin Ciobotaru, Gheorghe Paun. automata 1975: 198-201

Control Sets on GrammarsSeymour Ginsburg, Edwin H. Spanier. mst, 2(2):159-177, 1968.

runs on WebDSL