Redundancy-free Island Parsing of Word Graphs

Kiefer, Bernd

Redundancy-free Island Parsing of Word Graphs

Download BibTeX Cite

Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1079-1083.

Abstract

Island parsing is a bidirectional parsing strategy mostly used in speech analysis, as well as in applications where robustness is highly relevant and/or processing resources are limited. Although there exists an efficient redundancy-free island parsing algorithm for string input, it has not yet been applied to word graph input, an application which is central for speech analysis systems. This paper describes how the established algorithm can be generalized from string input to word graphs, increasing its flexibility by integrating the selection of island seeds into the search process inherent to parsing.

Bernd Kiefer. 2005. Redundancy-free Island Parsing of Word Graphs. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05. IJCAI, 1079–1083. https://ijcai.org/proceedings/2005/123

@inproceedings{ijcai2005p123,
  title     = {Redundancy-free Island Parsing of Word Graphs},
  author    = {Kiefer, Bernd},
  booktitle = {Proceedings of the Nineteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-05}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  pages     = {1079--1083},
  year      = {2005},
  url       = {https://ijcai.org/proceedings/2005/123},
}

TY  - CPAPER
TI  - Redundancy-free Island Parsing of Word Graphs
AU  - Kiefer, Bernd
T2  - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05
PB  - International Joint Conferences on Artificial Intelligence
PY  - 2005
SP  - 1079
EP  - 1083
UR  - https://ijcai.org/proceedings/2005/123
ER  -