The Matcher (Tool) - Revision history

Ed at 16:33, 6 October 2020

2020-10-06T16:33:24Z

Ed at 16:18, 6 October 2020

2020-10-06T16:18:48Z

Ed at 17:48, 21 September 2020

2020-09-21T17:48:39Z

Ed at 17:34, 21 September 2020

2020-09-21T17:34:38Z

Ed at 17:20, 20 September 2020

2020-09-20T17:20:15Z

Ed at 17:12, 20 September 2020

2020-09-20T17:12:27Z

BenBaldazo at 20:42, 12 September 2017

2017-09-12T20:42:31Z

ShelbyBice: /* Code */

2017-04-18T14:58:47Z

Code

Ed at 17:50, 22 March 2017

2017-03-22T17:50:08Z

Ed at 17:14, 22 March 2017

2017-03-22T17:14:12Z

@@ Line 7: / Line 7: @@
 |Has project status=Proposed
 }}
-<onlyinclude>
+<onlyinclude>[[The Matcher (Tool)]] is a tool to match and merge datasets using company names as identifiers. It is written in perl and implements both normalization and fuzzy matching techniques. The normalization methods include 'Hall' and others used by the [[NBER Patent Data]] project, and the fuzzy matching supports a range of techniques (Ngram, LCS, etc.) that can be used to generate candidate lists for human processing or machine learning, as well as threshold-based cut-offs.</onlyinclude>
 ==Code==

@@ Line 7: / Line 7: @@
 |Has project status=Proposed
 }}
-==Abstract==
+<onlyinclude>
-A tool to match and merge datasets.
+[[The Matcher (Tool)]] is a tool to match and merge datasets using company names as identifiers. It is written in perl and implements both normalization and fuzzy matching techniques. The normalization methods include 'Hall' and others used by the [[NBER Patent Data]] project, and the fuzzy matching supports a range of techniques (Ngram, LCS, etc.) that can be used to generate candidate lists for human processing or machine learning, as well as threshold-based cut-offs.
 ==Code==
@@ Line 17: / Line 18: @@
 Usage:
-The matcher takes two tab delimited text files containing firm names and matches them. The two input files should be put in the Input directory. The results of a successful match run can be found in the Output directory. The firm names can be in any column(s) of the tab delimited text files. By default the software assumes that the names are in the first column of each of the two files. Also by default the normalization technique used is "hall" (see below) and the algorithm is "none" (see below).
+The matcher takes two tab-delimited text files containing firm names and matches them. The two input files should be put in the Input directory. The results of a successful match run can be found in the Output directory. The firm names can be in any column(s) of the tab-delimited text files. By default, the software assumes that the names are in the first column of each of the two files. Also by default, the normalization technique used is "hall" (see below) and the algorithm is "none" (see below).
 Matching has two stages: 1) Normalization based matching; and 2) Algorithm matching based on normalized strings. Using an algorithm of "none" prevents the second stage from taking place. Likewise, though this is generally not recommended (except for deliberate testing), using "lowercase" normalization will just translate all strings into lowercase without other changes, and normalization matching is the same as case-insensitive exact string matching.
-Although matches should be symmetric, the Matcher works by using one file as the list file and one file as the reference (ref) file. With some algorithms choosing the shorter file to be the ref file may improve performance. By default the first file (file1) is considered the list file, though this can be overridden with the -list=2 option.
+Although matches should be symmetric, the Matcher works by using one file as the list file and one file as the reference (ref) file. With some algorithms choosing the shorter file to be the ref file may improve performance. By default, the first file (file1) is considered the list file, though this can be overridden with the -list=2 option.
 A simple match between the files small1.txt and small2.txt (both are included) would be run as follows:

@@ Line 1: / Line 1: @@
 {{Project
-|Has project output=
+|Has project output=Tool,How-to
 |Has sponsor=McNair Center
 |Has title=The Matcher (Tool)

@@ Line 1: / Line 1: @@
 {{Project
 |Has sponsor=McNair Center
 |Has title=The Matcher (Tool)

@@ Line 1: / Line 1: @@
 {{Project
 |Has title=The Matcher (Tool)
 |Has start date=Summer 2016

@@ Line 23: / Line 23: @@
 A simple match between the files small1.txt and small2.txt (both are included) would be run as follows:
-	perl Matcher.pl -file1="small1.txt" -file2="small2.txt" -name1=1 -name2=1 -list=1 -normalize="hall" -algorithm="none"
+ perl Matcher.pl -file1="small1.txt" -file2="small2.txt" -name1=1 -name2=1 -list=1 -normalize="hall" -algorithm="none"
 which is equivalent to...
-	perl Matcher.pl -file1="small1.txt" -file2="small2.txt"
+ perl Matcher.pl -file1="small1.txt" -file2="small2.txt"
 ==References==
 <!-- flush -->

@@ Line 12: / Line 12: @@
 The code is in the repository. A ready-to-use version is in:
   E:\McNair\Software\Scripts\Matcher
 ==References==
 <!-- flush -->