|
|
|
|
|
|
by lscharen
1429 days ago
|
|
|
CDAWGs. Compressed Directed Acyclic Word Graphs. They are like tries but share prefixes and suffixes of a word corpus, can be built in linear time, and since they are graphs, one can define an inner product between two CDAWGs and use them for kernel-based machine learning algorithms. https://hal-upec-upem.archives-ouvertes.fr/hal-00620006/docu... |
|
|