{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/76990"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/76990","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Ordering prenominal modifiers with a ranking approach","abstract":"In this thesis we present a solution to the natural language processing task of ordering prenominal modifiers, a problem that has applications from machine translation to natural language generation. In machine translation, constraints on modifier orderings vary from language to language so some reordering of modifiers may be necessary. In natural language generation, a representation of an object and its properties often needs to be formulated into a concrete noun phrase. We detail a novel approach that frames this task as a ranking problem amongst the permutations of a set of modifiers, admitting arbitrary features on each candidate permutation and exploiting hundreds of thousands of features in total. We compare our methods to a state-of-the-art class based ordering approach and a strong baseline that makes use of the Google n-gram corpus. We attain a maximum error reduction of 69.8% and average error reduction across all test sets of 59.1% compared to the state-of-the-art, and we attain a maximum error reduction of 68.4% and average error reduction across all test sets of 41.8% compared to our Google n-gram baseline. Finally, we present an analysis of our approach as compared to our baselines and describe several potential improvements to our system.","abstract_html":"In this thesis we present a solution to the natural language processing task of ordering prenominal modifiers, a problem that has applications from machine translation to natural language generation. In machine translation, constraints on modifier orderings vary from language to language so some reordering of modifiers may be necessary. In natural language generation, a representation of an object and its properties often needs to be formulated into a concrete noun phrase. We detail a novel approach that frames this task as a ranking problem amongst the permutations of a set of modifiers, admitting arbitrary features on each candidate permutation and exploiting hundreds of thousands of features in total. We compare our methods to a state-of-the-art class based ordering approach and a strong baseline that makes use of the Google n-gram corpus. We attain a maximum error reduction of 69.8% and average error reduction across all test sets of 59.1% compared to the state-of-the-art, and we attain a maximum error reduction of 68.4% and average error reduction across all test sets of 41.8% compared to our Google n-gram baseline. Finally, we present an analysis of our approach as compared to our baselines and describe several potential improvements to our system.","abstract_has_math":false,"creators":["Liu, Jingyi, M. Eng. Massachusetts Institute of Technology"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Regina Barzilay."],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011","date_published":"2011","updated_at":"2026-07-22T22:22:13Z","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/76990","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Regina Barzilay."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Liu, Jingyi, M. Eng. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-02-14T15:35:49Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-02-14T15:35:49Z"]},{"key":"dc:date.issued","label":"Date","values":["2011"]},{"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/76990"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 57-58)."]},{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis we present a solution to the natural language processing task of ordering prenominal modifiers, a problem that has applications from machine translation to natural language generation. In machine translation, constraints on modifier orderings vary from language to language so some reordering of modifiers may be necessary. In natural language generation, a representation of an object and its properties often needs to be formulated into a concrete noun phrase. We detail a novel approach that frames this task as a ranking problem amongst the permutations of a set of modifiers, admitting arbitrary features on each candidate permutation and exploiting hundreds of thousands of features in total. We compare our methods to a state-of-the-art class based ordering approach and a strong baseline that makes use of the Google n-gram corpus. We attain a maximum error reduction of 69.8% and average error reduction across all test sets of 59.1% compared to the state-of-the-art, and we attain a maximum error reduction of 68.4% and average error reduction across all test sets of 41.8% compared to our Google n-gram baseline. Finally, we present an analysis of our approach as compared to our baselines and describe several potential improvements to our system."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Ordering prenominal modifiers with a ranking approach"]}]}],"canonical_facts":{"dc:contributor.advisor":["Regina Barzilay."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Liu, Jingyi, M. Eng. Massachusetts Institute of Technology"],"dc:date.accessioned":["2013-02-14T15:35:49Z"],"dc:date.available":["2013-02-14T15:35:49Z"],"dc:date.issued":["2011"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 57-58)."],"dc:description.abstract":["In this thesis we present a solution to the natural language processing task of ordering prenominal modifiers, a problem that has applications from machine translation to natural language generation. In machine translation, constraints on modifier orderings vary from language to language so some reordering of modifiers may be necessary. In natural language generation, a representation of an object and its properties often needs to be formulated into a concrete noun phrase. We detail a novel approach that frames this task as a ranking problem amongst the permutations of a set of modifiers, admitting arbitrary features on each candidate permutation and exploiting hundreds of thousands of features in total. We compare our methods to a state-of-the-art class based ordering approach and a strong baseline that makes use of the Google n-gram corpus. We attain a maximum error reduction of 69.8% and average error reduction across all test sets of 59.1% compared to the state-of-the-art, and we attain a maximum error reduction of 68.4% and average error reduction across all test sets of 41.8% compared to our Google n-gram baseline. Finally, we present an analysis of our approach as compared to our baselines and describe several potential improvements to our system."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/76990"],"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":["Ordering prenominal modifiers with a ranking approach"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:13Z"}