In this paper we present the Petri net setting the optimal order of elimination for direct solver working with hp refined finite finite element meshes. The computational mesh is represented by a graph, with graph vertices corresponding to finite element nodes. The direct solver algorithm is expressed as a sequence of graph grammar productions, attributing the graph vertices. The Petri net dicta...

Abstract The dependency-based annotation format employed within the Spoken Dutch Corpus (CGN) project (van der Wouden et al., 2002) has been designed in such a way as to enable a transparent mapping to the derivational structures of current ‘lexicalized’ grammar formalisms. Through such translations, the CGN tree bank can be used to train and evaluate computational grammars within these framewo...

In this paper, we demonstrate the portability of the lexical acquisition (LA) method proposed in Cholakov and van Noord (2010a). Here, LA refers to the acquisition of linguistic descriptions for words which are not listed in the lexicon of a given computational grammar, i.e., words which are unknown to this grammar. The method we discuss was originally developed for the Dutch Alpino system, and...

This paper brings together the theoretical framework of construction grammar and studies of verbs in Modern Hebrew to furnish an analysis integrating the form and meaning components of morphological structure. In doing so, this work employs and extends Embodied Construction Grammar (ECG; Bergen and Chang 2005), a computational formalism developed to study grammar from a cognitive linguistic per...

We describe an empirically based approach tothe computational management of dialogues. It isbased on an explicit theoretically motivated positionregarding the status of computational models, where itis claimed that computational models of discourse canonly be about computers’ processing of language. Thedialogue model is based on an extensive analysis ofcollected dial...

We present eXLEpse, an easy-to-use editor for creating computational grammars based on the Lexical-Functional Grammar (LFG) formalism (Dalrymple, 2001). The editor is implemented as a plugin for the open-source program development platform Eclipse. eXLEpse provides functionality for editing computational LFG grammars and an interface to the XLE grammar development platform (Crouch et al., 2011)...

A lot of work has been done in the field of natural language processing (NLP) for ARABIC. Few researchers have tried hard to apply on ARABIC the methods of computational linguistics, as for example, Definite Clause Grammar (DCG) [I] and Augmented Transition Networks (ATN) [2]. Because there is not a modern linguistic model for ARABIC grammar within the frame of computational linguistics, the re...

Bibliography 55 Introduction Algorithms for Linguistic Processing is a research proposal in the area of computational linguistics. The proposal focuses on problems of ambiguity and processing efficiency by investigating grammar approximation and grammar specialization techniques. In this section we will try to explain for a broader audience what computational linguistics is, and what the curren...

Automated language processing is central to the drive to enable facilitated referencing of increasingly available Sanskrit E-texts. The first step towards processing Sanskrit text involves the handling of Sanskrit compound words that are an integral part of Sanskrit texts. This firstly necessitates the processing of euphonic conjunctions or sandhi-s, which are points in words or between words, ...

Computational linguistics (CL) has borrowed a lot of ideas from Theoretical Linguistics (TZ). We could not have developed even a simple parser without the research results in TL. It is obviously nonsense to claim that we, computational linguists, do not care research results in TL. llowever, the researchers in TL, it seems to me, are very fond of fighlinq~ especially, those who are called Synla...