• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 3
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

PyAline: Automatically Growing Language Family Trees Using the ALINE Distance

Huff, Paul A. 22 November 2010 (has links) (PDF)
Several methods for determining a numerical distance between languages have been proposed in the literature. In this thesis I implement one of them, the ALINE distance, and develop a methodology for comparing its results with other language distance metrics. I then compare it with a leading distance metric, the LDND distance, proposed by the ASJP project.
2

Classifying Siyi Cantonese Using Quantitative Approaches

Tan, Yutian January 2017 (has links)
No description available.
3

Klasifikace dokumentů podle tématu / Document Classification

Marek, Tomáš January 2013 (has links)
This thesis deals with a document classification, especially with a text classification method. Main goal of this thesis is to analyze two arbitrary document classification algorithms to describe them and to create an implementation of those algorithms. Chosen algorithms are Bayes classifier and classifier based on support vector machines (SVM) which were analyzed and implemented in the practical part of this thesis. One of the main goals of this thesis is to create and choose optimal text features, which are describing the input text best and thus lead to the best classification results. At the end of this thesis there is a bunch of tests showing comparison of efficiency of the chosen classifiers under various conditions.

Page generated in 0.1288 seconds