文本语句比较算法

本文介绍了一种C#实现的文本比较算法,通过按标点符号分割文本,对比两个版本之间的变化。算法能识别文本的删除和增加,但无法精确到字的修改。
摘要由CSDN通过智能技术生成

1,算法实现效果

      按标点符号进行分割,两段文本上一个文本 与当前文本分割为两个list,遍历上一个版本list,与当前版本对比如果每一项出现,表示未修改,如果未出现表示删除

     遍历当前版本list与上一个版本对比,如果每一项出现,表示未修改,如果未出现表示增加

      注:不能精确定位到字有没有修改

2,算法部分 

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;

namespace Base
{
    public class CompareModel
    {
        public string currentStr { get; set; }
        public string compareStr { get; set; }
        public List<string> deleteList { get; set; }
        public List<string> insertList { get; set; }
    }
    public class CompareStr
    {
        public CompareModel GetCompareRet(string strcurrent, string strnext)
        {
            if (strcurrent == strnext)
            {
                return new CompareModel { compareStr = strcurrent, currentStr = strcurrent };
            }
            string str1 = strcurrent + "\n";
            string str2 = strnext + "\n";
            DiffTextClass diff = new DiffTextClass();
            DiffTextClass.Item[] items = diff.DiffText(str1, str2);
            Regex reg = new Regex("[\、\,\,\.\。\;\;\?\!\!\:\:\r\n]");

            string str1ret = reg.Replace(str1, "|");
            string[] Lines1 = str1ret.Split('|');
            List<string> note1 = GetNotes(str1);

            string str2ret = reg.Replace(str2, "|");
            string[] Lines2 = str2ret.Split('|');
            List<string> note2 = GetNotes(str2);

            List<string> deleteList = new List<string>();
            List<string> insertList = new List<string>();
            foreach (var item in items)
            {
                string deltestrB = "";
                if (item.deletedA > 0)
                {
                    for (int i = 0; i < item.deletedA; i++)
                    {
                        string deleteStr = Lines1[item.StartA + i];
                        deleteStr = deleteStr.Replace("{tdr}", "");
                        Lines1[item.StartA + i] = "<del>" + deleteStr + "</del>";
                        deleteList.Add(deleteStr);
                        if (item.StartA + i < note1.Count)
                        {
                            deltestrB += "<del>" + deleteStr + "</del>" + note1[item.StartA + i];
                        }

                    }
                }
                if (item.insertedB == 0 && item.deletedA > 0)
                {
                    string insertStr = Lines2[item.StartB];
                    Lines2[item.StartB] = deltestrB + insertStr;
                }

                if (item.insertedB > 0)
                {
                    for (int i = 0; i < item.insertedB; i++)
                    {
                        string insertStr = Lines2[item.StartB + i];
                        if (i != 0)
                        {
                            deltestrB = "";
                        }
                        insertStr = insertStr.Replace("{tdr}", "");
                        Lines2[item.StartB + i] = deltestrB + "<insert>" + insertStr + "</insert>";
                        insertList.Add(insertStr);
                    }
                }

            }

            string str1out = "";
            //第一篇加入标点
            for (int i = 0; i < Lines1.Length - 1; i++)
            {
                if (i >= note1.Count)
                {
                    str1out += Lines1[i] + "。";
                }
                else
                {
                    str1out += Lines1[i] + note1[i];
                }
            }
            string str2out = "";
            //第二篇加入标点
            for (int i = 0; i < Lines2.Length - 1; i++)
            {
                if (i >= note2.Count)
                {
                    str2out += Lines2[i] + "。";
                }
                else
                {
                    str2out += Lines2[i] + note2[i];
                }
            }
            CompareModel model = new CompareModel();
            model.currentStr = str1out;
            model.compareStr = str2out;
            model.deleteList = deleteList;
            model.insertList = insertList;
            return model;

        }
        //是否为标点符号
        public bool IsNote(string str)
        {
            //if (Regex.IsMatch(text[i].ToString(), @"[\u4e00-\u9fbb]+{1}quot;)))
            System.
namespace ServiceRanking { /// <summary> /// Summary description for TF_IDFLib. /// </summary> public class TFIDFMeasure { private string[] _docs; private string[][] _ngramDoc; private int _numDocs=0; private int _numTerms=0; private ArrayList _terms; private int[][] _termFreq; private float[][] _termWeight; private int[] _maxTermFreq; private int[] _docFreq; public class TermVector { public static float ComputeCosineSimilarity(float[] vector1, float[] vector2) { if (vector1.Length != vector2.Length) throw new Exception("DIFER LENGTH"); float denom=(VectorLength(vector1) * VectorLength(vector2)); if (denom == 0F) return 0F; else return (InnerProduct(vector1, vector2) / denom); } public static float InnerProduct(float[] vector1, float[] vector2) { if (vector1.Length != vector2.Length) throw new Exception("DIFFER LENGTH ARE NOT ALLOWED"); float result=0F; for (int i=0; i < vector1.Length; i++) result += vector1[i] * vector2[i]; return result; } public static float VectorLength(float[] vector) { float sum=0.0F; for (int i=0; i < vector.Length; i++) sum=sum + (vector[i] * vector[i]); return (float)Math.Sqrt(sum); } } private IDictionary _wordsIndex=new Hashtable() ; public TFIDFMeasure(string[] documents) { _docs=documents; _numDocs=documents.Length ; MyInit(); } private void GeneratNgramText() { } private ArrayList GenerateTerms(string[] docs) { ArrayList uniques=new ArrayList() ; _ngramDoc=new string[_numDocs][] ; for (int i=0; i < docs.Length ; i++) { Tokeniser tokenizer=new Tokeniser() ; string[] words=tokenizer.Partition(docs[i]); for (int j=0; j < words.Length ; j++) if (!uniques.Contains(words[j]) ) uniques.Add(words[j]) ; } return uniques; } private static object
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

左左在右边

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值