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
{"_id":"qYqH3TmfjRqSHaEAt","bibbaseid":"may-knight-abetternbestlistpracticaldeterminizationofweightedfinitetreeautomata-2006","downloads":0,"creationDate":"2018-03-02T00:05:58.167Z","title":"A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata","author_short":["May, J.","Knight, K."],"year":2006,"bibtype":"inproceedings","biburl":"https://jonmay.github.io/webpage/cutelabname/cutelabname.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Jonathan"],"propositions":[],"lastnames":["May"],"suffixes":[]},{"firstnames":["Kevin"],"propositions":[],"lastnames":["Knight"],"suffixes":[]}],"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":[{"firstnames":["Sanjeev"],"propositions":[],"lastnames":["Khudanpur"],"suffixes":[]},{"firstnames":["Brian"],"propositions":[],"lastnames":["Roark"],"suffixes":[]}],"volume":"Main Proceedings","address":"Brooklyn, New York","month":"June 5 – June 7","publisher":"Association for Computational Linguistics","bibtex":"@InProceedings{mayknight06:naacl,\n author = \t {Jonathan May and Kevin Knight},\n title = \t {A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata},\n booktitle =\t {Proceedings of the 2006 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics},\n pages =\t {351--358},\n year =\t 2006,\n editor =\t {Sanjeev Khudanpur and Brian Roark},\n volume =\t {Main Proceedings},\n address =\t {Brooklyn, New York},\n month =\t {June 5 -- June 7},\n publisher =\t {Association for Computational Linguistics}\n}\n\n","author_short":["May, J.","Knight, K."],"editor_short":["Khudanpur, S.","Roark, B."],"key":"mayknight06:naacl","id":"mayknight06:naacl","bibbaseid":"may-knight-abetternbestlistpracticaldeterminizationofweightedfinitetreeautomata-2006","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0},"search_terms":["better","best","list","practical","determinization","weighted","finite","tree","automata","may","knight"],"keywords":[],"authorIDs":[],"dataSources":["dDcybAPCHBAZER5nc","ZdhKtP2cSp3Aki2ge","X5WBAKQabka5TW5z7","BnZgtH7HDESgbxKxt","AfBybHaxyt33K5MBP","hbZSwot2msWk92m5B","fcWjcoAgajPvXWcp7","GvHfaAWP6AfN6oLQE","j3Qzx9HAAC6WtJDHS","5eM3sAccSEpjSDHHQ"]}