595 search results - page 40 / 119 » Languages Of Analogical Strings |
CICLING
2007
Springer
15 years 3 months ago
2007
Springer
Although the literature contains reports of very high accuracy figures for the recognition of named entities in text, there are still some named entity phenomena that remain probl...
ECCC
2008
14 years 9 months ago
2008
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
TNN
1998
14 years 9 months ago
1998
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
EMNLP
2009
14 years 7 months ago
2009
We present a method for detecting and correcting multiple real-word spelling errors using the Google Web 1T 3-gram data set and a normalized and modified version of the Longest Co...
ACL
2012
13 years 3 days ago
2012
In this paper, we demonstrate that accurate machine translation is possible without the concept of “words,” treating MT as a problem of transformation between character string...