- Full text PDF available (6)
- This year (0)
- Last 5 years (4)
- Last 10 years (5)
Journals and Conferences
The present work investigates the possibility of constructing a multivariate calibration model for predicting the composition of ground beef with respect to different meat quality types, based on intensity profiles from isoelectric focusing of water-soluble proteins. Beef mixtures containing various amounts of mechanically recovered meat, head meat and… (More)
We adapt the Suffix Tree Clustering method for application within a corpus of Norwegian news articles. Specifically, suffixes are replaced with ngrams and we propose a new measure for cluster similarity as well as a scoringfunction for base-clusters. These modifications lead to substantial improvements in effectiveness and efficiency compared to the… (More)
We investigate document clustering through adaptation of Zamir and Etzioni’s approach to online web document clustering. Specifically we generalize the Suffix Tree Clustering method to allow for a wider range of clustering techniques. We apply the modified technique to a corpus of news articles improving precision by 29% while running 8% faster than the… (More)
Computer languages are usually lumped together into broad ’paradigms’, leaving us in want of a finer classification of kinds of language. Theories distinguishing between ’genuine differences’ in language has been called for, and we propose that such differences can be observed through a notion of expressive mode. We outline this concept, propose how it… (More)
We axiomatize, in first order logic, the typed feature structures used in constraint based grammar formalism for natural language processing. This is based on a discussion of how type-hierarchies should be interpreted in terms of representation theory. We close with some observations about decidability of feature constraint satisfaction in parsing.
The Compact Trie method for document clustering is sensitive to the kind of text it is applied to, but contains various parameters that may be tuned for adaptation to specific applications. We implement a genetic algorithm for optimizing these parameters and apply it to a corpus of texts to demonstrate the feasibility of using genetic algorithms for tuning.
We argue that the division operator in relational algebra is insufficiently equipped to handle all kinds of universal queries. This is a problem since division is widely regarded as the operational counterpart of universal quantification. Accordingly, research related to universal queries, for instance on query-optimization, is based on division. We propose… (More)