Sciweavers

3270 search results - page 206 / 654
» Approximate String Processing
Sort
View
115
Voted
CORR
2010
Springer
120views Education» more  CORR 2010»
15 years 3 months ago
State machine models of timing and circuit design
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
Victor Yodaiken
DSS
2006
116views more  DSS 2006»
15 years 2 months ago
Matching knowledge elements in concept maps using a similarity flooding algorithm
Concept mapping systems used in education and knowledge management emphasize flexibility of representation to enhance learning and facilitate knowledge capture. Collections of con...
Byron Marshall, Hsinchun Chen, Therani Madhusudan
CORR
1998
Springer
84views Education» more  CORR 1998»
15 years 2 months ago
A Variant of Earley Parsing
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed” recognit...
Mark-Jan Nederhof, Giorgio Satta
ACL
2009
15 years 23 days ago
A Succinct N-gram Language Model
Efficient processing of tera-scale text data is an important research topic. This paper proposes lossless compression of Ngram language models based on LOUDS, a succinct data stru...
Taro Watanabe, Hajime Tsukada, Hideki Isozaki
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
15 years 22 days ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...