<?xml version="1.0" encoding="UTF-8" ?>
<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xmlns:slims="http://slims.web.id" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3" id="59197">
 <titleInfo>
  <title>Kombinasi Damerau Levenshtein dan Jaro-Winkler Distance Untuk Koreksi Kata Bahasa Inggris</title>
 </titleInfo>
 <name type="Personal Name" authority="">
  <namePart>Indriyono Bonifacius Vicky</namePart>
  <role>
   <roleTerm type="text">Primary Author</roleTerm>
  </role>
 </name>
 <typeOfResource manuscript="no" collection="yes">mixed material</typeOfResource>
 <genre authority="marcgt">bibliography</genre>
 <originInfo>
  <place>
   <placeTerm type="text">Bandung</placeTerm>
   <publisher>Maranatha University Press</publisher>
   <dateIssued>2020</dateIssued>
  </place>
 </originInfo>
 <language>
  <languageTerm type="code"></languageTerm>
  <languageTerm type="text">Indonesia</languageTerm>
 </language>
 <physicalDescription>
  <form authority="gmd">Artikel Jurnal</form>
  <extent>hlm : 162-173</extent>
 </physicalDescription>
 <relatedItem type="series">
  <titleInfo/>
  <title>JUTISI : Jurnal Teknik Informatika dan Sistem Informasi</title>
 </relatedItem>
</mods>
<note>Abstract&#13;
Writing is one of the efforts made by the writer to express ideas and ideas to others. But sometimes when writing, there are many errors in typing spelling, especially English spelling, resulting in errors in capturing the meaning and meaning of the writing. To overcome this problem, we need a system that can detect word spelling errors. Damerau Levenshtein and Jaro Winkler Distance Algorithms are algorithms that can be used as a solution to detect English typing errors. From the test results, it can be concluded that the Damerau Levenshtein and Jaro-Winkler Distance are able to optimally detect word mismatches and look for similarities of words compared. The Damerau Levenshtein Distance works by finding the smallest distance value, while the Jaro-Winkler Distance works by finding the greatest proximity value of the string being compared. Using this algorithm, errors in writing the spelling of words can be minimized.</note>
<note type="statement of responsibility"></note>
<subject authority="">
 <topic>Informatika</topic>
</subject>
<subject authority="">
 <topic>Sistem Informasi</topic>
</subject>
<classification>JUTISI</classification>
<identifier type="isbn">24432210</identifier>
<location>
 <physicalLocation>Perpustakaan Teknik UPI YAI </physicalLocation>
 <shelfLocator>JUTISI V6N2 Agustus 2020</shelfLocator>
 <holdingSimple>
  <copyInformation>
   <numerationAndChronology type="1">JUTISI2-002</numerationAndChronology>
   <sublocation>Perpustakaan FT UPI YAI</sublocation>
   <shelfLocator>JUTISI V6N2 Agustus 2020</shelfLocator>
  </copyInformation>
 </holdingSimple>
</location>
<slims:image>cover_issue_174_en_US.png.png</slims:image>
<recordInfo>
 <recordIdentifier>59197</recordIdentifier>
 <recordCreationDate encoding="w3cdtf">2023-02-22 14:00:03</recordCreationDate>
 <recordChangeDate encoding="w3cdtf">2023-02-22 14:00:03</recordChangeDate>
 <recordOrigin>machine generated</recordOrigin>
</recordInfo>
</modsCollection>