Admin at 14:27, 27 September 2018

2018-09-27T14:27:02Z

← Older revision		Revision as of 14:27, 27 September 2018
Line 5:		Line 5:
	==Needleman-Wunsch==		==Needleman-Wunsch==
	===Specifics===		===Specifics===
	*https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm		:*https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm

	===Summary===		===Summary===
	A typographical matching algorithm, and a variation of the Accurate Near and Levenshtein algorithms. Levenshtein and Needleman-Wunsch are identical except that character mistakes are given different weights depending on how far two characters are on a standard keyboard layout. For example: A to S is given a mistake weight of 0.4, while A to D is a 0.6 and A to P is a 1.0. Because the algorithm creates a 2D array to determine the distance between two strings, results will be more accurate than Fast Near at expense of throughput.		:A typographical matching algorithm, and a variation of the Accurate Near and Levenshtein algorithms. Levenshtein and Needleman-Wunsch are identical except that character mistakes are given different weights depending on how far two characters are on a standard keyboard layout. For example: A to S is given a mistake weight of 0.4, while A to D is a 0.6 and A to P is a 1.0. Because the algorithm creates a 2D array to determine the distance between two strings, results will be more accurate than Fast Near at expense of throughput.

	===Returns===		===Returns===
	Boolean ‘match’ if the normalized distance between two strings is less than the configured scale, where distance is defined as the count of the number of incorrect characters, insertions, and deletions.		:Boolean ‘match’ if the normalized distance between two strings is less than the configured scale, where distance is defined as the count of the number of incorrect characters, insertions, and deletions.

	===Example Matchcode Component===		===Example Matchcode Component===
Line 19:		Line 19:
	{{ExampleDataTableV1\|STRING1\|STRING2\|RESULT		{{ExampleDataTableV1\|STRING1\|STRING2\|RESULT
	\|AdditionalRows=		\|AdditionalRows=
	{{EDTRow\|~~White~~\|Johnson\|Jhnsn\|Match Found}}		{{EDTRow\|Green\|Johnson\|Jhnsn\|Match Found}}
	{{EDTRow\|~~White~~\|Maguire\|Mcguire\|Match Found}}		{{EDTRow\|Green\|Maguire\|Mcguire\|Match Found}}
	{{EDTRow\|~~Green~~\|Deanardo\|Dinardio\|Unique}}		{{EDTRow\|White\|Deanardo\|Dinardio\|Unique}}
	{{EDTRow\|Green\|Dearobier\|Des Robiere\|Match Found}}		{{EDTRow\|Green\|Dearobier\|Des Robiere\|Match Found}}
	}}		}}
Line 34:		Line 34:

	===Recommended Usage===		===Recommended Usage===
	Hybrid or real-time deduping. This works best in matching words that don't match because of a few typographical errors and where the accuracy in duplicates caught outweighs performance concerns.		:Hybrid or real-time deduping. This works best in matching words that don't match because of a few typographical errors and where the accuracy in duplicates caught outweighs performance concerns.

	===Not Recommended For===		===Not Recommended For===
	Enterprise size processes.		:Enterprise size processes.

	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= }} ==Needleman-Wunsch== ===Specifics=== *https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm ===Summary=== A typ..."

2018-09-26T00:00:32Z

Created page with "{{MatchcodeOptimizationNav |AlgorithmsCollapse= }} ==Needleman-Wunsch== ===Specifics=== *https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm ===Summary=== A typ..."

New page

{{MatchcodeOptimizationNav
|AlgorithmsCollapse=
}}

==Needleman-Wunsch==
===Specifics===
*https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm

===Summary===
A typographical matching algorithm, and a variation of the Accurate Near and Levenshtein algorithms. Levenshtein and Needleman-Wunsch are identical except that character mistakes are given different weights depending on how far two characters are on a standard keyboard layout. For example: A to S is given a mistake weight of 0.4, while A to D is a 0.6 and A to P is a 1.0. Because the algorithm creates a 2D array to determine the distance between two strings, results will be more accurate than Fast Near at expense of throughput.

===Returns===
Boolean ‘match’ if the normalized distance between two strings is less than the configured scale, where distance is defined as the count of the number of incorrect characters, insertions, and deletions.

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

===Example Data===
{{ExampleDataTableV1|STRING1|STRING2|RESULT
|AdditionalRows=
{{EDTRow|White|Johnson|Jhnsn|Match Found}}
{{EDTRow|White|Maguire|Mcguire|Match Found}}
{{EDTRow|Green|Deanardo|Dinardio|Unique}}
{{EDTRow|Green|Dearobier|Des Robiere|Match Found}}
}}

{{MatchcodePerformance
|Performance1=
|Matches3=
}}

===Recommended Usage===
Hybrid or real-time deduping. This works best in matching words that don't match because of a few typographical errors and where the accuracy in duplicates caught outweighs performance concerns.

===Not Recommended For===
Enterprise size processes.

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:Needleman-Wunsch - Revision history

Admin at 14:27, 27 September 2018

Admin: Created page with "{{MatchcodeOptimizationNav |AlgorithmsCollapse= }} ==Needleman-Wunsch== ===Specifics=== *https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch_algorithm ===Summary=== A typ..."