Sciweavers

7064 search results - page 150 / 1413
» From States to Histories
Sort
View
WIA
1999
Springer
15 years 10 months ago
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
Gertjan van Noord, Dale Gerdemann
CAISE
2007
Springer
15 years 10 months ago
Formalization and Verification of EPCs with OR-Joins Based on State and Context
The semantics of the OR-join in business process modeling languages like EPCs or YAWL have been discussed for a while. Still, the existing solutions suffer from at least one of two...
Jan Mendling, Wil M. P. van der Aalst
ECOOP
2008
Springer
15 years 8 months ago
ReCrash: Making Software Failures Reproducible by Preserving Object States
It is very hard to fix a software failure without being able to reproduce it. However, reproducing a failure is often difficult and time-consuming. This paper proposes a novel tech...
Shay Artzi, Sunghun Kim, Michael D. Ernst
ELPUB
2008
ACM
15 years 8 months ago
The state of metadata in open access journals: possibilities and restrictions
This paper reports on an inquiry into the use of metadata, publishing formats, and markup in editormanaged open access journals. It builds on findings from a study of the document...
Helena Francke
EMNLP
2008
15 years 8 months ago
Latent-Variable Modeling of String Transductions with Finite-State Methods
String-to-string transduction is a central problem in computational linguistics and natural language processing. It occurs in tasks as diverse as name transliteration, spelling co...
Markus Dreyer, Jason Smith, Jason Eisner