The history of machine translation (MT) research at the University of Washington in Seattle from its beginnings in November, 1949 until June 30, 1958 has already been outlined in our previous Technical Report.1 This research, which was inspired by Dr. Warren Weaver's memorandum Translation2 of July 15, 1949, and which was in 1952 and 1953 supported by grants from the Rockefeller Foundation, has...

Lexicographical sorting is a fundamental problem with applications to contingency tables, databases, Bayesian networks, and more. A standard method to lexicographically sort general data is to iteratively use a stable sort – a sort which preserves existing orders. Here we present a new method of lexicographical sorting called QuickLexSort. Whereas a stable sort based lexicographical sorting alg...

In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only ones? If no, what do the infinite smooth words that are also Lyndon words look like? In this paper, we give the answer, proving that the only infinite smooth Lyndon words are m{a<b}, with a, b even, m{1<b} and ∆ −1 1 ...

The extension of mathematical morphology to colour, and more generally to multivariate image data, continues to be an open problem. As its underlying theory is defined in terms of complete lattices, the main challenge lies in introducing a complete lattice structure on the image intensity range, hence vectorial extrema computation methods are necessary. In this paper, we circumvent the need for...

LDV FORUM – Band 21(1) – 2006 Abstract Th is paper discusses the question to what extent lexicon exchange in MT has been standardized during the last years. Th e introductory section is followed by a brief description of OLIF2, a format specifi cally designed for the exchange of terminological and lexicographical data (Section 2). Section 3 contains an overview of the import/ export functionali...

Very recently, the second author showed that the question whether an equation over a trace monoid has a solution or not is decid-able 11,12]. In the original proof this question is reduced to the solv-ability of word equations with constraints, by induction on the size of the commutation relation. In the present paper we give another proof of this result using lexicographical normal forms. Our ...

In this paper, we present the results of the extension of the mathematical morphology to color images by treating multichannel data as vectors. The approach presented here uses the HSI and related color spaces (intuitives). A modification of the lexicographical order for vectorial processing is developed. The importance of this new method lies on automatic selection of elements of the HSI and r...

Edelsbrunner and Shah have proven that incremental topological ipping works for constructing a regular triangulation for a nite set of weighted points in d?dimensional space. This paper describes the lexicographical manipulations employed in a recently completed implementation of their method for correctly computing 3-dimensional regular triangulations. At the start of the execution of this imp...