Sciweavers

2474 search results - page 14 / 495
» Learning Languages in a Union
Sort
View
CTCS
1997
Springer
13 years 11 months ago
Monads and Modular Term Rewriting
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
Christoph Lüth, Neil Ghani
ICALP
2000
Springer
13 years 11 months ago
On the Representation of Timed Polyhedra
In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analys...
Olivier Bournez, Oded Maler
ICGI
2004
Springer
14 years 27 days ago
Identifying Left-Right Deterministic Linear Languages
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
Jorge Calera-Rubio, José Oncina
CORR
2006
Springer
84views Education» more  CORR 2006»
13 years 7 months ago
The JRC-Acquis: A multilingual aligned parallel corpus with 20+ languages
We present a new, unique and freely available parallel corpus containing European Union (EU) documents of mostly legal nature. It is available in all 20 official EU languages, wit...
Ralf Steinberger, Bruno Pouliquen, Anna Widiger, C...
ECTEL
2006
Springer
13 years 11 months ago
Language Technology for eLearning
Abstract. Given the huge amount of static and dynamic content created for eLearning tasks, the major challenge for extending their use is to improve the effectiveness of retrieval ...
Paola Monachesi, Lothar Lemnitzer, Kiril Ivanov Si...