Computer Science – Computation and Language
Scientific paper
1997-11-19
Computer Science
Computation and Language
8 pages, uses: aclap.sty, epic.sty, put-inserts Paper presented at the ACL/EACL'97 Madrid Workshop on Computational Environmen
Scientific paper
The space and run-time requirements of broad coverage grammars appear for many applications unreasonably large in relation to the relative simplicity of the task at hand. On the other hand, handcrafted development of application-dependent grammars is in danger of duplicating work which is then difficult to re-use in other contexts of application. To overcome this problem, we present in this paper a procedure for the automatic extraction of application-tuned consistent subgrammars from proved large-scale generation grammars. The procedure has been implemented for large-scale systemic grammars and builds on the formal equivalence between systemic grammars and typed unification based grammars. Its evaluation for the generation of encyclopedia entries is described, and directions of future development, applicability, and extensions are discussed.
Bateman John A.
Henschel Renate
No associations
LandOfFree
Application-driven automatic subgrammar extraction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Application-driven automatic subgrammar extraction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Application-driven automatic subgrammar extraction will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-460532