Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems:
Complex Event Recognition Languages Page 1 Tutorial: Complex Event Recognition Languages …

Web applications often use special string-manipulating sanitizers on untrusted user data, but
it is difficult to reason manually about the behavior of these functions, leading to errors. For …

Finite automata and finite transducers are used in a wide range of applications in software
engineering, from regular expressions to specification languages. We extend these classic …

Constraints in form regular expressions over strings are ubiquitous. They occur often in
programming languages like Perl and C#, in SQL in form of LIKE expressions, and in web …

Symbolic automata and transducers extend finite automata and transducers by allowing
transitions to carry predicates and functions over rich alphabet theories, such as linear …

Symbolic Automata extend classical automata by using symbolic alphabets instead of finite
ones. Most of the classical automata algorithms rely on the alphabet being finite, and …

This paper reviews the current state of the art in Natural LanguageProcessing for Hebrew,
both theoretical and practical. The Hebrewlanguage, like other Semitic languages, poses …

Nowadays, we are witnessing an ever-growing trend of deploying lightweight linguistic
analysis for solving problems that deal with the conversion of the vast bulk of raw textual …

In this thesis I present various algorithms for the unsupervised machine learning of aspects
of natural languages using a variety of statistical models. The scientific object of the work is …

Modern statistical AI systems are quite large and complex; this interferes with research,
development, and education. We point out that most of the computation involves database …