Unformatted text preview: 3. Given a string of letters Y = y 1 y 2 ... y n , a segmentation of Y is a partition of its letters into contiguous blocks of letters (also called words). Each word has a quality that can be computed by a given oracle (e.g. you can call quality("meet") to get the quality of the word "meet"). The quality of a segmentation is equal to the sum over the qualities of its words. Each call to the oracle takes linear time in terms of the argument; that is quality( S ) takes O ( | S | ) . Using the given oracle, give an algorithm that takes a string Y and computes a segmentation of maximum total quality. 1...
View Full Document
- Fall '08
- Algorithms, non-intersecting line segments, maximum total quality