This paper describes applications of the optimized pattern discover),framework to text and Webmining. In particular; we introduce a class of simple combinatorialpatterns over phrases, called proximity phrase association patterns, and consider the problem of jinding the patterns that optimize a given statistical measure within the whole class of patterns in a large collection of unstructured texts. For this class of patterns, we develop fast and robust text mining algorithms based on techniques in computational geometry and string matching. Finally, we successfully apply the developed text mining algorithms to the experiments on interactive document browsing in a large text database and keyword discoveryfrom Webbases.