Populate list with only unique names

%3CLINGO-SUB%20id%3D%22lingo-sub-2876997%22%20slang%3D%22en-US%22%3EPopulate%20list%20with%20only%20unique%20names%3C%2FLINGO-SUB%3E%3CLINGO-BODY%20id%3D%22lingo-body-2876997%22%20slang%3D%22en-US%22%3E%3CP%3E%3CSTRONG%3EBackground%3A%20%3C%2FSTRONG%3EI'm%20trying%20to%20make%20a%20program%20for%20combining%20two%20tables%20based%20off%20of%20unique%2Fsimilar%20names.%20Because%20these%20tables%20come%20from%20two%20different%20sources%2C%20the%20names%20may%20or%20may%20not%20be%20an%20exact%20match%20(e.g.%20%22Dave%20Beck%22%20and%20%22David%20Beck%22).%20The%20goal%20is%20to%20have%20a%20system%20that%20creates%20a%20new%20table%20(Unique%20Names)%20and%20then%20does%20the%20following%20things%3A%3C%2FP%3E%3COL%3E%3CLI%3EFor%20each%20name%20that%20has%20zero%26nbsp%3B%3CSTRONG%3Eapproximate%3C%2FSTRONG%3E%20matches%2C%20add%20it%20to%20Unique%20Names%3C%2FLI%3E%3CLI%3EFor%20each%20name%20that%20DOES%20have%20an%20approximate%20match%2C%20add%20both%20names%20to%20a%20temporary%20table%3C%2FLI%3E%3CLI%3ECreate%20a%20popup%20window%20that%20will%2C%20for%20each%20entry%20in%20the%20temporary%20table%2C%20ask%20the%20user%20if%20the%20two%20names%20are%2C%20in%20fact%2C%20matches%20or%20not%3C%2FLI%3E%3CLI%3EIf%20the%20names%20are%20matches%2C%20merge%20the%20two%20entries%20and%20add%20the%20resulting%20entry%20to%20Unique%20Names%3C%2FLI%3E%3CLI%3EIf%20the%20names%20are%20not%20matches%2C%20add%20both%20of%20them%20to%20Unique%20Names%3C%2FLI%3E%3C%2FOL%3E%3CP%3E%26nbsp%3B%3C%2FP%3E%3CP%3E%3CU%3E%3CSTRONG%3EProblem%3A%3C%2FSTRONG%3E%3C%2FU%3E%3CSTRONG%3E%26nbsp%3B%3C%2FSTRONG%3EHowever%2C%20I%20can't%20even%20make%20it%20past%20step%202%20and%20I've%20been%20at%20this%20for%20hours.%20I've%20looked%20up%20everything%20I%20could%20thing%20of.%20Lookup%20functions%20can't%20return%20approximate%20matches%2C%20and%20neither%20can%20the%20Index%2FMatch%20combo.%20The%20fuzzy%20lookup%20add-in%20doesn't%20actually%20return%20any%20values%20without%20an%20unreasonable%20amount%20of%20work%20for%20this%20task%20and%20so%20can't%20be%20used%20for%20checking%26nbsp%3B%3CEM%3Eeach%20%3C%2FEM%3Ename%20individually.%3C%2FP%3E%3CP%3E%26nbsp%3B%3C%2FP%3E%3CP%3EThere%20has%20to%20be%26nbsp%3B%3CEM%3E%3CSTRONG%3Esome%26nbsp%3B%3C%2FSTRONG%3E%3C%2FEM%3Eway%20to%20just%20simply%20check%20if%20a%20certain%20name%20has%20any%26nbsp%3B%3CSTRONG%3Eapproximate%3C%2FSTRONG%3E%20(not%20partial)%20matches%20or%20not.%20There's%20an%20over-the-top%20add-in%20that%20does%20it%2C%20so%20there's%20got%20to%20be%20some%20method%20of%20accomplishing%20this%20task.%20Any%20help%20or%20guidance%20would%20be%20much%20appreciated%20as%20I%20am%20at%20my%20wits%20end%20as%20to%20how%20to%20do%20this.%20Thanks%20in%20advance!%26nbsp%3B%26nbsp%3B%3C%2FP%3E%3C%2FLINGO-BODY%3E%3CLINGO-LABS%20id%3D%22lingo-labs-2876997%22%20slang%3D%22en-US%22%3E%3CLINGO-LABEL%3EDeveloper%3C%2FLINGO-LABEL%3E%3CLINGO-LABEL%3EExcel%3C%2FLINGO-LABEL%3E%3CLINGO-LABEL%3EFormulas%20and%20Functions%3C%2FLINGO-LABEL%3E%3CLINGO-LABEL%3EOffice%20365%3C%2FLINGO-LABEL%3E%3C%2FLINGO-LABS%3E%3CLINGO-SUB%20id%3D%22lingo-sub-2878862%22%20slang%3D%22en-US%22%3ERe%3A%20Populate%20list%20with%20only%20unique%20names%3C%2FLINGO-SUB%3E%3CLINGO-BODY%20id%3D%22lingo-body-2878862%22%20slang%3D%22en-US%22%3E%3CP%3E%3CA%20href%3D%22https%3A%2F%2Ftechcommunity.microsoft.com%2Ft5%2Fuser%2Fviewprofilepage%2Fuser-id%2F1193896%22%20target%3D%22_blank%22%3E%40Rillien%3C%2FA%3E%26nbsp%3B%3C%2FP%3E%3CP%3E%26nbsp%3B%3C%2FP%3E%3CP%3EYou're%20at%20your%20wits%20end%20trying%20to%20figure%20out%20a%20complicated%20solution%2C%20then%20ask%20for%20help%20but%20did%20not%20share%20a%20sample%20data%20set%3F%20Normally%20in%20this%20and%20other%20communities%20problem%20solver%20like%20to%20solve%20puzzles%20just%20like%20a%20crossword%20puzzle%2C%20without%20the%20actual%20puzzle%2C%20problem%20solvers%20open%20this%20post%20because%20it%20sounds%20intriguing%20but%20there's%20no%20puzzle%20to%20solve%20(data%20set)%20so%20they%20just%20close%20the%20window%20and%20move%20on%20to%20the%20next%20puzzle.%3C%2FP%3E%3C%2FLINGO-BODY%3E
Occasional Visitor

Background: I'm trying to make a program for combining two tables based off of unique/similar names. Because these tables come from two different sources, the names may or may not be an exact match (e.g. "Dave Beck" and "David Beck"). The goal is to have a system that creates a new table (Unique Names) and then does the following things:

  1. For each name that has zero approximate matches, add it to Unique Names
  2. For each name that DOES have an approximate match, add both names to a temporary table
  3. Create a popup window that will, for each entry in the temporary table, ask the user if the two names are, in fact, matches or not
  4. If the names are matches, merge the two entries and add the resulting entry to Unique Names
  5. If the names are not matches, add both of them to Unique Names

 

Problem: However, I can't even make it past step 1 and I've been at this for hours. I've looked up everything I could thing of. Lookup functions can't return approximate matches, and neither can the Index/Match combo. The fuzzy lookup add-in doesn't actually return any values without an unreasonable amount of work for this task and so can't be used for checking each name individually.

 

There has to be some way to just simply check if a certain name has any approximate (not partial) matches or not. There's an over-the-top add-in that does it, so there's got to be some method of accomplishing this task. Any help or guidance would be much appreciated as I am at my wits end as to how to do this. Thanks in advance!  

1 Reply

@Rillien 

 

You're at your wits end trying to figure out a complicated solution, then ask for help but did not share a sample data set? Normally in this and other communities problem solver like to solve puzzles just like a crossword puzzle, without the actual puzzle, problem solvers open this post because it sounds intriguing but there's no puzzle to solve (data set) so they just close the window and move on to the next puzzle.