ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Mapping between subtitle units in movie subtitles: Design of an efficient method by using search algorithms and semantic analysis

Gregor Kališnik (2012) Mapping between subtitle units in movie subtitles: Design of an efficient method by using search algorithms and semantic analysis. EngD thesis.

[img]
Preview
PDF
Download (1387Kb)

    Abstract

    In this bachelor thesis I have developed a solution for the mapping problem between two different subtitles for a movie or episode of a series by using algorithms for finding shortest paths. I have narrowed the search space with classifiers and semantic analysis. Maps can be used for building aligned corpora, adjusting subtitles to different movie releases and finally for clustering subtitles into groups of replaceable subtitles. Developed method is in most cases usable in practice. With properly configured settings the method achieves F score of 88.83% while it's time efficient and more useful in practice version has F score of 72.64%.

    Item Type: Thesis (EngD thesis)
    Keywords: search algorithms, classifiers, SVM, decision tree, greedy search, A*, subtitles for movies and episodes of series
    Number of Pages: 61
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    akad. prof. dr. Ivan Bratko77Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=00009454932)
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 1869
    Date Deposited: 25 Sep 2012 14:09
    Last Modified: 19 Oct 2012 13:16
    URI: http://eprints.fri.uni-lj.si/id/eprint/1869

    Actions (login required)

    View Item