Modification of Earley's algorithm for speech recognition
Proceedings of the NATO Advanced Study Institute on Recent advances in speech understanding and dialog systems
Directed hypergraphs and applications
Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Incremental construction and maintenance of minimal finite-state automata
Computational Linguistics
Parsing N Best Trees from a Word Lattice
KI '97 Proceedings of the 21st Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics
Computational Linguistics
Estimation of stochastic context-free grammars and their use as language models
Computer Speech and Language
| Hi-index | 0.00 |
Context-Free Grammars play an important role in the pattern recognition research community. Word graphs provide a compact representation of the ambiguous alternatives generated during many pattern recognition, machine translation and other NLP tasks. This paper generalizes the framework for string parsing based on semirings and hypergraphs to the case of lattice parsing. This framework is the basis for the implementation of a parsing interface in a dataflow software architecture where modules send and receive word graphs in a serialized form using a protocol which allows the easy generation, filtering and parsing of word graphs. An implementation of the CYK algorithm is presented as an example. Experimental results are reported to demonstrate the proposed method.