This paper describes new and improved techniques which help a unification-based parser to process input efficiently and robustly. In combination these methods result in a speed-up in parsing time of more than an order of magnitude. The methods are correct in the sense that none of them rule out legal rule applications.
CITATION STYLE
Kiefer, B., Krieger, H.-U., & Nederhof, M.-J. (2000). Efficient and Robust Parsing of Word Hypotheses Graphs (pp. 280–295). https://doi.org/10.1007/978-3-662-04230-4_20
Mendeley helps you to discover research relevant for your work.