Festschrift der Universität Kiel zur feier des geburtsfestes Seiner Majestät des kaisers und königs Wilhelm II. Der álteste botanische garten Kiels. Urkundliche darstellung der begründung eines universitäts-instituts im siebzehnten jahrhundert.

Mode of access: Internet.

Festschrift des Münchener altertums-vereins zur erinnerung an das 50jähr. jubiläum.

Mode of access: Internet.

Beiträge zur wissenschaftlichen Medicin und Chemie; Festschrift zu Ehren des sechszigsten Geburtstages von Ernst Salkowski.

Mode of access: Internet.

Jüdische Volkskunst in Hessen : Festschrift der Sinai-Loge zu Kassel : herausgegeben aus Anlass ihres 40jährigen Bestehens

von Rudolf Hallo

On the relations and differences between Popper dimension, exclusion dimension and VC-Dimension

A high-level relationPopper dimension—( Exclusion dimension—( VC dimension—( between Karl Popper’s ideas on “falsifiability of scientific theories” and the notion of “overfitting”Overfitting in statistical learning theory can be easily traced. However, it was pointed out that at the level of technical details the two concepts are significantly different. One possible explanation that we suggest is that the process of falsification is an active process, whereas statistical learning theory is mainly concerned with supervised learningSupervised learning, which is a passive process of learning from examples arriving from a stationary distribution. We show that concepts that are closer (although still distant) to Karl Popper’s definitions of falsifiability can be found in the domain of learning using membership queries, and derive relations between Popper’s dimension, exclusion dimension, and the VC-dimensionVC dimension.

Herbert Leiser Collection 1932-1946

Zeitschrift K.C. Blaetter (1932-1933); Festschrift of K.C., New York, 1946; Literaturwegweiser fuer den K.C., Berlin 1926; Hochschulhefte, 1921; misc. printings and publications of the K.C. including fraternity postcards with logos; clipping about the voyage of ship to St. Louis (1939).

Linguistic grammars with very low complexity

We have presented an overview of the FSIG approach and related FSIG gram- mars to issues of very low complexity and parsing strategy. We ended up with serious optimism according to which most FSIG grammars could be decom- posed in a reasonable way and then processed efficiently.

Two bracketing schemes for the Penn Treebank

The trees in the Penn Treebank have a standard representation that involves complete balanced bracketing. In this article, an alternative for this standard representation of the tree bank is proposed. The proposed representation for the trees is loss-less, but it reduces the total number of brackets by 28%. This is possible by omitting the redundant pairs of special brackets that encode initial and final embedding, using a technique proposed by Krauwer and des Tombe (1981). In terms of the paired brackets, the maximum nesting depth in sentences decreases by 78%. The 99.9% coverage is achieved with only five non-top levels of paired brackets. The observed shallowness of the reduced bracketing suggests that finite-state based methods for parsing and searching could be a feasible option for tree bank processing.

Eredu latindarraren eragina euskal deklinabidearen XIX. mendeko deskribapenetan

R. Etxepare, R. Gómez & J. A. Lakarra (arg.), Beñat Oihartzabali Gorazarre - Festschrift for Bernard Oyharçabal. Donostia-San Sebastián: Gipuzkoako Foru Aldundia & UPV/EHU.