Unobtanium's search engine uses a redenormalisation approach to build search indices that support both exact matching and normalized queries across multiple languages. Rather than maintaining separate indices, the system stores both original and normalized word forms with a lookup table, allowing searches for 'cat' to find 'cat', 'cats', and 'cat's' without losing exact-match capability.