{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/91867"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/91867","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Latent tree structure learning for cross-document coreference resolution","abstract":"Cross Document Coreference Resolution (CDCR) is the problem of learning which mentions, coming from several different documents, correspond to the same entity. This thesis approaches the CDCR problem by first turning it into a structure learning problem. A latent tree structure, in which leaves correspond to observed mentions and internal nodes correspond to latent sub-entities, is learned. A greedy clustering heuristic can then be used to select subtrees from the learned tree structure as entities. As with other structure learning problems, it is prudent to envoke Occam's razor and perform regularization to obtain the simplest hypothesis. When the state space consists of tree structures, we can impose a bias on the possible structure. Different aspects of tree structure (i.e. number of edges, depth of the leaves, etc.) can be penalized in these models to improve the generalization of thes models. This thesis draws upon these ideas to provide a new model for CDCR. To learn parameters, we implement a parameter estimation algorithm based on existing stochastic gradient-descent based algorithms and show how to further tune regularization parameters. The latent tree structure is then learned using MCMC inference. We show how structural regularization plays a critical role in the inference procedure. Finally, we empirically show that our model out-performs previous work, without using a sophisticated set of features.","abstract_html":"Cross Document Coreference Resolution (CDCR) is the problem of learning which mentions, coming from several different documents, correspond to the same entity. This thesis approaches the CDCR problem by first turning it into a structure learning problem. A latent tree structure, in which leaves correspond to observed mentions and internal nodes correspond to latent sub-entities, is learned. A greedy clustering heuristic can then be used to select subtrees from the learned tree structure as entities. As with other structure learning problems, it is prudent to envoke Occam's razor and perform regularization to obtain the simplest hypothesis. When the state space consists of tree structures, we can impose a bias on the possible structure. Different aspects of tree structure (i.e. number of edges, depth of the leaves, etc.) can be penalized in these models to improve the generalization of thes models. This thesis draws upon these ideas to provide a new model for CDCR. To learn parameters, we implement a parameter estimation algorithm based on existing stochastic gradient-descent based algorithms and show how to further tune regularization parameters. The latent tree structure is then learned using MCMC inference. We show how structural regularization plays a critical role in the inference procedure. Finally, we empirically show that our model out-performs previous work, without using a sophisticated set of features.","abstract_has_math":false,"creators":["Shyu, Eric"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Leslie P. Kaelbling."],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014","date_published":"2014","updated_at":"2026-07-22T22:21:28Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/91867","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Leslie P. Kaelbling."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Shyu, Eric"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-11-24T18:41:09Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-11-24T18:41:09Z"]},{"key":"dc:date.issued","label":"Date","values":["2014"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/91867"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 77-79)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Cross Document Coreference Resolution (CDCR) is the problem of learning which mentions, coming from several different documents, correspond to the same entity. This thesis approaches the CDCR problem by first turning it into a structure learning problem. A latent tree structure, in which leaves correspond to observed mentions and internal nodes correspond to latent sub-entities, is learned. A greedy clustering heuristic can then be used to select subtrees from the learned tree structure as entities. As with other structure learning problems, it is prudent to envoke Occam's razor and perform regularization to obtain the simplest hypothesis. When the state space consists of tree structures, we can impose a bias on the possible structure. Different aspects of tree structure (i.e. number of edges, depth of the leaves, etc.) can be penalized in these models to improve the generalization of thes models. This thesis draws upon these ideas to provide a new model for CDCR. To learn parameters, we implement a parameter estimation algorithm based on existing stochastic gradient-descent based algorithms and show how to further tune regularization parameters. The latent tree structure is then learned using MCMC inference. We show how structural regularization plays a critical role in the inference procedure. Finally, we empirically show that our model out-performs previous work, without using a sophisticated set of features."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M. Eng."]},{"key":"dc:title","label":"Title","values":["Latent tree structure learning for cross-document coreference resolution"]}]}],"canonical_facts":{"dc:contributor.advisor":["Leslie P. Kaelbling."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Shyu, Eric"],"dc:date.accessioned":["2014-11-24T18:41:09Z"],"dc:date.available":["2014-11-24T18:41:09Z"],"dc:date.issued":["2014"],"dc:description":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 77-79)."],"dc:description.abstract":["Cross Document Coreference Resolution (CDCR) is the problem of learning which mentions, coming from several different documents, correspond to the same entity. This thesis approaches the CDCR problem by first turning it into a structure learning problem. A latent tree structure, in which leaves correspond to observed mentions and internal nodes correspond to latent sub-entities, is learned. A greedy clustering heuristic can then be used to select subtrees from the learned tree structure as entities. As with other structure learning problems, it is prudent to envoke Occam's razor and perform regularization to obtain the simplest hypothesis. When the state space consists of tree structures, we can impose a bias on the possible structure. Different aspects of tree structure (i.e. number of edges, depth of the leaves, etc.) can be penalized in these models to improve the generalization of thes models. This thesis draws upon these ideas to provide a new model for CDCR. To learn parameters, we implement a parameter estimation algorithm based on existing stochastic gradient-descent based algorithms and show how to further tune regularization parameters. The latent tree structure is then learned using MCMC inference. We show how structural regularization plays a critical role in the inference procedure. Finally, we empirically show that our model out-performs previous work, without using a sophisticated set of features."],"dc:description.degree":["M. Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/91867"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Latent tree structure learning for cross-document coreference resolution"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:28Z"}