19. An article of manufacture for use in a machine, comprising: a) a memory; b) instructions stored in the memory for mapping multiword expressions to identifiers using finite-state networks, the instructions adapted to perform a method comprising: encoding each of a plurality of multiword expressions into a regular expression; each regular expression encoding a base form common to a plurality of derivative forms defined by ones of the multiword expressions; compiling with factorization each of the plurality of regular expressions into a set of finite-state networks; performing a union of the finite-state networks in the set of finite-state networks to define a multiword finite-state network and a set of subnets, each subset comprising a distinct standard network having an associated distinct start state and an associated final state comprising an entry and exit point, respectively, comprising arcs and states distinct from arcs and states of the finite-state network; traversing the multiword finite-state network and the set of subnets to identify a path corresponding to one of the plurality of multiword expressions; wherein said traversing accounts for only transitions originating from the multiword finite-state network to ascertain a path number identifying a base form of the one of the plurality of multiword expressions; and wherein said factorization comprises inserting an arc with a label in the multiword finite-state network at each appearance of a repeating subnet in the set of subnets, where each label is a reference to a subnet in the set of subnets.
19. An article of manufacture for use in a machine, comprising: a) a memory; b) instructions stored in the memory for mapping multiword expressions to identifiers using finite-state networks, the instructions adapted to perform a method comprising: encoding each of a plurality of multiword expressions into a regular expression; each regular expression encoding a base form common to a plurality of derivative forms defined by ones of the multiword expressions; compiling with factorization each of the plurality of regular expressions into a set of finite-state networks; performing a union of the finite-state networks in the set of finite-state networks to define a multiword finite-state network and a set of subnets, each subset comprising a distinct standard network having an associated distinct start state and an associated final state comprising an entry and exit point, respectively, comprising arcs and states distinct from arcs and states of the finite-state network; traversing the multiword finite-state network and the set of subnets to identify a path corresponding to one of the plurality of multiword expressions; wherein said traversing accounts for only transitions originating from the multiword finite-state network to ascertain a path number identifying a base form of the one of the plurality of multiword expressions; and wherein said factorization comprises inserting an arc with a label in the multiword finite-state network at each appearance of a repeating subnet in the set of subnets, where each label is a reference to a subnet in the set of subnets. 20. The article of manufacture according to claim 19 , wherein the method further comprises identifying information related to the one of the plurality of multiword expressions using the path number.