Finite automata for compact representation of tuple dictionaries

@article{Daciuk2004FiniteAF,
  title={Finite automata for compact representation of tuple dictionaries},
  author={Jan Daciuk and Gertjan van Noord},
  journal={Theor. Comput. Sci.},
  year={2004},
  volume={313},
  pages={45-56}
}
A generalization of the dictionary data structure is described, called tuple dictionary. A tuple dictionary represents the mapping of n-tuples of strings to some value. This data structure is motivated by practical applications in speech and language processing, in which very large instances of tuple dictionaries are used to represent language models. A technique for compact representation of tuple dictionaries is presented. The technique can be seen as an application and extension of perfect… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…