93 search results - page 8 / 19 » Nonterminal Complexity of Some Operations on Context-Free La... |
WIA
2000
Springer
13 years 11 months ago
2000
Springer
This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We address the non-redundant random generation of k words of length n from a context-free language. Additionally, we want to avoid a predefined set of words. We study the limits of...
HICSS
2002
IEEE
14 years 15 days ago
2002
IEEE
An application generator has resulted from the authors' efforts to improve the development of interactive database applications. The developed tool is based on a meta-base. T...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
ASPLOS
2012
ACM
12 years 3 months ago
2012
ACM
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...