<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="umemura-1994-string">
    <titleInfo>
        <title>String Comparison based on Substring Equations</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Kyoji</namePart>
        <namePart type="family">Umemura</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1994</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Second Workshop on Very Large Corpora</title>
        </titleInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>This paper describes a practical method to compute whether two strings are equivalent under certain equations. This method uses a procedure called Critical-Pair/Completion. that generates rewriting rules from equations. Unlike other Critical-Pair/Completion procedures, the procedure described here always stops for all equations because it treats strings of bounded length. This paper also explains the importance of the string equivalence problem if international data handling is required.</abstract>
    <identifier type="citekey">umemura-1994-string</identifier>
    <location>
        <url>https://aclanthology.org/1994.vlc-1.10/</url>
    </location>
    <part>
        <date>1994</date>
        <extent unit="page">
            <start>121</start>
            <end>128</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T String Comparison based on Substring Equations
%A Umemura, Kyoji
%S Second Workshop on Very Large Corpora
%D 1994
%F umemura-1994-string
%X This paper describes a practical method to compute whether two strings are equivalent under certain equations. This method uses a procedure called Critical-Pair/Completion. that generates rewriting rules from equations. Unlike other Critical-Pair/Completion procedures, the procedure described here always stops for all equations because it treats strings of bounded length. This paper also explains the importance of the string equivalence problem if international data handling is required.
%U https://aclanthology.org/1994.vlc-1.10/
%P 121-128

Markdown (Informal)

[String Comparison based on Substring Equations](https://aclanthology.org/1994.vlc-1.10/) (Umemura, VLC 1994)

• String Comparison based on Substring Equations (Umemura, VLC 1994)

ACL

• Kyoji Umemura. 1994. String Comparison based on Substring Equations. In Second Workshop on Very Large Corpora, pages 121–128.