Uniquely decodable n-gram embeddings


We define the family of n-gram embeddings from strings over a finite alphabet into the semimodule N . We classify all ∈ N that are valid images of strings under such embeddings, as well as all whose inverse image consists of exactly 1 string (we call such uniquely decodable). We prove that for a fixed alphabet, the set of all strings whose image is uniquely… (More)
DOI: 10.1016/j.tcs.2004.10.010


2 Figures and Tables

Slides referencing similar topics