Admin at 23:16, 26 September 2018

2018-09-26T23:16:10Z

← Older revision		Revision as of 23:16, 26 September 2018
Line 5:		Line 5:
	==Frequency==		==Frequency==
	===Specifics===		===Specifics===
	The Frequency algorithm will match the characters of one string to the characters of another without any regard to the sequence.		:The Frequency algorithm will match the characters of one string to the characters of another without any regard to the sequence.

	===Summary===		===Summary===
	Frequency can be used when 2 strings are expected to have the same characters and are of the same length - for example, "abcdef" would be considered a 100% match to "badcfe." But should not be used to match a variant number of characters. For example “wxyz” would not match “wzy” nor “wzzy”		:Frequency can be used when 2 strings are expected to have the same characters and are of the same length - for example, "abcdef" would be considered a 100% match to "badcfe." But should not be used to match a variant number of characters. For example “wxyz” would not match “wzy” nor “wzzy”

	===Returns===		===Returns===
	Boolean ‘match’ if the compared data has the same values.		:Boolean ‘match’ if the compared data has the same values.

	===Example Matchcode Component===		===Example Matchcode Component===
Line 20:		Line 20:
	\|AdditionalRows=		\|AdditionalRows=
	{{EDTRow\|White\|Johnson\|Jhnsn\|Unique}}		{{EDTRow\|White\|Johnson\|Jhnsn\|Unique}}
	{{EDTRow\|~~White~~\|Johnson\|Johnosn\|Match Found}}		{{EDTRow\|Green\|Johnson\|Johnosn\|Match Found}}
	{{EDTRow\|Green\|Lynda\|Dylan\|Match Found}}		{{EDTRow\|Green\|Lynda\|Dylan\|Match Found}}
	{{EDTRow\|Green\|A B D H T\|A T B H D\|Match Found}}		{{EDTRow\|Green\|A B D H T\|A T B H D\|Match Found}}
Line 34:		Line 34:

	===Recommended Usage===		===Recommended Usage===
	Batch processing—this is a fast algorithm which will identify a greater percentage of duplicates because it will count exact matches and minor character transpositions.		:Batch processing—this is a fast algorithm which will identify a greater percentage of duplicates because it will count exact matches and minor character transpositions.

	This algorithm is also recommended when the data is comprised of single character dictionary values like ‘A B C’.		:This algorithm is also recommended when the data is comprised of single character dictionary values like ‘A B C’.

	===Not Recommended For===		===Not Recommended For===
	Short name data types where a simple character transformation would represent a different value. This algorithm is also not recommended when trying to identify differences in long strings.		:Short name data types where a simple character transformation would represent a different value. This algorithm is also not recommended when trying to identify differences in long strings.

	===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= }} ==Frequency== ===Specifics=== The Frequency algorithm will match the characters of one string to the characters of another ..."

2018-09-25T23:18:08Z

Created page with "{{MatchcodeOptimizationNav |AlgorithmsCollapse= }} ==Frequency== ===Specifics=== The Frequency algorithm will match the characters of one string to the characters of another ..."

New page

{{MatchcodeOptimizationNav
|AlgorithmsCollapse=
}}

==Frequency==
===Specifics===
The Frequency algorithm will match the characters of one string to the characters of another without any regard to the sequence.

===Summary===
Frequency can be used when 2 strings are expected to have the same characters and are of the same length - for example, "abcdef" would be considered a 100% match to "badcfe." But should not be used to match a variant number of characters. For example “wxyz” would not match “wzy” nor “wzzy”

===Returns===
Boolean ‘match’ if the compared data has the same values.

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

===Example Data===
{{ExampleDataTableV1|STRING1|STRING2|RESULT
|AdditionalRows=
{{EDTRow|White|Johnson|Jhnsn|Unique}}
{{EDTRow|White|Johnson|Johnosn|Match Found}}
{{EDTRow|Green|Lynda|Dylan|Match Found}}
{{EDTRow|Green|A B D H T|A T B H D|Match Found}}
}}

{{MatchcodePerformance
|Performance5=
|Matches1=
}}

===Recommended Usage===
Batch processing—this is a fast algorithm which will identify a greater percentage of duplicates because it will count exact matches and minor character transpositions.

This algorithm is also recommended when the data is comprised of single character dictionary values like ‘A B C’.

===Not Recommended For===
Short name data types where a simple character transformation would represent a different value. This algorithm is also not recommended when trying to identify differences in long strings.

===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:Frequency - Revision history

Admin at 23:16, 26 September 2018

Admin: Created page with "{{MatchcodeOptimizationNav |AlgorithmsCollapse= }} ==Frequency== ===Specifics=== The Frequency algorithm will match the characters of one string to the characters of another ..."