Find Paragraph Differences

Thanks trail. So basically, what I have is what I can get. lol.

I found a similar one based on a cost matrix, and it does highlighting as well, works quite good. You deserve the points as your code helped me refine the code that I have to make it work for what I needed. Thanks Trail!

}Wulf{

Thanks for the points wulfshayde,

If you needed a hand tuning the code on the other post I can help, just was saying I wasn't too sure how accurate you needed it to be, the one script I had there did good, but there were some cases in there that would slip through the cracks, basically that was for a typing test. But the other version I have caught those little slips as well. you can have a look here...

http://www.cfusionx.com/type/index.cfm

you'll see this catches what the other doesn't after a bit of testing...

let me know =)
~trail

That is cool Trail. :)

I've turned the one I found on that other site into a component with 3 functions. It works well. See below:

==COMPONENT cfDiff.cfc===============================================

<!--- DIFF Comparison [START] --->

<!---ORIGINAL CODE/CONCEPT
====================================
Micha Schopman            
mail: micha@mschopman.demon.nl            
mail: micha.schopman@modernmedia.nl            
msn: micha@mschopman.demon.nl
--->  

      <cffunction name="cfDiff" access="public" output="true" returntype="struct">
            <cfargument name="txtString1" type="string" required="no" default="" />
            <cfargument name="txtString2" type="string" required="no" default="" />
            <cfset var diffStruct = structNew() />
            <cfset var s1 = arguments.txtString1 />
            <cfset var s2 = arguments.txtString2 />
            <cftry>
            <cfset s1 = Replace(s1, "#Chr(10)#", "", "ALL")>
            <cfset s2 = Replace(s2, "#Chr(10)#", "", "ALL")>
            <cfset s = split(s1," ")>
            <cfset t = split(s2," ")>
            <cfif isArray(s)>
                  <cfset n = ArrayLen(s)>
                  <cfset m = ArrayLen(t)>
            <cfelse>
                  <cfset n = Len(s)>
                  <cfset m = Len(t)>
            </cfif>
            <cfset matrix = ArrayNew(2)>
            <cfset d = ArrayNew(2)>
            <cfloop from="1" to="#n#" index="i">
                  <cfset d[i][1] = i>
            </cfloop>
            <cfloop from="1" to="#m#" index="j">
                  <cfset d[1][j] = i>
            </cfloop>
            <cfset maxSubCost = 0>
            <cfloop from="2" to="#n#" index="i">
                  <cfset sc = s[(i-1)]>
                  <cfloop from="2" to="#m#" index="j">
                        <cfif sc EQ t[(j-1)]>
                              <cfset subCost = 0>
                        <cfelse>
                              <cfset subCost = 1>
                        </cfif>
                        <cfset left = d[(i-1)][j] + 1>
                        <cfset above = d[i][(j-1)] + 1>
                        <cfset diagonal = d[(i-1)][(j-1)] + subCost>
                        <cfset d[i][j] = min(above,min(left,diagonal))>
                        <cfif d[i][j] GT maxSubCost>
                              <cfset maxSubCost = d[i][j]>
                        </cfif>
                  </cfloop>
            </cfloop>
            <cfset i = n>
            <cfset j = m>
            <cfset wantArray = true>
            <cfif wantArray>
                  <cfset res = arrayNew(2)>
                  <cfset stappen = 0>
                  <cfset keep = 0>
                  <cfloop condition="i GT 1 AND j GT 1">
                        <cfset stappen = stappen + 1>
                        <cfset left = IIF(i EQ 2,maxSubCost,d[(i-1)][j])>
                        <cfset above = IIF(j EQ 2,maxSubCost,d[i][(j-1)])>
                        <cfset diagonal = IIF(i EQ 2 OR j EQ 0,maxSubCost,d[(i-1)][(j-1)])>
                        <cfset minimal = min(above,min(left,diagonal))>
                        <cfif diagonal EQ minimal>
                              <cfset sc = s[(i-1)]>
                              <cfset tc = t[(j-1)]>
                              <cfif sc EQ tc>
                                    <cfset res[stappen][1] = 0>
                                    <cfset res[stappen][2] = tc>
                                    <cfset keep = keep + 1>
                              <cfelse>
                                    <cfset res[stappen][1] = 1>
                                    <cfset res[stappen][2] = sc>
                                    <cfset res[stappen][3] = tc>
                              </cfif>
                              <cfset i = i -1>
                              <cfset j = j -1>
                        <cfelseif above EQ minimal>
                              <cfset res[stappen][1] = "+">
                              <cfset res[stappen][2] = t[(j-1)]>
                              <cfset j = j - 1>
                        <cfelse>
                              <cfset res[stappen][1] = "-">
                              <cfset res[stappen][2] = s[(i-1)]>
                              <cfset i = i -1>
                        </cfif>
                  </cfloop>
                  <cfset res = ArrayReverse(res)>
            </cfif>
            <cfset StructInsert(diffStruct,"changed",round(((stappen-keep)/stappen)*100)) />
            <cfset StructInsert(diffStruct,"comparison",res) />
            <cfcatch>
                  <cfdump var="#cfcatch#" />
                  <cfabort />
            </cfcatch>
            </cftry>
            <cfreturn diffStruct />
      </cffunction>

      <cffunction access="private" name="split" output="false" returntype="array">
            <cfargument name="str" required="yes" />
            <cfargument name="splitstr" required="yes" />
                  <cfset var results = arrayNew(1) />
                  <cfset var special_char_list      = "\,+,*,?,.,[,],^,$,(,),{,},|,-" />
                  <cfset var esc_special_char_list  = "\\,\+,\*,\?,\.,\[,\],\^,\$,\(,\),\{,\},\|,\-" />
                  <cfset var regex = ReplaceList(arguments.splitstr, special_char_list, esc_special_char_list) />
                  <cfset var test = REFind(regex,arguments.str,1,1) />
                  <cfset var pos = test.pos[1] />
                  <cfset var oldpos = 1 />
                        <cfif not pos>
                              <cfreturn arguments.str />
                        </cfif>
                        <cfloop condition="pos GT 0">
                              <cfset arrayAppend(results,mid(arguments.str,oldpos,pos-oldpos)) />
                              <cfset oldpos = pos+test.len[1] />
                              <cfset test = REFind(regex,arguments.str,oldpos+1,1) />
                              <cfset pos = test.pos[1] />
                        </cfloop>
                        <cfif len(arguments.str) gte oldpos>
                              <cfset arrayappend(results,right(arguments.str,len(arguments.str)-oldpos + 1)) />
                              <cfreturn results />
                        </cfif>
      </cffunction>

      <cffunction name="ArrayReverse" access="private" output="false" returntype="array">
            <cfargument name="inArray" type="array" required="yes" />
            <cfset var outArray = ArrayNew(1) />
            <cfset var i=0 />
            <cfset var j = 1 />
                  <cfloop from="#ArrayLen(arguments.inArray)#" to="1" step="-1" index="i">
                        <cfset outArray[j] = arguments.inArray[i] />
                        <cfset j = j + 1 />
                  </cfloop>
            <cfreturn outArray />
      </cffunction>
      
<!--- DIFF Comparison [END] --->

======================================================================

==index.cfm==============================================================

<cfset s1 = "Assessing the recovery effort after the storm cut a path of destruction diagonally across the Sunshine State, Gov. Jeb Bush said that ""we've made really good progress"" -- although he conceded the patience of some Floridians coping without roofs or electricity in 90-degree heat may be wearing thin. ""The great majority of people, I think, recognize that this is a work in progress, that there's improvements being made,"" he said. ""There may be isolated cases of people that are annoyed by the inconvenience, and who can blame them."" Charley also threatened to interfere with the state's scheduled August 31 primary, which could add yet another chapter to the state's recent history of election malfunctions.">

<cfset s2 = "Assessing the recovery after the storm cut a path of destruction diagonally across the Sunshine State, Gov. Jeb Kerry said that ""we've made really good progress"" -- although he conceded the patience of some Floridians coping without roofs or electricity in 90-degree heat may be wearing thin. ""The great majority of aliens, I think, recognize that this is a work in progress, that there's improvements being made,"" he said. ""There may be isolated cases of people that are annoyed by the inconvenience of their neighbours, and who can blame them (I do)."" Charley also threatened to interfere with the state's scheduled August 31 primary, which could add yet another chapter to the state's recent history of malfunctions.">

<cfset cfDiff = createObject("Component","cfDiff") />
<cfset diffStruct = cfDiff.cfDiff(s1,s2) />
<cfoutput>#diffStruct.changed#% is changed.</cfoutput>
<strong>Original Version:</strong> <hr><cfoutput>#s1#</cfoutput> <br><br><br>
<strong>Changed Version:</strong> <hr> <cfoutput>#s2#</cfoutput> <br><br><br>
<strong>Versions Compared:</strong> <hr>
<cfoutput><cfloop from="1" to="#ArrayLen(comparison)#" index="i">
      <cfif res[i][1] EQ 0>#res[i][2]#<cfelseif res[i][1] EQ 1><span style='background-color: ##FFAAAA'>#res[i][2]# </span><span style='background-color: ##AAFFAA'>#res[i][3]#</span><cfelseif res[i][1] EQ "+"><span style='background-color: ##AAFFAA'>#res[i][2]# </span><cfelseif res[i][1] EQ "-"><span style='background-color: ##FFAAAA'>#res[i][2]# </span>
        </cfif>
</cfloop></cfoutput>

===================================================================