1. A method for searching for a name in a database, comprising: inputting a name as a character input string, the name comprising an affix and at least one of a first name, second name, and a last name, into only one input field; parsing the character input string taken from the one input field into a plurality of permutations of the input string; in response to the parsing, creating a lookup table having each of the plurality of permutations of the input string parsed from the input string; iterating through the lookup table, the lookup table having an index value assigned to each of the plurality of permutations of the input string, the index value pointing to a next entry in the lookup table; based on a successful comparison between the permutation of the input string in the lookup table and a customizing table, selecting first values from the customizing table including values related to the input string permutation on the iteration of the lookup table, wherein the customizing table contains affixes that are common in persons names; identifying a next entry in the lookup table using an index value associated with the permutation of the name according to the comparison to the customizing table, if the index value of the identified next entry is an exit condition, exit the comparison of the customizing table; if the identified next entry has an index value assigned to a permutation of the input string, making another comparison between the next entry from the lookup table and the customizing table, selecting second values from the customizing table; searching a database for the input string into the input field using, if the index value of the identified next entry was an exit condition, the selected first value, otherwise, using the selected first value and the selected second value; returning a result list from the database; and presenting the result list on an output device.
1. A method for searching for a name in a database, comprising: inputting a name as a character input string, the name comprising an affix and at least one of a first name, second name, and a last name, into only one input field; parsing the character input string taken from the one input field into a plurality of permutations of the input string; in response to the parsing, creating a lookup table having each of the plurality of permutations of the input string parsed from the input string; iterating through the lookup table, the lookup table having an index value assigned to each of the plurality of permutations of the input string, the index value pointing to a next entry in the lookup table; based on a successful comparison between the permutation of the input string in the lookup table and a customizing table, selecting first values from the customizing table including values related to the input string permutation on the iteration of the lookup table, wherein the customizing table contains affixes that are common in persons names; identifying a next entry in the lookup table using an index value associated with the permutation of the name according to the comparison to the customizing table, if the index value of the identified next entry is an exit condition, exit the comparison of the customizing table; if the identified next entry has an index value assigned to a permutation of the input string, making another comparison between the next entry from the lookup table and the customizing table, selecting second values from the customizing table; searching a database for the input string into the input field using, if the index value of the identified next entry was an exit condition, the selected first value, otherwise, using the selected first value and the selected second value; returning a result list from the database; and presenting the result list on an output device. 6. A method according to claim 1 , wherein the words in the character input string that are not found in the customizing table are last names.