Essays about: "Trie"

Showing result 1 - 5 of 7 essays containing the word Trie.

  1. 1. Multibit Trie For The Longest Matching Prefix Problem

    University essay from Umeå universitet/Institutionen för datavetenskap

    Author : Karl Hed Dahlqvist; [2022]
    Keywords : Multibit trie; longest marching prefix problem; CIDR; IP lookup;

    Abstract :  With the ever growing forwarding tables of the internet and the large amount of traffic that flows through them, efficient algorithms to handle search are needed. One of these algorithms is the Multibit trie (prefix tree). READ MORE

  3. 2. Spell checker for a Java Application

    University essay from Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)

    Author : Arvid Viktorsson; Illya Kyrychenko; [2020]
    Keywords : Spellchecker; Java; Trie; edit distance; Soundex; damerau; levenshtein;

    Abstract : Many text-editor users depend on spellcheckers to correct their typographical errors. The absence of a spellchecker can create a negative experience for the user. In today's advanced technological environment spellchecking is an expected feature. READ MORE

  4. 3. Efficient fuzzy type-ahead search on big data using a ranked trie data structure

    University essay from Umeå universitet/Institutionen för fysik

    Author : John Bergman; [2018]
    Keywords : Approximate string matching; Fuzzy search; Type-ahead search; String similarity;

    Abstract : The efficiency of modern search engines depends on how well they present typo-corrected results to a user while typing. So-called fuzzy type-ahead search combines fuzzy string matching and search-as-you-type functionality, and creates a powerful tool for exploring indexed data. READ MORE

  5. 4. Weighting Edit Distance to Improve Spelling Correction in Music Entity Search

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Axel Samuelsson; [2017]
    Keywords : Spelling correction; edit distance; search; music; spotify; trie; Damerau; Levenshtein;

    Abstract : This master’s thesis project undertook investigation of whether the extant Damerau- Levenshtein edit distance measurement between two strings could be made more useful for detecting and adjusting misspellings in a search query. The idea was to use the knowledge that many users type their queries using the QWERTY keyboard layout, and weighting the edit distance in a manner that makes it cheaper to correct misspellings caused by confusion of nearer keys. READ MORE

  6. 5. Phonotactic Structures in Swedish : A Data-Driven Approach

    University essay from Stockholms universitet/Institutionen för lingvistik

    Author : Felix Hultin; [2017]
    Keywords : Phonotactics; computational phonology; trie; finite automata; pattern matching; regular languages; Fonotax; beräkningsbar fonologi; trie; ändlig automat; mönstermatchning; reguljära språk;

    Abstract : Ever since Bengt Sigurd laid out the first comprehensive description of Swedish phonotactics in 1965, it has been the main point of reference within the field. This thesis attempts a new approach, by presenting a computational and statistical model of Swedish phonotactics, which can be built by any corpus of IPA phonetic script. READ MORE