Maximum Entropy Markov Models for Information Extraction and Segmentation

Andrew McCallum, Dayne Freitag, Fernando C. N. Pereira. Maximum Entropy Markov Models for Information Extraction and Segmentation. In Pat Langley, editor, Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Standord, CA, USA, June 29 - July 2, 2000. pages 591-598, Morgan Kaufmann, 2000.

@inproceedings{McCallumFP00,
  title = {Maximum Entropy Markov Models for Information Extraction and Segmentation},
  author = {Andrew McCallum and Dayne Freitag and Fernando C. N. Pereira},
  year = {2000},
  tags = {C++, information models, Markov},
  researchr = {https://researchr.org/publication/McCallumFP00},
  cites = {0},
  citedby = {0},
  pages = {591-598},
  booktitle = {Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Standord, CA, USA, June 29 - July 2, 2000},
  editor = {Pat Langley},
  publisher = {Morgan Kaufmann},
  isbn = {1-55860-707-2},
}