{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/98404"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/98404","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"On lexical level matching","abstract":"In many natural language understanding applications, text processing requires comparing lexical units: words, phrases, name entities and sentences. A significant amount of research has taken place in studying evaluating similarity metrics between those units. In this thesis, we summarize some research work in computing lexical similarity. We describe a new approach to compute similarity between two spans of text, using multiple semantic-units level comparison measures to compute sentence-level similarity scores.","abstract_html":"In many natural language understanding applications, text processing requires comparing lexical units: words, phrases, name entities and sentences. A significant amount of research has taken place in studying evaluating similarity metrics between those units. In this thesis, we summarize some research work in computing lexical similarity. We describe a new approach to compute similarity between two spans of text, using multiple semantic-units level comparison measures to compute sentence-level similarity scores.","abstract_has_math":false,"creators":["Ling, Shaoshi"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Roth, Dan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017-09-29T17:56:58Z","date_published":"2017-09-29T17:56:58Z","updated_at":"2026-07-22T22:24:35Z","subjects":["Natural language processing (NLP)","Similarity"],"languages":["en"],"rights":["Copyright 2017 Shaoshi Ling"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/98404","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Roth, Dan"]},{"key":"dc:creator","label":"Author","values":["Ling, Shaoshi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017-09-29T17:56:58Z","2017-07-17","2017-08"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Natural language processing (NLP)","Similarity"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2017 Shaoshi Ling"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/98404"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In many natural language understanding applications, text processing requires comparing lexical units: words, phrases, name entities and sentences. A significant amount of research has taken place in studying evaluating similarity metrics between those units. In this thesis, we summarize some research work in computing lexical similarity. We describe a new approach to compute similarity between two spans of text, using multiple semantic-units level comparison measures to compute sentence-level similarity scores.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2017-09-29 without embargo terms","The student, Shaoshi Ling, accepted the attached license on 2017-07-14 at 23:54.","The student, Shaoshi Ling, submitted this Thesis for approval on 2017-07-14 at 23:59.","This Thesis was approved for publication on 2017-07-17 at 10:53.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11483 on 2017-09-29 at 11:30:57","Made available in DSpace on 2017-09-29T17:56:58Z (GMT). No. of bitstreams: 2 LING-THESIS-2017.pdf: 480183 bytes, checksum: d2dbcaa9159c6fca4e6f7c9ba7d89035 (MD5) LICENSE.txt: 4209 bytes, checksum: ea74cab2d000156f512fae1ebfc17f72 (MD5) Previous issue date: 2017-07-17"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["On lexical level matching"]}]}],"canonical_facts":{"dc:contributor":["Roth, Dan"],"dc:creator":["Ling, Shaoshi"],"dc:date":["2017-09-29T17:56:58Z","2017-07-17","2017-08"],"dc:description":["In many natural language understanding applications, text processing requires comparing lexical units: words, phrases, name entities and sentences. A significant amount of research has taken place in studying evaluating similarity metrics between those units. In this thesis, we summarize some research work in computing lexical similarity. We describe a new approach to compute similarity between two spans of text, using multiple semantic-units level comparison measures to compute sentence-level similarity scores.","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2017-09-29 without embargo terms","The student, Shaoshi Ling, accepted the attached license on 2017-07-14 at 23:54.","The student, Shaoshi Ling, submitted this Thesis for approval on 2017-07-14 at 23:59.","This Thesis was approved for publication on 2017-07-17 at 10:53.","DSpace SAF Submission Ingestion Package generated from Vireo submission #11483 on 2017-09-29 at 11:30:57","Made available in DSpace on 2017-09-29T17:56:58Z (GMT). No. of bitstreams: 2 LING-THESIS-2017.pdf: 480183 bytes, checksum: d2dbcaa9159c6fca4e6f7c9ba7d89035 (MD5) LICENSE.txt: 4209 bytes, checksum: ea74cab2d000156f512fae1ebfc17f72 (MD5) Previous issue date: 2017-07-17"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/98404"],"dc:language":["en"],"dc:rights":["Copyright 2017 Shaoshi Ling"],"dc:subject":["Natural language processing (NLP)","Similarity"],"dc:title":["On lexical level matching"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:35Z"}