Results 1  10
of
13
Zen and the art of symbolic computing: Light and fast applicative algorithms for computational linguistics
 In Practical Aspects of Declarative Languages (PADL) symposium
, 2003
"... Abstract. Computational linguistics is an application of computer science which presents interesting challenges from the programming methodology point of view. Developing a realistic platform for the treatment of a natural language in its phonological, morphological, syntactic, and ultimately semant ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Computational linguistics is an application of computer science which presents interesting challenges from the programming methodology point of view. Developing a realistic platform for the treatment of a natural language in its phonological, morphological, syntactic, and ultimately semantic aspects demands a principled modular architecture with complex cooperation between the various layers. Representing large lexical data bases, treating sophisticated phonological and morphological transformations, and processing in real time large corpuses demands fast finitestate methods toolkits. Analysing the syntactic structure, computing anaphoric relations, and dealing with the representation of information flow in dialogue understanding, demands the processing of complex constraints on graph structures, with sophisticated sharing of large nondeterministic search spaces. The talk reports on experiments in using declarative programming for the processing of the sanskrit language, in its phonological and morphological
The reactive engine for modular transducers
 Algebra, Meaning and Computation, Essays Dedicated to Joseph A. Goguen on the Occasion of His 65th Birthday
, 2005
"... Abstract. This paper explains the design of the second release of the Zen toolkit [5–7]. It presents a notion of reactive engine which simulates finitestate machines represented as shared aums [8]. We show that it yields a modular interpreter for finite state machines described as local transducers ..."
Abstract

Cited by 10 (9 self)
 Add to MetaCart
Abstract. This paper explains the design of the second release of the Zen toolkit [5–7]. It presents a notion of reactive engine which simulates finitestate machines represented as shared aums [8]. We show that it yields a modular interpreter for finite state machines described as local transducers. For instance, in the manner of Berry and Sethi, we define a compiler of regular expressions into a scheduler for the reactive engine, chaining through aums labeled with phases — associated with the letters of the regular expression. This gives a modular composition scheme for general finitestate machines. Many variations of this basic idea may be put to use according to circonstances. The simplest one is when aums are reduced to dictionaries, i.e. to (minimalized) acyclic deterministic automata recognizing finite languages. Then one may proceed to adding supplementary structure to the aum algebra, namely nondeterminism, loops, and transduction. Such additional choice points require fitting some additional control to the reactive engine. Further parameters are required for some functionalities. For instance, the local word access stack is handy as an argument to the output routine in the case of transducers. Internal virtual addresses demand the full local state access stack for their interpretation. A characteristic example is provided, it gives a complete analyser for compound substantives. It is an abstraction from a modular version of the Sanskrit segmenter presented in [9]. This improved segmenter uses a regular relation condition relating the phases of morphology generation, and enforcing the correct geometry of morphemes. Thus we obtain compound nouns from iic*.(noun+iic.ifc), where iic and ifc are the respectively prefix and suffix substantival forms for compound formation. 1 Regular morphology Dedicated to Joseph Goguen for his 65th birthday We first consider the simplest framework for finite automata, where the state transition graph is a dictionary structure (lexical tree or trie). Such structures represent acyclic deterministic finitestate automata, with maximal sharing of initial paths. Every state is accessible from the initial state, and we may also assume that every state is on an accepting path. When we minimize the tree as a dag, we obtain the corresponding minimal deterministic automaton. Such
Derivatives of containers
 of Lecture notes in Computer Science
, 2003
"... Abstract. We are investigating McBride’s idea that the type of onehole contexts are the formal derivative of a functor from a categorical perspective. Exploiting our recent work on containers we are able to characterise derivatives by a universal property and show that the laws of calculus includin ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Abstract. We are investigating McBride’s idea that the type of onehole contexts are the formal derivative of a functor from a categorical perspective. Exploiting our recent work on containers we are able to characterise derivatives by a universal property and show that the laws of calculus including a rule for initial algebras as presented by McBride hold — hence the differentiable containers include those generated by polynomials and least fixpoints. Finally, we discuss abstract containers (i.e. quotients of containers) — this includes a container which plays the role of e x in calculus by being its own derivative. 1
Automata Mista
 Zohar Manna on the Occasion of His 64th Birthday
, 2003
"... Abstract. We present a general methodology for nondeterministic programming based on pure functional programming. We construct families of automata constructions which are used as finitestate process descriptions. We use as algorithmic description language Pidgin ML, a core applicative subset of O ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We present a general methodology for nondeterministic programming based on pure functional programming. We construct families of automata constructions which are used as finitestate process descriptions. We use as algorithmic description language Pidgin ML, a core applicative subset of Objective Caml. 1
Purely Applicative XML Cursor
, 2004
"... Cursor model is a relatively new approach for XML processing. In this model, a cursor acts like a lens that focuses on one node. You can freely move the cursor back and forth in an XML document, and edit the node it indicates. This model can be easily implemented in imperative language like C or Jav ..."
Abstract
 Add to MetaCart
(Show Context)
Cursor model is a relatively new approach for XML processing. In this model, a cursor acts like a lens that focuses on one node. You can freely move the cursor back and forth in an XML document, and edit the node it indicates. This model can be easily implemented in imperative language like C or Java, by using a pointer to subtree in the XML tree as the cursor. In a fully applicative setting, however, this simple scheme does not work since subtree modification through pointers breaks the principle of referential transparency. We propose a purely functional data structure named “Slit ” to realize a cursor on a tree efficiently in applicative manner. Slit is similar to the zipper data structure introduced by Huet, but has some improvements compared to the zipper in terms of efficiency and expressiveness while handling a tree with variadic child nodes. Using the slit, we implement an XML processing framework based on the cursor model. We also show a generalization of this framework to give an XML view for non XML data. Acknowledgements I would like to thank Professor Akihiko Takano for his invaluable comments and suggestions. Contents
3.2.1. Formal Grammars 2 3.2.2. HighLevel Syntactic Formalisms 3
"... Linguistic signs, grammar and meaning: computational logic for natural language ..."
Abstract
 Add to MetaCart
(Show Context)
Linguistic signs, grammar and meaning: computational logic for natural language
ProjectTeam SIGNES Linguistic signs, grammar and meaning: computational logic for natural language
"... Futurs ..."
(Show Context)