| { | |
| "paper_id": "C65-1014", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T13:12:22.190732Z" | |
| }, | |
| "title": "", | |
| "authors": [ | |
| { | |
| "first": "Sheldon", | |
| "middle": [], | |
| "last": "Klein", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "A system that is to serve as a vehicle for testing models of language change is being programmed in jOVIAL. Inherent in the design of the system is the requirement that each member of a speech community be represented by a generation grammar and a recognition grammar. The units of interaction in a simulation are conversations. Grammar rules may be borrowed or lost by individuals during the course of a simulation. The rules themselves need not be limited to those suggested by a particular theory of lanquaqe; also, they may refer to any or all levels of linguistic phenomena. Extralinquistic factors pertinent to language change may be incorporated in simulations.", | |
| "pdf_parse": { | |
| "paper_id": "C65-1014", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "A system that is to serve as a vehicle for testing models of language change is being programmed in jOVIAL. Inherent in the design of the system is the requirement that each member of a speech community be represented by a generation grammar and a recognition grammar. The units of interaction in a simulation are conversations. Grammar rules may be borrowed or lost by individuals during the course of a simulation. The rules themselves need not be limited to those suggested by a particular theory of lanquaqe; also, they may refer to any or all levels of linguistic phenomena. Extralinquistic factors pertinent to language change may be incorporated in simulations.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "A general simulation system which is to serve as a device for testing of hypotheses about language change through time is being program~ned in JOVIAL, an ALGOL language, and is partially operation-1 a! on the Philco computer (4) .", | |
| "cite_spans": [ | |
| { | |
| "start": 225, | |
| "end": 228, | |
| "text": "(4)", | |
| "ref_id": "BIBREF3" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The Simulation System", | |
| "sec_num": "1.0" | |
| }, | |
| { | |
| "text": "The A basic assumption of the simulation system is that the interaction among members of a speech community is the prime 1This research is supported in part by Grant ~4}{-07722, National Institutes of Health, United States Public Health Services (to the Carnegie Institute of Technology). member increases.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The Simulation System", | |
| "sec_num": "1.0" | |
| }, | |
| { | |
| "text": "More complex functions pertaining to particular socio-cultural conditions might also be used.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The Simulation System", | |
| "sec_num": "1.0" | |
| }, | |
| { | |
| "text": "Other functions might control the deletion of infrequently used grammar rules, or the shift of a grammar rule from a recognition qrammar to a qeneration qrammar. .01", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The Simulation System", | |
| "sec_num": "1.0" | |
| }, | |
| { | |
| "text": "6. Status of speaker x after speaking to auditor y:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The Simulation System", | |
| "sec_num": "1.0" | |
| }, | |
| { | |
| "text": "Statust(x) = Statust.i(x) -(Statust.l(x) -otatus~_](v)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "The Simulation System", | |
| "sec_num": "1.0" | |
| }, | |
| { | |
| "text": "Functions Table 2 Klein i0.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 10, | |
| "end": 17, | |
| "text": "Table 2", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "5[", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The simulation begins at time T0, 1 rather than at time T0, 0 for initialization purposes:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5[", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "T0,1", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5[", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The monitor selects }&~RY as speaker for the 0 cycle, and ~L%RY's new s~atus is now computed as:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5[", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "examines", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5[", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": ".7-(.7-.4)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5[", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": ": .64 5", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5[", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The monitor has exhausted the list of candidates for auditor and a new speaker must be selected randomly.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "5[", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Let PETER be selected as the new speaker.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "'~71,0", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Assume that IOHN and ~LiRY are rejected as auditors, but that HELEN is accepted:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "'~71,0", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "G(E, F)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "'~71,0", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Rule E is inHELEN's recognition grammar and its new weight is: The~weiqht:.of rule F is computed as:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "'~71,0", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": ". .O7-(,O7 -.5) -, ..~6", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "'~71,0", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Accordingly, rule B enters BABY's generation grammar.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "\"\"", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "Rules E and F must be borrowed from PETER, and each enters ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "\"\"", | |
| "sec_num": "5" | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": { | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "Automatic Paraphrasing in Essay Format. Mechanical Translation", | |
| "authors": [ | |
| { | |
| "first": "S", | |
| "middle": [], | |
| "last": "Klein", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Klein, S. Automatic Paraphrasing in Essay Format. Mechanical Translation. In press,", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "Control of Style with a Generative Grammar", | |
| "authors": [ | |
| { | |
| "first": "S", | |
| "middle": [], | |
| "last": "Klein", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Klein, S. Control of Style with a Generative Grammar. Language. In press,", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "Dynamic Simulation of Historical Change in Language Using Monte Carlo Techniques. SP-1908, System Develo3ment Corporation", | |
| "authors": [ | |
| { | |
| "first": "S", | |
| "middle": [], | |
| "last": "Klein", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1984, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Klein, S. Dynamic Simulation of Historical Change in Language Using Monte Carlo Techniques. SP-1908, System Develo3ment Corporation, Santa Monica, December 1984.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "New York: Harcourt, Brace", | |
| "authors": [ | |
| { | |
| "first": "E", | |
| "middle": [], | |
| "last": "Sapir", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Language", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1921, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Sapir, E. Language. New York: Harcourt, Brace, 1921.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "uris": null, | |
| "type_str": "figure", | |
| "text": "basic assumptions about the nature of language change inherent in the design of the Program include the notion of generation grammar, Bloomfield's concept of speech community (i), and Sapir's concept of genetic drift (5). Aside from these built in concepts, the program is designed as a vehicle for testing models of language change as a function of variables selected at the discretion of an experimenter. It is intended that the simulation system be sufficiently flexible to work with either transformational or stratificational models of language; to simulate the interaction of members of a speech community among themselves and with members of other communities; to model special relations among particular members, e.g. family groups and social classes; to simulate multilanguage acquisition; and to model the transmission of language from generation to generation.", | |
| "num": null | |
| }, | |
| "FIGREF1": { | |
| "uris": null, | |
| "type_str": "figure", | |
| "text": "program thai determines the flow of the simulation and the passage of time, and that periodically takes a census to inform the experimenter of the changes occuring at various stages of the simulation. The first version of the simulation system is being constructed around the author's automatic essay paraphrasing system (2) which produces essaylike paraphrases of an input consisting of a restricted English text and an outline of the desired output essay. The syntactic style of the output is controlled by manipulation of parameters pertaininq to the frequency of usage of specific generation grammar rules (3). The table of functional relationships thai contains the definition of a particular model of language change might include rules expressing such features as: i. Members of the same social group are more likely to speak to each other than.to members of other groups. 2. Each time an individual interacts with a particular member of the community the probability of future interactions with thai", | |
| "num": null | |
| }, | |
| "FIGREF3": { | |
| "uris": null, | |
| "type_str": "figure", | |
| "text": "2 contains the list of active rules refered to by the monitor during the course of the simulation. All computed values qreater than or equal to 1 are rounded to .99; values computed at less than or equal to 0 are rounded to .01~ in all cases, computed values are rounded to the second decimal place. !. Probability of x speaking to y: Psi(X,y) = .I /Stalust.i(x) -staiusi.!(y) / 2. Frequency weight of recognition rule m at time t after use in parsing: Frequency of rule not used in parsing at time t: Fi(m) = Fi.l(m) -.02 4. Threshold frequency weight for adding or removing a rule from a qeneration grammar:.i Threshold frequency weight for removing rule from a recognition gramma r :", | |
| "num": null | |
| }, | |
| "FIGREF5": { | |
| "uris": null, | |
| "type_str": "figure", | |
| "text": "The rules not used in the parsing are each decremented by .02 .PETER's new status is:The preceding hand S'imulation should be sufficient to illustrate the operation of the simulation system.Anticipatedcomputer simulations will involve 50 to 100 individuals, each associated with several<hundred grammar rules, iUnique ~ parsings can be obtained by using 6xistinq frequency weights to determine preferential applicability of 'rules. The functions contained in table 2 can be qreatly extended in number and content. One miqht wish to add special rules for interaction between :parent ,'and Child, spouses, and among members of the same age'group, etc., plus a mechanism for determining the birth and death of various members. The status factor might be divided into weights refering to social status, aqe, geographical proximity and the like. The ideal test of the validity of a simulation is prediction. Hopefully, one miqht predict an attested state of a language from a model of an attested earlier stage. A major problem in such testing may be i i~.xlreme sensitivity of a model to the choice of parameter values and constants. For example, the constants in the functions of table 2 seem to have the effect of making BABY learn too quickly. One might use a higher rate of decay for unused Klein 15. rules to decrease the learning rate. The need for trial and error manipulation of values will increase with the complexity of a model. Accordingly, one might start with simple models, increasing the complexity by stages. The author's immediate research goal is to produce a stability simulation involving about 50 members,each associated with a simple phrase structure gra~nar of ~ ~nqmish, over a time span of 3 or 4 qenerations--a simulation in which the language at the start of the simulation is reasonably similar to the language existing at the conclusion.", | |
| "num": null | |
| }, | |
| "TABREF2": { | |
| "content": "<table/>", | |
| "html": null, | |
| "text": "", | |
| "num": null, | |
| "type_str": "table" | |
| }, | |
| "TABREF4": { | |
| "content": "<table><tr><td/><td/><td/><td/><td>Klein</td><td>13.</td></tr><tr><td/><td colspan=\"2\">.3 -.(,3</td><td colspan=\"2\">-.4)</td><td>-.32</td></tr><tr><td/><td/><td/><td>5</td></tr><tr><td>TI,I</td><td/><td/><td/></tr><tr><td colspan=\"5\">Assume HER},t%N is picked as PETER's next auditor, and PETER</td></tr><tr><td>says :</td><td/><td/><td/></tr><tr><td/><td colspan=\"2\">G(SB, F)</td><td/></tr><tr><td colspan=\"5\">Rule B is in HEF\u00a34AN's grammar and its new frequency weight is:</td></tr><tr><td/><td colspan=\"3\">.53 -(.53 ,,,,,</td><td>-.75)</td><td>-</td><td>.57</td></tr><tr><td/><td/><td/><td/><td>5</td></tr><tr><td colspan=\"3\">Rule F is borrowed</td><td colspan=\"2\">from PETER's grammar and enters</td><td>HER~AN's generation</td></tr><tr><td colspan=\"4\">grammar with a value:</td></tr><tr><td/><td colspan=\"4\">0 -(0 -.25) : .05</td></tr><tr><td/><td/><td>5</td><td/></tr><tr><td>HER~N's</td><td colspan=\"4\">unused rules are each decremented by .02 .</td><td>PETER's new</td></tr><tr><td colspan=\"2\">status is :</td><td/><td/></tr><tr><td/><td>.32</td><td colspan=\"2\">-[.32</td><td>-.6)</td><td>-.38</td></tr><tr><td/><td/><td/><td/><td>5</td></tr><tr><td>TI,2</td><td/><td/><td/></tr><tr><td colspan=\"5\">Assume the monitor determines BABY</td><td>to be the next auditor, and</td></tr><tr><td colspan=\"4\">that PETER generates:</td></tr><tr><td/><td colspan=\"3\">@(2B, E,F)</td></tr><tr><td colspan=\"5\">Rule B is in BABY's. recognition grammar and it's new weight is:</td></tr><tr><td>06</td><td>-(.06</td><td colspan=\"2\">-.5)</td><td>-.15</td></tr><tr><td/><td/><td>5</td><td/></tr><tr><td colspan=\"5\">and after function 4 of table 2, \u00a3 enters her generation grammar.</td></tr></table>", | |
| "html": null, | |
| "text": "'s unused rules are decremented by .02 .PETER's new status is:", | |
| "num": null, | |
| "type_str": "table" | |
| } | |
| } | |
| } | |
| } |