{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/119561"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/119561","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Minimal characterization of linguistic phenomena for robust ternary expression construction","abstract":"This thesis introduces Astroparse, a system that uses the output of a third-party neural network based dependency parser (spaCy) to construct semantic parses of sentences in the form of ternary expressions as pioneered by the Start Natural Language system. Ternary expressions are a powerful representation for efficiently indexing, matching, and retrieving natural language. Because Start is a purely symbolic system, extending Start's parser, which produces ternary expressions from sentences, requires significant effort. Astroparse makes it far easier to extend Start's coverage. Learning from examples (pairs of sentences and ternary expressions), Astroparse automatically learns to associate the linguistic phenomenon corresponding to an example's ternary expression with a subtree of the example sentence's dependency tree and the token-level features (e.g., lemma, part-of-speech tags) of the subtree's nodes. Given unseen sentences, Astroparse recognizes the learned minimal characterizations of linguistic phenomena to construct ternary expressions from spaCy's parse of the sentence. By leveraging the output of a neural network based dependency parser with high efficiency and state-of-the-art accuracy, Astroparse offers a fast, high-recall, easy-to-train system to augment Start's current parser for constructing ternary expressions.","abstract_html":"This thesis introduces Astroparse, a system that uses the output of a third-party neural network based dependency parser (spaCy) to construct semantic parses of sentences in the form of ternary expressions as pioneered by the Start Natural Language system. Ternary expressions are a powerful representation for efficiently indexing, matching, and retrieving natural language. Because Start is a purely symbolic system, extending Start's parser, which produces ternary expressions from sentences, requires significant effort. Astroparse makes it far easier to extend Start's coverage. Learning from examples (pairs of sentences and ternary expressions), Astroparse automatically learns to associate the linguistic phenomenon corresponding to an example's ternary expression with a subtree of the example sentence's dependency tree and the token-level features (e.g., lemma, part-of-speech tags) of the subtree's nodes. Given unseen sentences, Astroparse recognizes the learned minimal characterizations of linguistic phenomena to construct ternary expressions from spaCy's parse of the sentence. By leveraging the output of a neural network based dependency parser with high efficiency and state-of-the-art accuracy, Astroparse offers a fast, high-recall, easy-to-train system to augment Start's current parser for constructing ternary expressions.","abstract_has_math":false,"creators":["Tong, Jason Kar Chun"],"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":["Boris Katz."],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018","date_published":"2018","updated_at":"2026-07-22T22:22:02Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/119561","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Boris Katz."]},{"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":["Tong, Jason Kar Chun"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-12-11T20:40:12Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-12-11T20:40:12Z"]},{"key":"dc:date.issued","label":"Date","values":["2018"]},{"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":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written 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/119561"]}]},{"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, 2018.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student-submitted PDF version of thesis.","Includes bibliographical references (pages 101-102)."]},{"key":"dc:description.abstract","label":"Abstract","values":["This thesis introduces Astroparse, a system that uses the output of a third-party neural network based dependency parser (spaCy) to construct semantic parses of sentences in the form of ternary expressions as pioneered by the Start Natural Language system. Ternary expressions are a powerful representation for efficiently indexing, matching, and retrieving natural language. Because Start is a purely symbolic system, extending Start's parser, which produces ternary expressions from sentences, requires significant effort. Astroparse makes it far easier to extend Start's coverage. Learning from examples (pairs of sentences and ternary expressions), Astroparse automatically learns to associate the linguistic phenomenon corresponding to an example's ternary expression with a subtree of the example sentence's dependency tree and the token-level features (e.g., lemma, part-of-speech tags) of the subtree's nodes. Given unseen sentences, Astroparse recognizes the learned minimal characterizations of linguistic phenomena to construct ternary expressions from spaCy's parse of the sentence. By leveraging the output of a neural network based dependency parser with high efficiency and state-of-the-art accuracy, Astroparse offers a fast, high-recall, easy-to-train system to augment Start's current parser for constructing ternary expressions."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M. Eng."]},{"key":"dc:title","label":"Title","values":["Minimal characterization of linguistic phenomena for robust ternary expression construction"]}]}],"canonical_facts":{"dc:contributor.advisor":["Boris Katz."],"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":["Tong, Jason Kar Chun"],"dc:date.accessioned":["2018-12-11T20:40:12Z"],"dc:date.available":["2018-12-11T20:40:12Z"],"dc:date.issued":["2018"],"dc:description":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.","This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.","Cataloged from student-submitted PDF version of thesis.","Includes bibliographical references (pages 101-102)."],"dc:description.abstract":["This thesis introduces Astroparse, a system that uses the output of a third-party neural network based dependency parser (spaCy) to construct semantic parses of sentences in the form of ternary expressions as pioneered by the Start Natural Language system. Ternary expressions are a powerful representation for efficiently indexing, matching, and retrieving natural language. Because Start is a purely symbolic system, extending Start's parser, which produces ternary expressions from sentences, requires significant effort. Astroparse makes it far easier to extend Start's coverage. Learning from examples (pairs of sentences and ternary expressions), Astroparse automatically learns to associate the linguistic phenomenon corresponding to an example's ternary expression with a subtree of the example sentence's dependency tree and the token-level features (e.g., lemma, part-of-speech tags) of the subtree's nodes. Given unseen sentences, Astroparse recognizes the learned minimal characterizations of linguistic phenomena to construct ternary expressions from spaCy's parse of the sentence. By leveraging the output of a neural network based dependency parser with high efficiency and state-of-the-art accuracy, Astroparse offers a fast, high-recall, easy-to-train system to augment Start's current parser for constructing ternary expressions."],"dc:description.degree":["M. Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/119561"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Minimal characterization of linguistic phenomena for robust ternary expression construction"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:02Z"}