<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-19T04:36:07Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/98404" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/98404</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
        <setSpec>com_2142_5130</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Roth, Dan</dc:contributor>
          <dc:creator>Ling, Shaoshi</dc:creator>
          <dc:date>2017-09-29T17:56:58Z</dc:date>
          <dc:date>2017-09-29T17:56:58Z</dc:date>
          <dc:date>2017-07-17</dc:date>
          <dc:date>2017-08</dc:date>
          <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.</dc:description>
          <dc:description>Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2017-09-29 without embargo terms</dc:description>
          <dc:description>The student, Shaoshi Ling, accepted the attached license on 2017-07-14 at 23:54.</dc:description>
          <dc:description>The student, Shaoshi Ling, submitted this Thesis for approval on 2017-07-14 at 23:59.</dc:description>
          <dc:description>This Thesis was approved for publication on 2017-07-17 at 10:53.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #11483 on 2017-09-29 at 11:30:57</dc:description>
          <dc:description>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:description>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://hdl.handle.net/2142/98404</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2017 Shaoshi Ling</dc:rights>
          <dc:subject>Natural language processing (NLP)</dc:subject>
          <dc:subject>Similarity</dc:subject>
          <dc:title>On lexical level matching</dc:title>
          <dc:type>text</dc:type>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
