Hello All,
I am looking for an efficient way to represent vectors that exist in an
infinite dimensional space. Specifically I am working with large amounts
of text data and will be receiving a lot of data that contains previously
unseen words. Each text represents a vector that exists in the
Hard to say what underlying data structure you want here, but it may well
be helpful for the keys to be lexicographically ordered – you may want to
try a SortedDict as provided by the DataStructures
https://github.com/JuliaLang/DataStructures.jl package. You may also want
to define a WordVector
