Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-25T20:26:08.058Z Has data issue: false hasContentIssue false
  • English
  • Français

Efficient generation of random sentences

Published online by Cambridge University Press:  01 March 1996

MARK-JAN NEDERHOF
MARK-JAN NEDERHOF
Affiliation:
University of Groningen, Faculty of Arts, P.O. Box 716, 9700 AS Groningen, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

We discuss the random generation of strings using the grammatical formalism AGFL. This formalism consists of context-free grammars extended with a parameter mechanism, where the parameters range over a finite domain. Our approach consists in static analysis of the combinations of parameter values with which derivations can be constructed. After this analysis, generation of sentences can be performed without backtracking.

Type
Research Article
Information
Natural Language Engineering , Volume 2 , Issue 1 , March 1996 , pp. 1 - 13
Copyright
© 1996 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)