Query Details
| Query Subject: |
debugging computational grammars
|
|
| Author: | Alberto Lavelli | |
| Submitter Email: | click here to access email | |
| Linguistic LingField(s): |
Computational Linguistics
|
|
| Query: |
Dear colleagues,
I'm looking for references to the problem of developing and debugging computational grammars for natural languages. I'm particularly interested in tools and approaches used in debugging grammars (particularly in their use when dealing with relatively large hand-written grammars). In the computational systems I'm aware of, usually there is only a limited (and standard) set of debugging tools: tracers, steppers, chart browsers. Furthermore, does anybody know any extensive study on the most suitable strategies/tools to cope with the writing/testing/debugging cycle (always with a particular emphasis on debugging)? I know that there have been hints to this problem in related areas (e.g., the EU projects TSNLP and DiET, some papers at the ACL-EACL97 workshop on Computational Environments for Grammar Development and Linguistic Engineering) but it seems to me that this topic has so far received little attention. But perhaps I'm missing some relevant contributions and so I'm asking for your help. Apart from references to relevant stuff, I'm also interested in your general opinion on the issue. Is this (alleged) lack of interest an indication of the fact that such issue is in your opinion not particularly relevant? I'll post a summary if I receive enough responses best alberto |
|
| LL Issue: | 10.1395 | |
| Date posted: | 23-Sep-1999 | |
|
Back |
||
|
|
||
|
Sums main page
|
||
|
About LINGUIST
|
Contact Us
|
Report Broken Link
While the LINGUIST List makes every effort to ensure the linguistic relevance of sites listed on its pages, it cannot vouch for their contents. |
|
