GLR parsing of word lattices using a beam search method
Author(s) -
Steffen Staab
Publication year - 1995
Publication title -
cornell university
Language(s) - English
Resource type - Conference proceedings
DOI - 10.22028/d291-25266
Subject(s) - parsing , computer science , artificial intelligence , computation , word (group theory) , natural language processing , beam search , process (computing) , speech recognition , hidden markov model , speech processing , algorithm , search algorithm , programming language , mathematics , geometry
The process of understanding spoken language requires the efficient processing of ambiguities that arise by the nature of speech. This paper presents an approach that allows the efficient incremental integration of speech recognition and language understanding using Tomita´s generalized LR-parsing algorithm. For this purpose the GLR-lattice-parsing-algorithm is revised so that an agenda mechanism can be used to control the flow of computation of the parsing process. Subsequently the HMM-evaluations of the word models are combined with a stochastical language model to do a beam search similar to where chartparsers are used to do the job.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom