595 search results - page 29 / 119 » Languages Of Analogical Strings |
ACL
2004
14 years 11 months ago
2004
Multilingual applications frequently involve dealing with proper names, but names are often missing in bilingual lexicons. This problem is exacerbated for applications involving t...
CC
2006
Springer
14 years 9 months ago
2006
Springer
Variants of Kannan's Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively presentable classes of languages that use advice string...
74
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
DLT
2007
14 years 11 months ago
2007
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes determin...
66
Voted
ACL
1998
14 years 11 months ago
1998
In this paper, we present a stochastic language model for Japanese using dependency. The prediction unit in thismodel isallattributeof "bunsetsu". This isrepresented by ...