Abstract
AbstractThe area of grammar engineering has been a central and active field in computational linguistics. One of the formal frameworks used for the development of computational grammars for a large variety of languages is lexical functional grammar (LFG). This article first introduces the formal and computational foundations of LFG by presenting the correspondence architecture via which the central linguistic representations of LFG, c‐structure and f‐structure, are linked, and it addresses the computational complexity of LFG parsing. In the second half, it gives an overview over work in LFG‐based grammar engineering, focusing on techniques aimed at facilitating multilingual grammar development and ambiguity management.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
