A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata. May, J. & Knight, K. In Khudanpur, S. & Roark, B., editors, Proceedings of the 2006 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, volume Main Proceedings, pages 351–358, Brooklyn, New York, June 5 – June 7, 2006. Association for Computational Linguistics.
bibtex   
@InProceedings{mayknight06:naacl,
  author = 	 {Jonathan May and Kevin Knight},
  title = 	 {A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata},
  booktitle =	 {Proceedings of the 2006 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics},
  pages =	 {351--358},
  year =	 2006,
  editor =	 {Sanjeev Khudanpur and Brian Roark},
  volume =	 {Main Proceedings},
  address =	 {Brooklyn, New York},
  month =	 {June 5 -- June 7},
  publisher =	 {Association for Computational Linguistics}
}

Downloads: 0