An efficient augmented-context-free parsing algorithm
Computational Linguistics
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Parsing spoken language: a semantic caseframe approach
COLING '86 Proceedings of the 11th coference on Computational linguistics
Improvement of the LR parsing table and its application to grammatical error correction
Information Sciences—Applications: An International Journal
Yet another chart-based technique for parsing ill-formed input
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
The intersection of finite state automata and definite clause grammars
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Bi-directional LR parsing from an anchor word for speech recognition
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
A spoken language translation system: SL-trans2
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Interactive speech understanding
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
A spoken language translation system: SL-trans2
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
Interactive speech understanding
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 3
A formal frame for robust parsing
Theoretical Computer Science - Implementation and application of automata
Beyond PDP: the frequency modulation neural network architecture
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Challenges of massive parallelism
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Robust parsing using dynamic programming
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
PARSEC: a structured connectionist parsing system for spoken language
ICASSP'92 Proceedings of the 1992 IEEE international conference on Acoustics, speech and signal processing - Volume 1
| Hi-index | 0.00 |
This paper describes a method to parse and understand a "noisy" sentence that possibly includes errors caused by a speech recognition device. Our parser is connected to a speech recognition device which takes a continuously spoken sentence in Japanese and produces a sequence of phonemes. The output sequence of phonemes can quite possibly include errors: altered phonemes, extra phonemes and missing phonemes. The task is to parse the noisy phoneme sequence and understand the meaning of the original input sentence, given an augmented context-free grammar whose terminal symbols are phonemes. A very efficient parsing method is required, as the task's search space is much larger than that of parsing un-noisy sentences. We adopt the generalized LR parsing algorithm, and a certain scoring scheme to select the most likely sentence out of multiple sentence candidates. The use of a confusion matrix, which is created in advance by analyzing a large set of input/output pairs, is discussed to improve the scoring accuracy. The system has been integrated into CMU's knowledge-based machine translation system.