Sökning: "Trie"
Visar resultat 1 - 5 av 9 uppsatser innehållade ordet Trie.
1. Multibit Trie For The Longest Matching Prefix Problem
Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskapSammanfattning : 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). LÄS MER
2. Spell checker for a Java Application
Kandidat-uppsats, Karlstads universitet/Institutionen för matematik och datavetenskap (from 2013)Sammanfattning : 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. LÄS MER
3. Lucifer och den performativa filmkonsten : En studie kring sataniska visioner i den kaliforniska filmvärlden
Master-uppsats, Södertörns högskola/LärarutbildningenSammanfattning : This study regards the influence of ’modern’ satanism on performative art in the nineteen sixties- and seventies. The methodological framework consists of performativity theory, religious visual culture and aesthetics of experimental film. LÄS MER
4. Efficient fuzzy type-ahead search on big data using a ranked trie data structure
Uppsats för yrkesexamina på avancerad nivå, Umeå universitet/Institutionen för fysikSammanfattning : 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. LÄS MER
5. Weighting Edit Distance to Improve Spelling Correction in Music Entity Search
Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : 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. LÄS MER