Please use this identifier to cite or link to this item:
|Title:||Evaluation and Comparison of Inferred Regular Grammars|
|Presented at:||9th International Colloquium on Grammatical Inference, St Malo, France, 22-24 September 2008|
|Citation:||Grammatical Inference: Algorithms and Applications, Proceedings of, 2008, Lecture Notes in Computer Science, 2008, 5278, pp. 252-265 (14)|
|Abstract:||The accuracy of an inferred grammar is commonly computed by measuring the percentage of sequences that are correctly classified from a random sample of sequences produced by the target grammar. This approach is problematic because (a) it is unlikely that a random sample of sequences will adequately test the grammar and (b) the use of a single probability value provides little insight into the extent to which a grammar is (in-)accurate. This paper addresses these two problems by proposing the use of established model-based testing techniques from the field of software engineering to systematically generate test sets, along with the use of the Precision and Recall measure from the field of information retrieval to concisely represent the accuracy of the inferred machine.|
|Rights:||Springer-Verlag Berlin, Heidelberg ©2008.|
|Description:||Metadata only entry|
|Appears in Collections:||Conference Papers & Presentations, Dept. of Computer Science|
Files in This Item:
There are no files associated with this item.
Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.