Sciweavers

850 search results - page 22 / 170
» Representing Text Chunks
Sort
View
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
15 years 9 months ago
Improving discriminative sequential learning with rare--but--important associations
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
Xuan Hieu Phan, Minh Le Nguyen, Tu Bao Ho, Susumu ...
COMPUTER
2006
84views more  COMPUTER 2006»
14 years 9 months ago
Testable, Reusable Units of Cognition
The educational content of a technical topic consists, ultimately, of elementary chunks of knowledge. Identifying and classifying such units -- Testable, Reusable Units of Cogniti...
Bertrand Meyer
WWW
2004
ACM
15 years 10 months ago
Graph-based text database for knowledge discovery
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
MFCS
2009
Springer
15 years 4 months ago
Self-indexed Text Compression Using Straight-Line Programs
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
Francisco Claude, Gonzalo Navarro
ACL
2007
14 years 11 months ago
Computing Lexical Chains with Graph Clustering
This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text’s cohesive structure. In contrast to previo...
Olena Medelyan