Admin at 14:25, 27 September 2018

2018-09-27T14:25:06Z

← Older revision		Revision as of 14:25, 27 September 2018
Line 5:		Line 5:
	==Longest Common Substring (LCS)==		==Longest Common Substring (LCS)==
	===Specifics===		===Specifics===
	Finds the longest common substring between the two strings.		:Finds the longest common substring between the two strings.

	===Summary===		===Summary===
	This algorithm finds the longest common substring between two values. For example, the longest common substring between “ABCDE” and “ABCEF” is “ABC”		:This algorithm finds the longest common substring between two values. For example, the longest common substring between “ABCDE” and “ABCEF” is “ABC”

	===Returns===		===Returns===
	lenLCS / maxLen		:lenLCS / maxLen

	===Example Matchcode Component===		===Example Matchcode Component===
Line 19:		Line 19:
	{{ExampleDataTableV1\|STRING1\|STRING2\|RESULT		{{ExampleDataTableV1\|STRING1\|STRING2\|RESULT
	\|AdditionalRows=		\|AdditionalRows=
	{{EDTRow\|~~White~~\|Abcd\|Abce\|Match}}		{{EDTRow\|Green\|Abcd\|Abce\|Match}}
	{{EDTRow\|White\|Abcde\|Abcef\|Unique}}		{{EDTRow\|White\|Abcde\|Abcef\|Unique}}
	{{EDTRow\|Green\|Ron Doe\|Ron Doe67\|Match}}		{{EDTRow\|Green\|Ron Doe\|Ron Doe67\|Match}}
Line 34:		Line 34:

	===Recommended Usage===		===Recommended Usage===
	Hybrid Deduper - Where a single incoming record can quickly be evaluated independently against each record in an existing large master database.		:Hybrid Deduper - Where a single incoming record can quickly be evaluated independently against each record in an existing large master database.

	Batch or Enterprise runs where the first component allows efficient clustering.		:Batch or Enterprise runs where the first component allows efficient clustering.

	Databases where unrecognized keyword variations appear in some of the records.		:Databases where unrecognized keyword variations appear in some of the records.

	General or Company data that contain a large similar string but have slight variations in valid keywords and company acronyms cannot accurately be built		:General or Company data that contain a large similar string but have slight variations in valid keywords and company acronyms cannot accurately be built

	===Not Recommended===		===Not Recommended===
	Short name string comparison.		:Short name string comparison.

	Gather / scatter, Survivorship, or record consolidation of sensitive data.		:Gather / scatter, Survivorship, or record consolidation of sensitive data.

	Quantifiable data or records with proprietary keywords not associated in our knowledgebase tables.		:Quantifiable data or records with proprietary keywords not associated in our knowledgebase tables.

	===Do Not Use With===		===Do Not Use With===
	UTF-8 data. This algorithm was ported to Matchup with the assumption that a character equals one byte, and therefore results may not be accurate if the data contains multi-byte characters.		:UTF-8 data. This algorithm was ported to Matchup with the assumption that a character equals one byte, and therefore results may not be accurate if the data contains multi-byte characters.


	[[Category:MatchUp Hub]]		[[Category:MatchUp Hub]]
	[[Category:Matchcode Optimization]]		[[Category:Matchcode Optimization]]

Admin: Created page with "{{MatchcodeOptimizationNav |AlgorithmsCollapse= }} ==Longest Common Substring (LCS)== ===Specifics=== Finds the longest common substring between the two strings. ===Summary=..."

2018-09-25T23:26:15Z

Created page with "{{MatchcodeOptimizationNav |AlgorithmsCollapse= }} ==Longest Common Substring (LCS)== ===Specifics=== Finds the longest common substring between the two strings. ===Summary=..."

New page

{{MatchcodeOptimizationNav
|AlgorithmsCollapse=
}}

==Longest Common Substring (LCS)==
===Specifics===
Finds the longest common substring between the two strings.

===Summary===
This algorithm finds the longest common substring between two values. For example, the longest common substring between “ABCDE” and “ABCEF” is “ABC”

===Returns===
lenLCS / maxLen

===Example Matchcode Component===
:[[File:MCO_Algorithm_LCS.png|link=]]

===Example Data===
{{ExampleDataTableV1|STRING1|STRING2|RESULT
|AdditionalRows=
{{EDTRow|White|Abcd|Abce|Match}}
{{EDTRow|White|Abcde|Abcef|Unique}}
{{EDTRow|Green|Ron Doe|Ron Doe67|Match}}
{{EDTRow|Green|Al Doe Aerostructures Co|Ad Aerostructures Co|Match}}
}}

{{MatchcodePerformance
|Performance2=
|Matches4=
}}

===Recommended Usage===
Hybrid Deduper - Where a single incoming record can quickly be evaluated independently against each record in an existing large master database.

Batch or Enterprise runs where the first component allows efficient clustering.

Databases where unrecognized keyword variations appear in some of the records.

General or Company data that contain a large similar string but have slight variations in valid keywords and company acronyms cannot accurately be built

===Not Recommended===
Short name string comparison.

Gather / scatter, Survivorship, or record consolidation of sensitive data.

Quantifiable data or records with proprietary keywords not associated in our knowledgebase tables.

===Do Not Use With===
UTF-8 data. This algorithm was ported to Matchup with the assumption that a character equals one byte, and therefore results may not be accurate if the data contains multi-byte characters.

[[Category:MatchUp Hub]]
[[Category:Matchcode Optimization]]

Matchcode Optimization:Longest Common Substring (LCS) - Revision history

Admin at 14:25, 27 September 2018

Admin: Created page with "{{MatchcodeOptimizationNav |AlgorithmsCollapse= }} ==Longest Common Substring (LCS)== ===Specifics=== Finds the longest common substring between the two strings. ===Summary=..."