Abstract: An application-specific dictionary is provided that includes a plurality of entries, where each entry matches to one or more items that comprise one or more records of a record store. For at least some of the plurality of entries, each entry has multiple phonetic representations, including one or more phonetic representations that are at least one of (i) an abbreviation of that entry, or (ii) a null use of the entry when that entry is combined with another entry.

Abstract: An application-specific dictionary is provided that includes a plurality of entries, where each entry matches to one or more items that comprise one or more records of a record store. For at least some of the plurality of entries, each entry has multiple phonetic representations, including one or more phonetic representations that are at least one of (i) an abbreviation of that entry, or (ii) a null use of the entry when that entry is combined with another entry.

Abstract: Searching a database (106) involves creating an access structure including a first tree data structure (501) having a root node (5011) and at least one child node (5012). Each child node is associated with match data corresponding to a data value of a field of a database record (300). Leaf child nodes of the first tree data structure include a link (704) to another tree data structure in the access structure. Leaf child nodes (5033) of a further tree data structure include a link (718) to a database record. The tree structures are traversed and scores are computed for the paths traversed that reflect the level of matching between the match pattern data of the nodes in a path and a search request to identify a database record that best matches the request.