This paper describes a grapheme-to-phoneme conversion method using phoneme connectivity and CCV conversion rules. The method consists of mainly four modules including morpheme normalization, phrase-break detection , morpheme to phoneme conversion and phoneme connectivity check. The morpheme normalization is to replace non-Korean symbols into standard Korean graphemes. The phrase-break detector ...

An extension of the disjoint set union problem is considered, where the extra primitive backtrack(i) can undo the last i unions not yet undone. Let n be the total number of elements in all the sets. A data structure is presented that supports each union and find in O(lognj loglogn) worst-case time and each backtrack(i) in 0(1) worst-case time, irrespective of i. The total space required by the ...

It is practically impossible to build a word-based lexicon for speech recognition in agglutinative languages that would cover all the relevant words. The problem is that words are generally built by concatenating several prefixes and suffixes to the word roots. Together with compounding and inflections this leads to millions of different, but still frequent word forms. Due to inflections, ambig...

We consider a Jackson network in which some of the nodes have an infinite supply of work: when all the customers queued at such a node have departed, the node will process a customer from this supply. Such nodes will be processing jobs all the time, so they will be fully utilized and experience a traffic intensity of 1. We calculate flow rates for such networks, obtain conditions for stability,...

Page Inter-reference Interval distribution, average page fault frequency (the frequency of those Instances at which an executing program requires a page of data or Instructions not In the main memory) average working set size and Inter-page fault-time (time between page fault) distribution for a simulated Working Set Replacement Algorithm for three typical programs with different sizes were mea...