Sciweavers

6306 search results - page 393 / 1262
» Space, Time, and the Use of Language
Sort
View
DLT
2004
15 years 9 months ago
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
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...
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
CINQ
2004
Springer
123views Database» more  CINQ 2004»
16 years 1 months ago
One-Sided Instance-Based Boundary Sets
Abstract. Instance retraction is a difficult problem for concept learning by version spaces. This chapter introduces a family of version-space representations called one-sided inst...
Evgueni N. Smirnov, Ida G. Sprinkhuizen-Kuyper, H....
ALT
1995
Springer
15 years 11 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
CICLING
2009
Springer
15 years 5 months ago
NLP for Shallow Question Answering of Legal Documents Using Graphs
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...
Alfredo Monroy, Hiram Calvo, Alexander F. Gelbukh
191
Voted
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
15 years 11 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo