Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars

The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results imply that the study and optimisation of unification-based parsing must rely on empirical data until complexity theory can more accurately predict the practical behaviour of such parserQ.

• Type: Conference
• Year: 1994
• Where: ACL
• Authors: John Carroll
• Keywords: ACL 1994, ACL 2007, Exponential Complexities, Unification-based Parsing, Unification-based Parsing Algorithms