[□=□] □
[tag=□] □
[word=□] □
For example , a word sense disambiguation algorithm may use the output of a tokenizer , a part-of-speech tagger , a phrase boundary recognizer , and a module that classifies noun phrases into semantic categories . SALT markup : The main elements of SALT are [ 1 ] <prompt> for configuring the speech synthesizer and playing out prompts ; [ 2 ] <reco> for configuring the speech recognizer , executing recognition , and handling recognition events ; [ 3 ] <grammar> for specifying input grammar resources ; [ 4 ] <bind> for processing recognition results into the page These elements are activated either declaratively or programmatically under script running on the client device . Input data is simple ( the Coxeter matrix or a Cartan matrix ) , the word recognizer can be constructed geometrically , and multiplication of a ShortLex word on the right by a generator can be done in a simple right-to-left scan of the word . Included improvements offered : an improved Out-of-Vocabulary filter ; barge-in and end-of-speech detection ; confidence scoring ; and increased speech recognizer search speedup . Apparently there is some bottom-up tree recognizer active that signals the applicability of a peephole optimization rule and then tests the attributes to see if the peephole optimization rule really applies .