onr:"swepub:oai:DiVA.org:umu-182984"
Search: onr:"swepub:oai:DiVA.org:umu-182984" > Faster Computation ...
- 1 of 1
- Previous record
- Next record
- To hitlist
Faster Computation of N-Best Lists for Weighted Tree Automata
-
- Björklund, Johanna, 1961- (author)
- Umeå universitet,Institutionen för datavetenskap
-
- Drewes, Frank (author)
- Umeå universitet,Institutionen för datavetenskap
-
- Jonsson, Anna (author)
- Umeå universitet,Institutionen för datavetenskap
- (creator_code:org_t)
- English.
- Other publication (other academic/artistic)
Abstract
Subject headings
Close
- We show that a previously proposed algorithm for the N-best trees problem – not to be confused with the easier N-best runs problem – can be made more efficient by changing how it arranges and explores the search space. Given an integer N and a weighted tree automaton (wta) M over the tropical semiring, the algorithm computes N trees of minimal weight with respect to M. Compared to the original algorithm, the modifications increase the laziness of the evaluation strategy, which makes the new algorithm asymptotically more efficient than its predecessor.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Keyword
- N-best lists
- weighted tree automata
- tropical semiring
Publication and Content Type
- vet (subject category)
- ovr (subject category)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Björklund, Johan ...
- Drewes, Frank
- Jonsson, Anna
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- and Computer Science ...
- By the university
- Umeå University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
