Effective natural language parsing with probabilistic grammars

Paweł Skórzewski · Proceedings of the International Multiconference on Computer Science and Information Technology · 2010

This paper presents an example of application of a PCFG parsing algorithm based on the A* search procedure in a machine translation system. We modified the existing CYK-based parser used in the machine translation system Translatica and applied the A* parsing algorithm in order to improve the performance of the parser.

Read the paper · More papers on PaperTik