Improved Smoothing for Probabilistic Suffix Trees Seen as Variable Order Markov Chains

Kermorvant and Dupont. "Improved Smoothing for Probabilistic Suffix Trees Seen as Variable Order Markov Chains." European Conference on Machine Learning, 2002. doi:10.1007/3-540-36755-1_16

[Kermorvant and Dupont. "Improved Smoothing for Probabilistic Suffix Trees Seen as Variable Order Markov Chains." European Conference on Machine Learning, 2002.](https://mlanthology.org/ecmlpkdd/2002/kermorvant2002ecml-improved/) doi:10.1007/3-540-36755-1_16

@inproceedings{kermorvant2002ecml-improved,
  title     = {{Improved Smoothing for Probabilistic Suffix Trees Seen as Variable Order Markov Chains}},
  author    = {Kermorvant, Christopher and Dupont, Pierre},
  booktitle = {European Conference on Machine Learning},
  year      = {2002},
  pages     = {185-194},
  doi       = {10.1007/3-540-36755-1_16},
  url       = {https://mlanthology.org/ecmlpkdd/2002/kermorvant2002ecml-improved/}
}