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. |
Year | Venue | Keywords |
---|---|---|
2005 | IJCAI | speech analysis,established algorithm,bidirectional parsing strategy,efficient redundancy-free island,island parsing,word graph,speech analysis system,word graph input,island seed,string input,redundancy-free island |
Field | DocType | Citations |
Top-down parsing language,Top-down parsing,S-attributed grammar,Computer science,Bottom-up parsing,Robustness (computer science),Redundancy (engineering),Natural language processing,Artificial intelligence,Parser combinator,Parsing | Conference | 0 |
PageRank | References | Authors |
0.34 | 6 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bernd Kiefer | 1 | 194 | 25.67 |