Analysis of Algorithms for Phrase Recognition

Three algorithms, designed to recognize vowels, are analyzed for their complexity class or growth pattern. First a databank was prepared from vowel loops of Peterson and Barney (1952) which was used for vowel recognition. The above three algorithms produced the same vowel-recognition rate of more than 78% on a given short phrase. This paper submits the result of our analysis of the three algorithms to investigate their growth pattern and decide which of the three is the fastest in making decision of vowel recognition. The simple system of vowel recognition, presented in this paper, which leads to phrasal recognition, can serve the purpose of automatic recognition of short phrases in a long wire-tapped message. The phrasal recognition can be advantageous to do a preliminary study whether or not a wire-tapped long message contained phrases of interest. If it does the intelligence agent can get primed to scrutinize the entire message. This scheme can spare a lot of time of heavily loaded intelligence agent deputed to do wire-tapping