595 search results - page 36 / 119 » Languages Of Analogical Strings |
ALT
2006
Springer
15 years 6 months ago
2006
Springer
Higman 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. We consider the following inductive inferenc...
115
click to vote
EACL
1993
ACL Anthology
14 years 11 months ago
1993
ACL Anthology
In Data Oriented Parsing (DOP), an annotated corpus is used as a stochastic grammar. An input string is parsed by combining subtrees from the corpus. As a consequence, one parse t...
DLT
2004
14 years 11 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we show that stylistic text features can be exploited to determine an anonymous author's native language with high accuracy. Specifically, we first use automat...
FGR
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a novel tracking algorithm that uses dynamic programming to determine the path of target objects and that is able to track an arbitrary number of different objects. The...