ACL-OCL / Base_JSON /prefixJ /json /J75 /J75-4006.json
Benjamin Aw
Add updated pkl file v3
6fa4bc9
{
"paper_id": "J75-4006",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T02:40:35.563775Z"
},
"title": "Related Courant Institute Publicati~ns",
"authors": [
{
"first": "J",
"middle": [
"C"
],
"last": "M U Z I O ,",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Y",
"middle": [
"N"
],
"last": "Patt, N O R T H Carolina",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "J",
"middle": [
"P"
],
"last": "Deschamps",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "G",
"middle": [],
"last": "Metze",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "H",
"middle": [
"T"
],
"last": "Mouftah",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Stanislaw",
"middle": [],
"last": "Janusz",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Instytut",
"middle": [],
"last": "Bien",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Matematycznych",
"middle": [],
"last": "Maszyn",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Palac",
"middle": [],
"last": "Uniwer S Y T E T U Warzawskiego",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Kultury",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Januoz",
"middle": [],
"last": "Bien",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Witold",
"middle": [],
"last": "Stanla~aw",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Stanislaw",
"middle": [],
"last": "Lukaszewicz",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Szpakowicz",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Janusz",
"middle": [],
"last": "Bien",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Witold",
"middle": [],
"last": "Stanislaw",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Stanislaw",
"middle": [],
"last": "&ukaszewicz",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Stanislaw",
"middle": [],
"last": "Tukaszewicz",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Karol",
"middle": [],
"last": "Grabaki",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Josef",
"middle": [
"Walczak"
],
"last": "Koczy",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "",
"middle": [],
"last": "Ei",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Jerry",
"middle": [
"I )"
],
"last": "Gibson",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Stephen",
"middle": [
"K"
],
"last": "Jones",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "James",
"middle": [
"L"
],
"last": "Melsa",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Frank",
"middle": [],
"last": "Dwrflinger Insfirur Fuer Lnformatik",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Vniversitaer",
"middle": [],
"last": "Siurzgart",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Stultgart",
"middle": [
"I"
],
"last": "Germany",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Jarmila",
"middle": [],
"last": "Panevova",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Naomi",
"middle": [],
"last": "Sager",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Ralph",
"middle": [],
"last": "Grishman",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Jacques",
"middle": [],
"last": "Chauche",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "J",
"middle": [],
"last": "Chawhe",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Antonin",
"middle": [],
"last": "Rina",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Svatava",
"middle": [],
"last": "Machova",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Thomas",
"middle": [
"R"
],
"last": "Hofmann",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Petr",
"middle": [
"Jirku"
],
"last": "Mothema~icol",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Yorick",
"middle": [],
"last": "Wil",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Roger",
"middle": [
"C"
],
"last": "Schank",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Neil",
"middle": [
"M"
],
"last": "Coldman",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Charles",
"middle": [
"J"
],
"last": "Rieger",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Christopher",
"middle": [
"K"
],
"last": "Riesbeck",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Siegfried",
"middle": [],
"last": "Ttea",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "William",
"middle": [],
"last": "Stailings Honeywell",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Stuart",
"middle": [
"C"
],
"last": "Shapiro",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Awiel",
"middle": [],
"last": "Rmeafeld",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Robert",
"middle": [
"L"
],
"last": "Schiffman",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Short word dictionary, ch. 375 words Word class and word subclass definitions, 65 pp (S.P.R. 9) Research materials: Abou';ld,dOd lines of machine readable texts from journal literature, mainly in Pharmacology Text serialization and concordance program 2000 word science dictionary which works with parser 10000 word science dictionary which w6r,ks with parser (needs updating) Inverse dictionaries (words listed by subclasses)",
"pdf_parse": {
"paper_id": "J75-4006",
"_pdf_hash": "",
"abstract": [
{
"text": "Short word dictionary, ch. 375 words Word class and word subclass definitions, 65 pp (S.P.R. 9) Research materials: Abou';ld,dOd lines of machine readable texts from journal literature, mainly in Pharmacology Text serialization and concordance program 2000 word science dictionary which works with parser 10000 word science dictionary which w6r,ks with parser (needs updating) Inverse dictionaries (words listed by subclasses)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "I n Bolc L . ( e d . ) . Zastosowanie maszyn matematycznych d o b a d a n nad j e z y k i e m n a t u r a l n y m , p p 1 4 5 -1 5 4 .",
"cite_spans": [
{
"start": 13,
"end": 22,
"text": "( e d . )",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Gubrynowicz, Tuszard. ocena parametzo widmowych dzwiekow samo-gZoskowych metoda p r z e j s c p r z e z z e r o . ( E v a l u a t i o n o f s p e ctrum parameters for vowel sounds b y means of z e r o -c r o s s i n g meth6d. I n P o l i s h . )",
"sec_num": null
},
{
"text": "I n Bolc L . ( e d , ) . Zastosowanie maszyn rnatematycznych do badan nad jegykiem n a t u r a l n y m , p p 174-179.",
"cite_spans": [
{
"start": 13,
"end": 22,
"text": "( e d , )",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Jassem, Wiktor, Miroszaw Krzysko and Andrzej Dyczkowski. I d e n t yf i k a c j a grosow na podstawie c z e s t o t l i w o s c i formantow samo-gZoskowych p r z y z a s t o s o w a n i u f u n k c j i d y s k r y m i n a c y j n y c h Anders o n a . ( V o i c e i d e n t i f i c a t i o n on t h e b a s i s o f vowel formant Prequencies b y means of A n d e r s o n ' s d i s c r i m i n a t i o n f u n c t i o n s . I n P o l i s h . )",
"sec_num": null
},
{
"text": "B i u l e t y n P o l s k i e g o Towarz y s t w a Jezykoznawczego z. X X X I I , 1 9 7 4 , 159-1.71.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jassem, Wiktor, Katarzyna Kudela-Dobrogowska. I n w a r i a n t y w przeb i e g a c h parametru F O . ( I n v a r i a n t s o f t h e i n t o n a t i o n c u r v e . I n P o l i s h , summary i n E n g l i s h . )",
"sec_num": null
},
{
"text": "I n Bolc L. (ed.) Zastosowanie maszyn matematycznych do badan nad fezpklem n a t u r a l n y m , p p 111-120.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kacprowski, Janusz. ~k u s t y c z n y sygnaz mowy w k o m u n i k a c j i cz-Jowiek-maszyna. ( A c o u s t i c s p e e c h s i g h a l i n man-machine communi c a t i o n . I n P o l i s h . )",
"sec_num": null
},
{
"text": "Kaniuka WZadysLaw. 0 l i n g w i s t y c z n y c h a s p e k t a c h przekzadu maszyn-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kaczmarek, Zygmunt, and Wiktor Krzysko. I d e n t y f i k a c j a g,losu za pomoca h i p e r p r a s z c z y z n y r o z d z i e l a j a c e j . ( V o i c e i d e n t i f i c ation b y means o f s e p a r a t i n g h y p e r p l a n c e . I n P o l i s h . ) I n Bolc L. ( e d . ) . Zastosowanie maszyn matematycznych d o badan nad j e z y k i e m n a t u r a l n y m , p p . 187-L92.",
"sec_num": null
},
{
"text": "I n BoLc L . ( e d . ) . Zastosowanie maszyn matematycznych do badan nad j e z y k i e m n a t u r a l n y m , p p 99-108. ",
"cite_spans": [
{
"start": 13,
"end": 22,
"text": "( e d . )",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "owego. (On l i n g u i s t i c a s p e c t s o f machine t r a n s l a t i o n . I n P o l i s h . )",
"sec_num": null
},
{
"text": "WydziaJu Kumanistycznego U n i w e r s y t e t u Gdanskiego. Prace J e z ykoznawcze [Scientific R e p o r t s of t h e Gdansk U n i v e r s i t y F a c u l t y o f Arts. L i n g u i s t i c w r i t i n g s ] n o . 2 , 1 9 7 3 S t r , 6 1 -6 9 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kowalewska.Jolatlta. Modele zdan p o l s k i c h i a n g i e l s k i c h d l a p o t r z e b przekzadu maszynowego z jezyka a n g i e l s k i e g o [Models o f Polish and E n g l i s h sentences from t h e point o f v i e w of m a c h i n e transl a t i o n from ~n g l i s h t o P o l i s h . I n Polish.] Z e s z y t y Naukowe",
"sec_num": null
},
{
"text": "Kurcz, Ida, Andrzej Lewicki, Jadwiga Sambor, and Jerzy Rorohczak.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Kowalewska.Jolatlta. Modele zdan p o l s k i c h i a n g i e l s k i c h d l a p o t r z e b przekzadu maszynowego z jezyka a n g i e l s k i e g o [Models o f Polish and E n g l i s h sentences from t h e point o f v i e w of m a c h i n e transl a t i o n from ~n g l i s h t o P o l i s h . I n Polish.] Z e s z y t y Naukowe",
"sec_num": null
},
{
"text": "Kurcz, Ida, Andrzej Lewicki, Jadwiga Sambor, and Jerzy Woronczak.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Szownictwo wspoZczesneqo j e z y k a p o l s k i e g o . Listy f r e k w e n c y j n e . Tom I. T e k s t y popularnonaukowe. C z e s c 1 . i 2 . [Vocabulary of contemporary Polish. Frequency lists. Vol I . P o p u l a r i z e d s c i e n t i f i c t e x t s , Part 1 agd 2 . In P~l l s h . 1 W a r s z a w a : Instytut Badan Literackich P o l s k i e j A k a d e m l i N a u k [Institute of L i t e r a r y Research of P o l i s h Academy of S c i e n c e s ] . P p 8 5 8 .",
"sec_num": null
},
{
"text": "Listy f r e k w s n c y j n e . Tom I I , Drobne wiadomosci prasowe.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Szownictwo wspo,Zczesnego jezyka p o l s k i e g o .",
"sec_num": null
},
{
"text": "Czesc 1 i 2 . [Vocabulary of contemporary P o l i s h . Frequency L i s t s . V o l . 11.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Szownictwo wspo,Zczesnego jezyka p o l s k i e g o .",
"sec_num": null
},
{
"text": "generative framework. I n P o l i s h , summary ia English. B i u l e t y n P o l s k i e g o Towarzystwa Jezykoznawczego z . X X X X 119731 p p . 1 5 -3 4 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Laskowski, Roman: P r o b l e l n a t y k a ~J o w o t w o r c z a w gramatyce transformacy jdo-generatywne j Word f o r m a t i o n w i t h i n t h e t r a n s f o r m a t i o n a l -",
"sec_num": null
},
{
"text": "Jezykoznawczego z. XXXII ( 1 9 7 4 ) p p 179-197.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lobacz, Piotra, and Wiktor Jassern. F o n o t a k t y c z n a a n a l i z a mowionego t e k s t u polskiego [Phonotactic a n a l y s i s o f P o l i s h spoken t e x t s . I n Polish, summary i n English.] Biuletyn P o l s k i e g o T o w a r z y s t w a",
"sec_num": null
},
{
"text": "Zastosowanie maszyn matematycznych do b a d a n n a d j e z y k l e r n n a t u r a lnym, pp 1 6 5 -1 7 3 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lobacz, P i o t r a , and Wiktor Jassem. C z e s t o s c i f o n e m o w i ich p o J a c z c n w mowionych t e s t a c h p o l s k i c h [ F r e q u e n c y of phonemes a n d its groups i n P o l i s h spoken t e x t s . Pn P o l i s h ] . I n Bolc L. ( e d . ) :",
"sec_num": null
},
{
"text": "Zastosowanie maszyn matematycznych do b a d a n n a d j e z ykiem n a t u r a l n y m , p p 34-41.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "L. (ed.):",
"sec_num": null
},
{
"text": "[ C h a r a c t e r i z a t i o n of t h e MARYSIA s y s t e m .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTELLIGENCE Lukaszewicz, Witold, and Stanislaw Szpakowicz. C h a r a k t e r y s t y k a sys t e m u M A R Y S I A .",
"sec_num": null
},
{
"text": "I n Polish. ] I n : S y s t e m y w y s x u k i w a n i a i n f o r m a c ji . W a r s z a w a : P a n s t w o w e W y d a w n i s t w o N a u k p w e . S t r . 1 8 1 -1 8 6 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTELLIGENCE Lukaszewicz, Witold, and Stanislaw Szpakowicz. C h a r a k t e r y s t y k a sys t e m u M A R Y S I A .",
"sec_num": null
},
{
"text": "Majewski, Wojciech, and Janusz Zalewski. [ I n f l u e n c e of f u n d a m e n t a l f r e q u e n c y c u e s on t",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INTELLIGENCE Lukaszewicz, Witold, and Stanislaw Szpakowicz. C h a r a k t e r y s t y k a sys t e m u M A R Y S I A .",
"sec_num": null
},
{
"text": "Mikiel, Wladyslaw. Z a s t o s o w a n i e s y n t e z a t o r a mowy d o r e a l i z a c j i",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "h e p e r c e p t i o n o f s y n t h e t i c s p e e c h -l i k e s i g n a l s . I n P o l i s h . I n Bolc L . ( e d . ) : Z a s t o s o w a n i e m a s z y n m a t e m a t y c z n y c h d o b a d a n n a d jezykiem n a t u r a l n y m , p p 1 2 9 -1 4 4 .",
"sec_num": null
},
{
"text": "i s h .] I n B d l c L . (ed .) :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Motylewski, Jerzy. Metoda b i n a r n e j d y s k r y m i n a c j i i r e j e s t r a c j i f o n e t y c z n o -a k u s t y c z n y~h p a r a m e t r o w s y g n a z u m o w y . [ M e t h o d of b i n a r y d i s c r i m i n a t i o n a n d r e g i s t r a t i o n of p h o n e t i c -a c o u s t i c p a r a m e t e r s o f s p e e c h s i g n a 1 , s . I n P o l",
"sec_num": null
},
{
"text": "v o l . XV no. 8 , 1 9 6 7 , p p 5 3 7 -5 4 1 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OrLowska, E. M e c h a n i c a l p r o o f procedure f o r t h e n -v a l u e s p r o p o s itional c a l c u l u s . B u l l e t i n d e l l A c a d e m i e P o l o n a i s e d e s Sciences S e r i e d e s Sciences M a t h e m a t i q u e s , A s t r o n a m i q u e s e t Physiques,",
"sec_num": null
},
{
"text": "Jezykoznawcze nr 1 , 1 9 7 3 . Str. 3 3 -4 9 . ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Roclawski, Bronislaw. ~u t o m a t y c z n a s y n t a z a f o r m d e k l i n a c j i p r z y m i o tn i k o w o -z a i m k o w e j [ A u t o m a t i c s y n t h e s i s o f i~f l e x f o n a l F o r m s o f t h e adjective a n d p r o n o u n d e c l e n s i o n . I n P o l i s h ] , Z e s z y t y N a u k o w e W y d z i a z u H u m a n i s t y c z n e g o U n i w e r s y t e t u G d a n s k i e g o . Prace",
"sec_num": null
},
{
"text": "V , 1 9 7 3 , p p 7 5 -8 6 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Steffen-Batogowa, Maria. The Problem o f A u t o m a t i c Phonemic T r a n sc r i p t i o n o f W r i t t e n P o l i s h . B i u l e t y n F o n o g r a f i c z n y , X I",
"sec_num": null
},
{
"text": "Jezykoznawcze n r 1 , 1 9 7 3 . Str. 51-60.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Szczepanska, Grazyna. P r z e d r o s t k i w i e l o p o s t a c i o w e w a u t o m a t y c z n a j s y n t e z i e czasownikow p o l s k i c h . [ H u l t i f o r m p r e f i x e s i n a u t o m a t i c s y n t h e s i s of Polish v e r b s . I n Polish.] Z e s z y t y Naukowe W y d z i a . 2~ Eumanistycznego U n i w e r s y t e t u G d a n s k i e g o . Prace",
"sec_num": null
},
{
"text": "zacji w urzadzeniu przekzadowyrn.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokarski, Jan. Fleksja p o l s k a , j e j opl's w s w i e t l e m o z l i w o s c i mechani-",
"sec_num": null
},
{
"text": "[",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokarski, Jan. Fleksja p o l s k a , j e j opl's w s w i e t l e m o z l i w o s c i mechani-",
"sec_num": null
},
{
"text": "Poradnik J e z y k o w y , r 1 9 6 1 ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Description o f P o l i s h i n f l e x i o n fxom the p o i n t or view o f p o s s i b i l i t y of m e c h a n i z a t i o n i n a t r a n s l a t i o n d e v i c e , A d j e c t i v a l d e c J e n s i o n .",
"sec_num": null
},
{
"text": "Poradnik Jezykown, r . 1961 ",
"cite_spans": [
{
"start": 9,
"end": 27,
"text": "Jezykown, r . 1961",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tokarski, Jan. F l e k s j a p o l s k a , j e j o p i s w s w i t l e m o z l i w o s c i mechaniz a c j i w u r z a d z e n i u przekzadowym. D e k l i n a c j a rzeczownikowa i i n n e n i e p r z y m i o t n i k o w s . [ D e x c r i p t i o n o f P o l i s h i n f l e x i o n from t h e p o i n t of v i e w o f p o s s i b i l i t y of m e c h a n i z a t i o n i n a t r a n s l a t i o n d e v i c e . Nominal and o t h e r n o n -a d j e c t i v a l d e c l e n s i o n s , In P o l i s h . ]",
"sec_num": null
},
{
"text": "Poradnik Jezykowy, r. 1 9 6 2 , z 4 p p 1 4 5 -? ? ?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokarski, Jan. F l e k s j a p o l s k a , jej opis w s w i e t l e mozliwosci m e c h a n iz a c j i V u r z a d z e n i u przek,Zadowym. ~o n i u g a c j a . [ D e s c r i p t i o n of P o l i s h i n f l e x i o n from the p o i n t of view of possibility o f mechani z a t i~n in a t r a n s l a t i o n device. C o n j u g a t i o n . I n polish.]",
"sec_num": null
},
{
"text": "ARTIFICIAL INTELLIGENCE IN P O W D 36",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokarski, Jan. Fleksja p o l s k a , j e j opis w swietle m d z l i w o s c i mechaniz a c j i w u r z a d z e n i u przek,Zadowym. Rozpoznawanie form f l e k s y j n y c h . [ D e s c r i p t i o n o f P o l i s h i n f l e x i o n from t h e p o i n t of v i e w o f p o s s ib i l i t y o f m e c h a n i z a t i o n in a t r a n s l a t i o n d e v i c e . ~e c o g n i t i o n of f n f l e x i o n a l forms. I n Polish.] ~o r a d n i k Jczykowy, r. 1 9 6 3 , z.1, p p 4 -? ? , 2.2 p p 5 5 -7 7 , 2 . 3 -4 p p 1 1 -3 1 ? , 2.5-6 p p 173-???",
"sec_num": null
},
{
"text": "Poradnik J e z y k o w y , r . 1 9 6 3 , z . 9 , p p 3 6 0 -? ? ? ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tokarski, Jan. F l e k s j a p o l s k a , j e j o p i s w s w i e t l e j o z l i w o s c i mechaniz a c j i w u r z a d z e n i u przekzadowym. Granice paradygmatow f l e k s y jnych i formantow s~o w o t w o r c z y c b w o b r e b i e d e k l i n a c j i r z e c z o w n ik o w e j . [ D e s c r i p t i o n o f P o l i s h i n f l e x i o n from t h e p o i n t o f v i e w o f p o s s i b i l i t y o f m e c h a n i z a t i o n i n a t r a n s l a t i o n d e v i c e . Border l i n e b e t w e e n inflexional p a r a d i g m s a n d d e r i v a t i o n a l f o r m a t i v e s i n t h e nominal d e c l e n s i o n . I n P o l i s h ] .",
"sec_num": null
},
{
"text": "Prace J e z y k o z n a w c z e n r 1 , 1 9 7 3 1 1 9 7 2 1 . Str. 7 -3 1 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Wierzbowski, Ludwik. Opis a l y o r y t m u paszukiwania s 3 o w w maszynowym s4owniku ternatow na ograniczonym odcinku. [ D e s c r i p t i o n of an a l g o r i t h m of word, s e a r c h i n g i n a computer s e g m e n t e d d i c t i o n a r y of stems, I n p o l i s h ] . Z e s z y t y N a u k o w e W y d z i a 3 u H u r n a n i s t y c znego U n i w e r s y t e t u G d a n s k i e g o .",
"sec_num": null
},
{
"text": "Jazyk c e l o v e k a i r n a s i n a . [ R e v i e w of N a t u r a l l a n g u a g e a n d c o m p u t e r , ] Moskwa 1 9 6 9 . Z e s z y t y Naukowe W y d z i a 3 u H u m a n i s t y c znego U n i w e r s y t e t u G d a n s k i e g o . Prace J e z y k o z n a w c z e n r 1 , 1 9 7 3 ( 1 9 7 4 ) , p p . 1 2 9 -1 3 6 .",
"cite_spans": [],
"ref_spans": [
{
"start": 288,
"end": 299,
"text": "( 1 9 7 4 )",
"ref_id": null
}
],
"eq_spans": [],
"section": "Wierzbowski, Ludwik. R e c e n z j a p r a c y B e l s k a j a I ( z a b e l 1 a ) K ( u z r n i n i c n a ) :",
"sec_num": null
},
{
"text": "P o l i s h v e r b s . I n P o l i s h . ] I n B o l c , L . , e d .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Wojtasiewicz, Olgierd Adrian. W s t e p n y o p i s s k d a d n i o w y i sernant y c z n y c z a s o w n i k o w polskich. [ P r e l i m i n a r y s y n t a c t i c a r d semantic d e s c r i p t i o n of",
"sec_num": null
},
{
"text": "W a r s z a w a 1 9 7 2 . Jezyk P o l s k i , t . LIII ( 1 9 7 3 ) , nr 4 , s t r . 3 0 0 -3 0 2 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Zarebina, Maria. R e c e n z j a p r a c y L e w i c k i A n d r z e j , M a s 4 o w s k i W 3 a d y s S a w , S a m b o r J a n i n a , W o r o n c z a k J e r z y : S 2 o w n i c t w o w s p o 4 c z e s n e j p u b l i c y s t y k i p o l s k i e j . L i s t y f r e k w e n c y j n e . [Vocabulary of c u r r e n t P d l i s h j o u r n a l i s m , f r e q u e n c y l i s t s . ]",
"sec_num": null
},
{
"text": "Krakow 1 9 7 2 . J e z y k P o l s k i , LIII (1973) , no. 1. l g o r y t m y , v o l . X ( 1 9 7 3 ) , no 2 8 , p p . A physical interpretation of each analysis technique is effected. The properties of each method are discussed. Four methods are a description of a short-time waveform in which essentially the same information is preserved. Each turns out to be a particular normalization. A fifth method is shown to be a different type of measure, preserving information concerning the duration of zero-crossing intervals rather than their absolute number. A n attempt is made to rnuherate general characteristics of each of the techniques so as to make the mathematical analysis ge~~erally applicable.",
"cite_spans": [
{
"start": 41,
"end": 52,
"text": "LIII (1973)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 62,
"end": 101,
"text": "l g o r y t m y , v o l . X ( 1 9 7 3 )",
"ref_id": null
}
],
"eq_spans": [],
"section": "Review of Word frequency i n j o u r n a l i s m .",
"sec_num": null
},
{
"text": "pitch and voiced/unvoiced information. and the predidor coefficient5 are converted to PARCOR coefficients for checking stability and transmiss~on to tbe receiver. The sequential techniques are real time feasible and closcky related to autocorrelation and covariance methods.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "C U R R E N T B I B L I O G R A P H Y",
"sec_num": null
},
{
"text": "Automatic The system recognizes by building an internal model of the mutual relationships of the object patterns. Thus the machine knows the surrounding situation. E.g. it recognizes a circular multivocal pattern as the letter 0 or the numeral 0 according to the circumstances. The system consists of a two-dimensional array of computational elements, each an analog threshold element with a threshold value and a saturation value, where mutual coupling in the reverse direction between the fundamental computational elements plays an important role furthermore, an algorithm by which the made1 for the relationship information is formed interna:lly by self-learning, and also the cond~tion for stable operation of the system, are described. The system has been tested using an input set of English letters, mumerals, and Kana letters. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "PHONETICS-PHONOLOGY: RECOGNlTlQN",
"sec_num": null
},
{
"text": "Abstracts. 1970-197 1, are studied; the total is 2.5 million tokens. Base forms and stems are considered; both the number of base forms and the number of stems increase linearly with the nlrmber of types. Extrapolating, the author esti'mates that in the first month after 5 vears an issue ( 1000 abstracts) will contain 900 new base forms; after 10 years, 670. The problem of partitioning source programs into tokens for lexical analysis in compilers. Let the order of tokens in the source program be described by an LR(k) grammar and let the ~h r~t m s comprising each token form a regular set in general. When the next token is needed the LR(k) parser finds the set of token strings of length h + l which can come next and calls the scanner. By scanning until the input coincides with a token string of l~ngth A frame approach (Minsky) to the organization of knowledge can be i~sed f o r understanding texts or for executing actions. A frame is a static data structure about one stereotyped topic. Frame? consist of frame statements (FS). A story consists of story statements (SS) which inst;lnti;tte FS's. The binding of variitbles ill FS's instantiated by SS's i 5 h;rndled by a frame image (FI) which is separate from the FS. Frames must be able to rcfcrmce suhframes and some FS'S will be common to ~v e r a l frames. Many inferences have l o be mrde about information not given in SS's but necessary for coniprehension. Given the lrirgc rlurnber of pos5ible inferences, restrictions muyt be put on them so that only useful ones are made. A Dual Usage Rule is suggested: If X is an FS in a n active frame (one which has an FI) then X w i l l only appear instantiated in the data base (for ttie particular story) i f it has two purposes. Finally, the frame approach is contrasted with a demon apprcxich.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ZMD-A-28, Beufh Verlag G M B H , Berlin 30, 1974. lSBN 3-410-44028-3 DM I0",
"sec_num": null
},
{
"text": "has two purposes. 24, 4: 14-23, 1975 Computer programs to understand natural language must deal with grammar and semantics; control of context is crucial. Correspondng to any context (e.g. accounting, geology, music, \"common everyday context\", etc.) is a vocabulary of \"brick-words\" for use in that context. Brick-words are joined by cement-words, which may be used in many contexts. Cement-words for ordinary discussion, general science, mathematics and logic are discussed. There is no one-to-one correspondence between cement-words and cement-ideas. The programmer specifies a context and tells the computer the idea 1:rbels for the ideas referred to by brick- ",
"cite_spans": [
{
"start": 18,
"end": 36,
"text": "24, 4: 14-23, 1975",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Linguislic String Project, New York University",
"sec_num": null
},
{
"text": "Neil M. Goldman",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Sentence Paraphrasing from a Conceptual Base",
"sec_num": null
},
{
"text": "A program produces sentewe paraphrases which demonstrate understanding with respect to a given contexl. This genergtor operates in conjunction with a natural language analyzer and a combined memory and inference model. The model encompasses several classes of 1 inguistic knowledge: (1) executabb tests of conceptual properties stored in descrimination nets: (2) information relaticg conceptual % byntacric roles, stored in a word-sense dictionary, and (3) surface grammaticat knowledge, ~f 3 r p~d in 5! fvrmal grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Communications of the ACM 18: 96-106, February I975",
"sec_num": null
},
{
"text": "In order to answer questions, people must use: ( I ) simple inference. (2) knowledge of causality, (3) their understanding of physical laws, (4) general nowl ledge, and (5) their understanding of what the jxrson asking the question already knows. Knowledge of the world can. be represented in an active network. with some of the nodes standing for programs that operate upon the network itself Events, acrors, ~ocalions, objccts, cuusul factors and resuits make up scenartos. The primitive definitions of actions are sensorimotor instructions. Sensorimotor plans can be examined as data; activated, causing the action; and simulated. Linear teaching and (earning proceeds by the addition of one new piece of information after another to the developing structure while web teaciiing arid learning goes from a general overview, to more detailed overviews, to detailed substructure. The model is being tested by computer simulation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Communications of the ACM 18: 96-106, February I975",
"sec_num": null
},
{
"text": "The Since 1967, talk about secure systems has become quite popular. The computer press and the general news media regularly report on computer systems which have been destroyed by natural disaster, breached by malicious individuals, or have failed to perform their assigned function during times of peak loading. The questions of privacy and personnel data banks have been discussed in the United States Congress, in international tribunals, and are the subject of dozens of bills pending in legislative bodies throughout the world.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICS-DISCOURSE: MEMORY",
"sec_num": null
},
{
"text": "The goal of this manual is to allow each individual computer center manager to assess his needs for security and to become aware of the steps taken by others faced with similar problems.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICS-DISCOURSE: MEMORY",
"sec_num": null
},
{
"text": "This manual covers topics such as personnel, physical security, operating systems, access controls, programs, communications, storage, input/ output, supplementary topics and insurance. 850 checklist questions are provided which explore an organization's strengths and weaknesses. The resulting self-audit will describe the status of your organization in its own natural environment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICS-DISCOURSE: MEMORY",
"sec_num": null
},
{
"text": "This is the'flrst volume in a series of System Review Manuals. Order yours today! Get your ongoing security program started! 1 14 pages, softcover, $1 0.00.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SEMANTICS-DISCOURSE: MEMORY",
"sec_num": null
},
{
"text": "by Raymond M, Berger and Donn B. Parker",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTER PROGRAMMER JOB ANALYSIS A REFERENCE TEXT",
"sec_num": null
},
{
"text": "What ls a programmer? What does a programmer do? When is a programmer primarily a coder, an operator, a systems analyst, or a member of another occupation which requires programming? Are programmers professionals, paraprofessionals, or technicians?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTER PROGRAMMER JOB ANALYSIS A REFERENCE TEXT",
"sec_num": null
},
{
"text": "Nobody has attempted to answer these questions for the industry as a whole except the U.S. De partment of Labor, who, in 1971, for the purpose of enforcing the wages and hour rules, declared that programmers are not professional.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTER PROGRAMMER JOB ANALYSIS A REFERENCE TEXT",
"sec_num": null
},
{
"text": "Company personnel job descriptions, already in existence, could be examined as a logical starting point in finding answers to these questions. However, those written by programming managers and personnel people are usually unmeticulous, out of date, little used, and change from company to company. Further, they are attempts by management to describe what their programmen are supposed to do and have little correspondence with what programmers say they do in their work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTER PROGRAMMER JOB ANALYSIS A REFERENCE TEXT",
"sec_num": null
},
{
"text": "The results of this study are expected to be used by management personnel of computer programming organizations to develop programmer position descriptions to fit their specific needs. The results are also expected to provide the basis for development of comprehensive examinations for programmer certification, Finally, the study should represent an initial milestone in the continuing personnel regearch into the nature and evolution of occupations in the computer field. 196 pages, softcover, $1 0.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTER PROGRAMMER JOB ANALYSIS A REFERENCE TEXT",
"sec_num": null
},
{
"text": "S 12.95",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Consti tuen t-struc~ure theory; generative power, transformational and stratif icati onal theories; semantics in linguistics and logic: the program of text linguistics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "Robert M . Halalick",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "An Associative-Categorical Model of Word Meaning",
"sec_num": null
},
{
"text": "Artificial Intelligence 6.. 1975 Words in a given universe are assigned values from a fixed category set (semantic primitives). A statistical relatedness measure (concomitant variation) is computed for these values on the basis of the specified word universe. An association measure between the words is then defined and the generalization of word clusters is introduced. A comparison with associative (e.g. Quillian) and categorical (e.g. Schank, Winograd) models is made and the application of the asswiative-mtegorical model to verbal analogy problems is described. Posslble applications in A1 a n d in N L processing, 3 learning generalizations from instances, are discussed. :237-260,1975 M T requires the use of a natural language (NL)/metalanguage (ML) distinction in which the M L for representation of a particular domain of knowledge is independent of any NL. The M L is conceived of as representing the culture of a scientific community. MT would proceed by using the appropriate M L as a terfium quid between the two NL's. A system for text analysis, applicable to any NL or ML, is described in which each text is treated as a tree and analyzed from bottom to top using 9 grammars requiring 4 programs. : 380-383, May 1975 Parallel web automata (PWA)--a generalization of cellular arrays to arbitrary graph structures--are defined. It is shown that such automata make poor.acceptots (i.e.. they are not good recognizers of their own graph structures). However, they can be used to perform parallel local pattern matching (with respect to patterns of bounded size) on themselves, so that they have potential usefulness as models for *'semantic memory.\" They can )also be used to find greatest compatible sets of graph labelings subject to given local constraints; this problem arises. for example, in the analysis of scenes containing three-dimensional objects.",
"cite_spans": [
{
"start": 28,
"end": 32,
"text": "1975",
"ref_id": null
},
{
"start": 680,
"end": 693,
"text": ":237-260,1975",
"ref_id": null
},
{
"start": 1215,
"end": 1234,
"text": ": 380-383, May 1975",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Department of Electrical EnNneering, Universiiy of Kansas Knut Ripken Mat hemalisches I nstitut, Technische Universitai Munchen",
"sec_num": null
},
{
"text": "A precjse computationally specific method for coupling two different man y-valued logics with a procedural problem-solving system (micro-PLANN ER). Solutions to deductive problems can be found which meet specific criteria of validity. This scheme enables the system to dynamhlly compute the truth-value of a subgoal during the search process. Thus, the validiw of a subgoal may be used to direct the heuristic search procedure. The notions elaborated here are relevant to any procedural problem-solving language. A bidirectional relationship between state-space and problem-red uction rcpresen tat ion uses a formalism based on multiple-input and multiple-output operators. A represen tation of the language recognition problem which is based on the Cocke parsing algorithm is used as an illustration. A method for representing problems in first-order logic in such a way that the infermce system employed by a resolution-based theorem prover determines whether the set of tlauses is interpreted in the state-space mode or it) the problem-reduction mode is presented. The analogous concepts in problem-reduction and theorem proving, and the terminology used to refer to them, are noted. The relationship between problem-reduction, input resolution, and linear resolution is discussed. Interactive programming systems often contain help commands to give the programmer online instruction regarding the use of the various systems commands. It would be relatively easy to make these help commands significantly more helpful by having them accept requests in natural language. As a demonstration Weizenbaum's ELlZA program has been provided with a script that turns it into a natural language system consultant. Appendices contain script and list of key words for ELlZA helper. Sctne analysis routines analyze block sLrue(ura and produce hierarchical symbolic dwriptions which can be represented as a network of nodes, for objects, and arcs. for relations between objects, in teaching the machine to identify b l a k slructutar one presents i t with examples of a particular tyye Gf structure (such as a pedestal or an arch) and with ncor mlsses. The mach'ine is able to CEO& the difference between the description of an example and the description of a near miss md from that to learn what i s essential to the concept. In this way a model of' the c~n o p t is constructed. The program can compare some scene with a list of modds and report unt as an acceptable match. identify wme particular sbject in a scene, and find instances of some particular model in a scene.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Departmen8 of Iit.formation and Cornpurer Science, University of California, lrvine",
"sec_num": null
},
{
"text": "Marek CiganikComputing Research Center, UNDP, Brat islava, Czechoslovakia. Management 11, 1-10, 1975 Primary documents contain the retrieval information in an implicit form. The metainformational approach attempts to transform this imp1 ici t information structure to an explicit one. A successful solution of the problem is based on a metasyntactic analysis of texts, a creation of the semantic language in an oriented graph metastructure. and a pragmatic interpretation of rnetastructures based on relational contextual indexes. The system consists of the following processes: (1) Analyzing the text items and assigning candidate index terms to the items; ( 2 ) Generating an6 assigning index phrases to the items;",
"cite_spans": [
{
"start": 75,
"end": 100,
"text": "Management 11, 1-10, 1975",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Systems",
"sec_num": null
},
{
"text": "(3) Dfscriminating and rejecting candidate index terms determined to be ineffective in forming a classification automatically; and (4) Generating a classification system and repositing the text items in accordance with this system. Some degree of interactive user involvement i s incorporated, particularly for (3). The system informs the user of the impact of his decisions to delete terms on a mass basis. An affinity dictionary allows the user to locate synonymous or near synonymous index terms. The system has been adequately documented (indcluding a user guide) and tested for its reliability and dependability. Most previous attempts at producing word classes (thesauri) by statistical analysis have used very limited distributional information such as word co-occurrence in a document or a sentence. The present procedure uses syntactic relations. I t forms classes by grouping together nouns that occur as subject (or object) of the same verbs, and similarly by grouping together verbs occurring with the same subject or object. The program was applied to a small corpus of sentences in a subfield of pharmacology. This procedure yielded the word classes for the subfield, in good agreement with the word classes recognized by pharmacologists. The word classes can be used to describe the informational patterns that occur in texts of the subfield. to disambiguate parses of a sentence, and perhaps to improve the performance of current information retrieval systems. Word meaning is a function of a finite number of semantic components. Of the available components, the applicable ones are determined by context. Poetic texts reinforce the themes/components of the poem by repetition of words bearing the proper components. Definitions of all the words i n the Wanderer were loaded into a computer and a concordance made of all words in the definitions. The print-out listed the components (words used to define poem words) alphabetically and indicated each poem word in whose definition the component occurred. A matrix i n which each character in a play heads a column and each scene (as defined in Marcus' theory) a row i s constructed. For each character p there is a set A(p) composed of the natural numbers corresponding to the scene in which p appears. Characters p and q can be concomitonr, independent, olrernative, cumplemen fary, or one can dominate the other depending on the relationship between A(p) and A(q). It is also possible to calculate character density up to the kth scene, the scenic difference between two characters. the scenic diameter of the play, the encounter number of two characters. and the character-scene frequency. Other properties are defined on the incidence graph of the characters. These methods are testec and refined in the investigation of seven plays of widely different character and i t i s ihown that these methods d o differentiate among the types o f play studied, though the model cannot be relied upon by itself to yield an explication of play-structure. \"linguistic\" synthesis of a controller for a model industrial plant (a steam engine) . Fuzzy logic is used to convert heuristic control rules stated by a human operator into an automatic control strategy. The experiment was initiated to investigate the possibility of human interaction with a learning controller. However. the control strategy set up linguistically proved to be far better than expected in its own right, and the basic experiment of linguistic control in a non-learning controller is reported here.",
"cite_spans": [],
"ref_spans": [
{
"start": 3015,
"end": 3100,
"text": "\"linguistic\" synthesis of a controller for a model industrial plant (a steam engine)",
"ref_id": null
}
],
"eq_spans": [],
"section": "InJorma~ion Processing and",
"sec_num": null
},
{
"text": "AFIPS is a federation of pmfesslonal societies concerned with computers and Information processing. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "ABOUT AFlPS",
"sec_num": null
},
{
"text": "The ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "AFlPS CONSTlTUENT SOCIETIES",
"sec_num": null
},
{
"text": "edited by Harold Sackmen and H. Borko How can computers be applied to the great problems that plague the human species? Computers and the Problems of Society was conceived to formulate the problem and meet the challenge of the humanistic use of computers. The focus is not on social probbms generated by computers. Instead, it is on the constantly growing need far computers to heip ameliorate significant social problems. Accordingly each chapter is organized In two sections: First, what are the leading soclal problems In the given area? and Second, how can computers help people to understand and solve these problems? 562 pages, hardcover, $1 5.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTERS AND THE PROBLEMS OF SOCIETY",
"sec_num": null
},
{
"text": "edited by Harold Sackman and 8. Boehm The advent of mass Information ut i l i t i e&-t he extension of interactive or conversational computer services to the general public in the natural environment of the usermay have a greater impact on human civilization than the Invention of the printing press. The fundamental question adsrng from the extemsion of mass information utilities is:How shall this massive reconstruction of social information power be dedpned for the best interest of the pubiic in general and every man, woman, and child in particular?Planning Community information Utilities is desi g.@md to respond to thls question at the earliest point where if counts moot--for initial community prototypes. The recommendations k r a prototype community information utility form the basis of this volume. 475 pages, hardcover, $15.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "UTlUllES",
"sec_num": null
},
{
"text": "edited by H. Sackman and Norman Nie A group of $elected papers emanating from a conference sponsored jointly by the University of Chicago, Encyclopedia BhtPnnlca :.XI NIPS covering such topics as what direction an Infoth.ation utility should take, how it will be 7' ulated in the ppblic interest and the impact of evolving i ormation utilities on pdftlc8. 298 pages, hardcover, $9.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE INFORMATION UTILITY AND SOClAL CHOICE",
"sec_num": null
},
{
"text": "by Bnrw bilchcI8t md Milton R. Wessef For the first time two authors with broad experience in the computer field report on the impact of government regulation, Resutting from an eight-month research eflort which in- The papers encompass the historical impact of the computer on the field, the current state of the art and the future use of telecommunication. The topical information includes data relative to the use of minicomputers, networks, automatic indexing, on-line systems, retrieval capabitities, data base management, library processing and software. This book provides information which enables the reader to bridge the gap between the user-senrlce orientation and the mectbanisticdesign approach. 100 pages, softcwer, $10.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GOVERNMENT REGULATION OF THE COMPUTER INDUSTRY",
"sec_num": null
},
{
"text": "edited by Joseph E. Leininger and Bruce Gilchrist This proceedings of an AFIPS/Stanford conference contains 14 papers plus discussion on topics such as software protection, legal information retrieval, privacy, regulation and quantitative methods in the legal area. Participants included leading legal educators and computer scientists. 264 pages, softcover, $6.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTERS, SOClETY AND LAW: THE ROLE OF LEGAL EDUCATION",
"sec_num": null
},
{
"text": "This report contains the results of a major national study of the general public's attitudes and opinions toward computet-s and their use. The survey is based on 1,001 telephone interviews with a statisticaHy drawn probability sample of the U.S. adult population. Major topics covered include-computers and privacy, the effect of computers on the individual, job involvement with computers, the Incidence of personal problems involving computer usage, use of computers by government, the computer as perceived by the consumer, compufer usage in business, and career opportunities. 32 pages, softcover, $5.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "NATIONAL SURVEY OF THE PUBLIC'S ATTITUDES TOWARD COMPUTERS , prepared b), AFlPS and Time Magazine",
"sec_num": null
},
{
"text": "by Burt Nanus, Leland M. Wooten and Harold Borko The use of large scale computer systems across national boundaries In both business and government Is expected to have profound long term social, polltical and economic consequences. To heip identify and define eorne of these issues and problems, the AFIPS Social implications Committee sponsored a year-long Delphi study at the USC Center for Futures Research. This book reports the results of the study and conciudes that wlthln the next ten to fifteen years. there will be a great increase in multinational manmachine Interactions, causing new problems of national citizenship and organlzat~onal loyalty In private corporations as well as new problems o# regulatlon of data flow8 and equity for the developing countries in the pubiic sector. Thls book should be of Interest to ail who are concerned with the expanding role uf the computer in shaping world social and economlc progress. 160 pages, Softcclver, $10.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "THE SOCIAL lMPLlCATlONS OF THE USE OF COMPUTERS ACROSS NATIONAL BOUNDARIES",
"sec_num": null
},
{
"text": "Papers presented at a special seminar held for Congressional members and staff and sponsored by AFIPS In cooperation with the Association for Computing Machinery. 89 pages, softcover, $5.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "INFORMATION SYSTEMS: CURRENT DEVELOPMENTS AND FUTURE EXPANSION",
"sec_num": null
},
{
"text": "Report of a roundtable meeting chaired by The Honorable Wlllard Wirtz and sponsored by AFIPS. 21 pages, softcover, $3.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "PROFESSIONALISM IN THE COMPUTER FIELD",
"sec_num": null
},
{
"text": "Jointly sponsored by AFIPS and the information Processlng Society of Japan, this proceedings brlngs together all the newest U.S. and Japanese developments in the computer field. Twenty-one sessions and 107 papers. A must for your library! 71 7 pages, hardcover $30.00 ('20% discount to members of AFIPS Constituent Societies. All orders must be prepaid and InclQde membership number.)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "PROCEEDINGS OF THE FIRST USA/JAPAN COMPUTER CONFERENCE",
"sec_num": null
},
{
"text": "Report on a special-seminar held at the 1973 NCC. 134 pages, softcover, $6.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "DATA BASES",
"sec_num": null
},
{
"text": "A booklet prepared by AFIPS in cooperation with the National Better Business Bureau, Inc., covering types of posltions and training in the computer field. Softcover, 25$ each, $10.00 per hundred, $80.00 per thousand.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "FACTS ON COMPUTER CAREERS",
"sec_num": null
},
{
"text": "This guide Is intended for those people who are concerned with the planning of computer courses for the training of teachers, It lves suggestions for the content of suck P courses and ndlcates methods by which the concepts of computer science can be explained to students. 28 pages, softcovor, $.75--0rder must be prepaid. This book expressas the ph~losophy that the concepts of data processing are more fundamental, important, and internationally current than are the terms used to express them 166 pages, hardcover, $9 M)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "OF SPECIAL INTEREST TO SECONDARY SCHOOLS COMPUTER EDUCATION FOR TEACHERS IN SECONDARY SCHOOLS-AN OUTLINE GUIDE",
"sec_num": null
},
{
"text": "In view of the greet interest by many people in pictures and the growlng proliferatron of programming languages dealing w t h them, it seemed necessary to organize a conference to survey the field and discuss unlfying concepts in order to fathom the possibllitles for developing a widely acceptable language for graphics This book contains the papers delivered at that conference as well as d~scussions of these papers and panel discussions on the use of grammars for scene analysis, the design of a universal graphic language, and image proceeslng software The Individual papas cover the entire field of computation on pictures scene analysis, shape recognrtlon, picture description, language design, Interactive sygtems, computer aided design, Programming is the central human activity in information processing, but there Is no single known best approach to the teaching of programming nor are teachers of programming agreed upon what are the most desirable features of programming languages. These proceedings capture the feeling of concern with these problems expressed by some of the most dlstlnguished experts in the field of programming teaching and program making. These participants came from fifteen countries and the topics raised ranged from university to elementary school level teaching. 300 pages, hardcover, $1 5.00",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "GRAPHIC LANGUAGES edited by Frieder Nake end Azriel Rosenfeld",
"sec_num": null
},
{
"text": "edited by N. T. J. Bailey, B. Sendov and R:Tseney Mathematical modeling Is a universal method for studying nature. Recently this method has been widely applied to variou~ field$ of knowledge. Its application to biology and medicine qppears to be extremely successful. This conference, a satellite event of the Third Congress ef Bulgarian Mathematicians, war organized to answer to the continuously increasing Interest in mathematical modeling throughout th'e world. 19 papers were presented and discussed at the conference; they cover the followlng probtems: genetlc control mechanisms and their role in the study of differentiation, cell-virus and carclnagensis; biochemical control mechanism and their role in cellular and physloiogical re ulation; the klnetlcs of compartment models and their ro ? e In pharmacokinetics; physlologlcal control mechanisms;populational and ecological control mec,hanisms; informatlbn theory In biology and medicine; medico-social control mechanisms. 170 pages, hardcover, $1 4.60",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "MATHEMATICAL MODELS IN BIOLOGY AND MEDICINE",
"sec_num": null
},
{
"text": "edited by J. Vlietstra and R. F. Wlelinga The term computer-aided design has gained respectability In the computing world over the past five years. Generally it refers to specific applications in the field of electronics but recently ft has been adopted hy .other disciplines which use the computer as a tool for the solution of ptoblemq. Interpretation of the term varies considerably amongst specialists but for this conference it was taken as meaning 'a technique in which man and machine are blended in a problem-solving team, intimately coupling the best characteristics of each, so that this team works better than either alone, and offering the possibility for Integrated team work using a multi-discipline approach. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTER-AIDED DESIGN",
"sec_num": null
},
{
"text": "edited by J. W. Klimbie and K. L. Koffeman Already one of the most' important areas of cemputing, data base management continues to evolve at a phenomenal rate. At the 1974 IFlP working conference, nearly every aspect of the broad field, from theoretical data modeling to current implementations, were presented and discussed in depth by the world's leading specialists. Papers prertented at the meeting Bnd summaries of the discussions are contained in this book. A state of the art report, this book will be of incalculable value to researchers in the data base management area and to fhose people implementing dala bases in real life sltuations. 423 pages, hardcover, $27.70",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "DATA BASE MANAGEMENT",
"sec_num": null
},
{
"text": "edited by E. Mumford end H. Sackman Toptcs discussed include how to use computers and design systems for the collectiofl and application of Information which will give more, rather than less, satisfaction to employees; how to improve democratic processes in management and prevent the concentration of excesalve power in the hands of managers by developing information systems that are not solely management-oriented; the dissemination of Information by governments and questions of privacy. These proceedirlgs will appeal to ail groups interested In guiding computer technology in a humane direction. They should prove particularly instructive to students of computer science by drawing attention to the human consequences of the technology they are about to use. 350 pages, hardcover. In preparation. Whatever your spelRatty or immediate concern in eyetema design, ou can turn to this book for the rkllls, ded nu, or 11 inform8 on yw need. It coven It all, from A to 5, mnd takoa a \"blueprint approach\" to the entire fleld, beginn l n~ wlth the rlngle data Item a8 the first building block in the total 6ystem. HlghHghte Include: total hardware and omretln wtem contrd, the lateat advances In timesharing P and mu tlgrogrammlng, system modeling and dmulation, and much more. 304 pages, hardcover, $1 4.95 ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "HUMAN CHOICE AND COMPUTERS",
"sec_num": null
},
{
"text": "Much more than a dictionary, and anything but standard, this book presents full explanations, practical examples, illustratlons, and supplementary information for over 10,000 hardware and software items. And unlike other dictionaries, it's cross-referenced, permittlng complete mastery of the vocabulary of programmlng, computer engineering, malntenahce control, operations, I/O devices, coding arrangements, numeration systems, checkin systems, etc. Here's a compact but complete memory re ! resher, as well as an expert reference to current devices and techniques. 336 pages, hardcover, $13.75",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "1.",
"sec_num": null
},
{
"text": "Here the autnor-examines the wide range of compfler. ap-plication~ in medicine, engineerlng, transportation, business, the arts, education, law, process control, end more. He answers hundreds of questions such as: How does the computer affect people and society?\", \"How can computers help the businessman, artist, and sports announcer?\", \"What is computer dating?\" 208 pages, hardcover, $7.50",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTERS IN SOCIEN: THE WHERES, WHYS AND HOWS OF COMPUTER USE by Donald Spencer",
"sec_num": null
},
{
"text": "Illustrated with lively cattoons, photogra ha, and diagrams, this book onem the reader a greeter un 8 erstanding of cornputers and how they work. It not only explalnr what cornputsre ere, how they work, and what they can do, but also how they are used In our society and where the modern computer orlglnated. The language of BASIC Is used to illustrate the basics of computer programmlng. 160 page$, hardcover, $7.85",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "COMPUTERS IN ACTION: HOW COMPUTERS WORK by Donald Spencer",
"sec_num": null
},
{
"text": "A compact across-the-board guide presenting both con- ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "FILE STRUCTURES FOR ON-LINE SYSTEMS by David Lelkovltz I",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "SCS/SHARE ~p~r o x . 1~ pages, two volumes, softcover, s 2 5 m w-t",
"authors": [],
"year": 1975,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wroceedings of the 1975 Summer Simulation Conference July 21 -23,1975, San Francisco, Callfomla Sponsored by AIChE/AMS/ISA/SCS/SHARE ~p~r o x . 1~ pages, two volumes, softcover, s 2 5 m w-t-",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Available",
"authors": [],
"year": null,
"venue": "SIGSIM/SCS/TIMS 856 pages, twovolurnes, softcover, $25.00 set 1973-Proceedings of the 1973 Summer Simulation Conference",
"volume": "10",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Available July 1975 1974-Proceedings of the 1974 Summer Simulation Conference July 9-1 1,1974, Houston, Texas Sponsored by AiChE/ISA/SHARE/SCS/AMS 954 pages, two volumes, softcover, $25.00 set lg74-Proceedings of the 1974 Mnter Simulation Conference January 14-16,1974, Washington, D.C. Sponsored by AIIE/ACM/IEEE/ORSA/SHARE/ SIGSIM/SCS/TIMS 856 pages, twovolurnes, softcover, $25.00 set 1973-Proceedings of the 1973 Summer Simulation Conference July 17-19, 1973, Montreal, Canada Sponsored by AIChE/AMS/JSA/SHARE/SCI 1300 pages, two volumes, softcover, $20.00 set 1972-Proceedings of the 1972 hmmer Simulation Conference June 1448,1972, San Diago, California Sponsored by AIM/AIc~E/AMS/ISA/SCI/SHAR~ 1500 pages, two volumes, softcwer, $20.00 set 197O-Winter-Proceedings of Fourth Conference on Applications of Slmulatlon-$10.00",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "1989-Summer4roceedln~a of the Conference on Applications of Contlnuous System Stmulation Languages 256 pages",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "1989-Summer4roceedln~a of the Conference on Applications of Contlnuous System Stmulation Languages 256 pages, softcover, $10.00",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "1966-Winter4igest of the Second Conference on Applications of Slmulation",
"authors": [],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "1966-Winter4igest of the Second Conference on Applications of Slmulation-S10.00",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "i s h . ] I n B o l c L. ( e d . ) : Zastosowanie maszyn matematycznych do b a d a n nad j e z y k i e m n a t u r a l n y m , p p 180-186.",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF1": {
"text": "R o l a c z e s t o t l i w o s c i p o d s t a w o w e j w p r o c e s i e p e r c e p c j i s y n t e t y c z n y c h s y g n a z o w d z w i e k ow y c h m o w y .",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF2": {
"text": "INmLLIGENCE IN P O W D Salont Zygmunt. K l a s y f i k a c j a gramatyczna l e k s e m o w , p o l s k i c h . [Grammatical c l a s s i f i c a t i o n o f p o l i s h l e x e m e s . I n P o l i s h ] . In Bolc L . led . ) : Z a s t o s o w a n i e maszyn matematycznych do badan n a d j e z y k i e m n a t u r a l n y m , p p 2 4 4 -2 5 5 . Schminda, Janusz. o pewnej m e t o d z i e z a p i s u t a k s t o w w j e z y k u n a t u r a ln y m z a p e w n i a j a c a j z m n i e j s z e n l e nadmiaru i n f o r m a c j i [Method f o rc o d i n g n a t u r a l l a n g u a g e t e x t s w i t h small r e d u n d a nc y . I n Polish.] I nB o l c L. ( e d . ): Zastosowanie maszyn matematycznych do badan n a d j e z y k i e m n a t u r a l n y m , p p 5 8 -6 9 .",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF4": {
"text": "The questionnaire enclosed with this matling of AJCL includes questions about the scope of the bibliography. The new format of the entries on the following frames is the work of Martin Kay, who used by permission the computing installation of the XEROX Pa10 Alto Research Center. AJCL thanks XEROX, Kay, and Iris Kay who contributes her time t o the o p e r a t i o n o f the new system. We expect the system to produce entries, annual indexes, and p o s s i b l y byproducts. Many summaries a r e authors' abstracts, sometimes edited for clarity, brevity, or completeness. Where possible, an informative summary is provided. Completeness of coverage, especially for reports circulated privately, depends on the cooperation of authors. Sumaries or articles to be summarized should be sent t o the e d i t o r i a l o f f i c e , T w i n Willows, Wanakah, New York 14075.",
"type_str": "figure",
"uris": null,
"num": null
},
"TABREF1": {
"type_str": "table",
"text": "",
"html": null,
"content": "<table/>",
"num": null
},
"TABREF2": {
"type_str": "table",
"text": ". . . . . . . . . . 40 . . . . . . . . . . . Transformational . . . . 47 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . relationship and interpenetration of computer science and linguistics are discussed. The affinity between modern linguistics and computer science is traced back t o their beginnings and related developments in the two fields are outlined. Ample references.",
"html": null,
"content": "<table><tr><td/><td/><td>Expression .</td><td>.</td><td>.</td><td>. 53</td></tr><tr><td/><td/><td>Text grammar</td><td/><td>6</td></tr><tr><td/><td/><td>LINGUISTICS</td><td/></tr><tr><td colspan=\"2\">Suffix analysis</td><td>45</td><td/></tr><tr><td>Verbal frames</td><td/><td>4 5</td><td/></tr><tr><td>Parser</td><td/><td>46</td><td/></tr><tr><td>Generator</td><td/><td>48</td><td/></tr><tr><td>Genera1</td><td/><td>Anthropology</td><td/><td>65</td></tr><tr><td>Bibliography</td><td>. . . . . .</td><td>48 HUMANITIES</td><td/></tr><tr><td/><td/><td>49 INSTRUCTION</td><td/><td>7:</td></tr></table>",
"num": null
},
"TABREF3": {
"type_str": "table",
"text": "of letter context (word length. letter segmentation, and character identity) to recognize words. The system consists of a character recognizer that presents a set of best alternatives for each character to a contextual postprocessor whose task it is to determine the correct word. The design of a character recognizer, basically a correlator based on chi-square. is described. The experimental performance of this recognizer is given and is used in conjunction with other experiments to predict the recognition rate of seven-letter words in a hypothesized dictionary .of 9000 words of various lengths. One general design principle is the recurring application of Neyman-Pearson like decision criteria.",
"html": null,
"content": "<table><tr><td>WRITING: RECOGNITION</td></tr></table>",
"num": null
},
"TABREF4": {
"type_str": "table",
"text": ") . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .",
"html": null,
"content": "<table><tr><td>Berich1 5-75:G = LA</td></tr></table>",
"num": null
},
"TABREF5": {
"type_str": "table",
"text": "The Restriction Language (RL) is being used in the current implementation of the Linguistic String Parser. Basic statements of R L are declarative in form (ex. THE CORE OF THE SUBJECT IS NOT PLURAL). The subject of the statement locates a node in the parse tree or an attribute of a word definition and the predicate performs some test on that node or attribute. A full range of logical connections. including NOT, AND, OR, NEITHER ... NOR 1F ... .THEN.,, i s provided and they can be nested to any depth. Registers are the ariables R L and are frequently used in the grammar to avoid having to locate the same node several times in one restriction. A n imperative format is available for writing routines (tree climbing. testing operators); there are provisions for monitoring the parsing process and for assigning and testing node attributes. Definitions of conjunctional strings are generated dynamically on encounter.",
"html": null,
"content": "<table><tr><td>GRAMMAR</td></tr></table>",
"num": null
},
"TABREF6": {
"type_str": "table",
"text": "if the partition of the first token is unambiguous, h-partionability is dofined. A model of the scanner; construction of a scanner with the minimum number of registers required for The generator codes concept11;ll structr~rcq back into natural language. It uses a set of discrimination nets through which conceptual structures are filtered to discover word sense units. With these units discovered a syntax net can be generated.",
"html": null,
"content": "<table><tr><td>2 ) Peripheral</td></tr><tr><td>(what d o people automatically assume when hearing something?), (3) Causiti ve, (4)</td></tr><tr><td>Rewltative, and (5) Predictive.</td></tr></table>",
"num": null
},
"TABREF7": {
"type_str": "table",
"text": "",
"html": null,
"content": "<table/>",
"num": null
},
"TABREF8": {
"type_str": "table",
"text": "Its core is a system of 6referential choiee between deep semantic patterns, based on \"semantic density\". 70 primitive semantic elements of 5 types (entities, actions, type indicators, sorts, and cases). Formulas are binary trees of semantic primitives and express the senses of words, one formula pet sense. Formulas are structured into templates. The application of paraptares to template codings establishes case ties between templates. Common sense inferences are used to resolve amphora. The system is conrrastcd: ( I ) with syntax oriented linguistic approaches, and (2) with theorem proving approaches to the understanding problem. With the addition of generation patterns called srereotypes the system is used to translate into French.",
"html": null,
"content": "<table><tr><td>Working Paper 12, I974 The theory is similar to Schank's. Four initial categories of concepts are Actions, Objects, Mutations, and Connections. Mare complex concepts, in particular Circumstances (Sachverhalte), are constructed. Concepts are nodes of a network that represents the knowledge and experience of a person. Understanding a text is a complex of processes relating the text to an individual's (unique) network. Communication is motivated by the need to exchange resources. SEMANTICS-DISCOURSE: COMPREHENSION A working analysis and generation program for natural language which handles paragraph length i n p u t SEMANTICS-DISCOURSE: COMPREHENSION:</td></tr></table>",
"num": null
},
"TABREF9": {
"type_str": "table",
"text": ". . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . r e . . . . . . . . . . . . . . . . . . 7 Bases for the Represenatation of Meaning . . 45 . . . . . . . . . ,. . . . . . . . The Psychological Reality of Text Bases 1: Reading Rate and Comprehension (with J. M. ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . The Psychological Reality of Text Bases 11: Sentence Memory . . . . . . . . . . Propositions as a Function of their Position in the Hierarchical Structure-Memory for Information Inferred During Reading . . . . . . . . . . . . . . . 153 I. The Identification of Explicitly and Implicitly Presented lnformation (with 1. M. Response Latencies to Explicit and Implicit Statements as a Function of the Delay between Reading and Test (with G. McKoon and J. M. the Retrieval of Information . . . . . . 177 I. Experiment 1: Latencies to True-False Judgements as a Function of the length of Paragraphs (with D. Monk) 179 2) Experiment 11: Latencies to True-False Judgements as 8 Function of Paragraph length (with D. Monk) 184 3) Discussion 188 . . . 10. Memory Search 1: Tbe Use of Knowledge in the Verification of Statements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Interim Conclusions 243 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .",
"html": null,
"content": "<table><tr><td>Con tents 2) The Text Base 15 4) Acceptability and Metaphors 36 ) Propositions 13 m a e 23 5) Psychological Process Models 39 -3) The Structure of Semantic Memory I) Definite and Indefinite Description 47 2) Quantification 50 3) Modality 53 4) Implication and Presupposition 56 5) Location, Time and Tense 62 6) Conclusion 70 Episodic Memory 82 3) Applications 92 4) Discussion 1 17 2) 6 Keenan(with I. M. Keenan) 137 2) Effects of Prbpositional Structure upon Sentence Recall (with G. Glass) 8. Keenan) 153 2) 195 I. Review 195 2) Judgements of Semantic Acceptability (with E. J .Crothers) 203 3) Theoretical Implications 2 10 1 1 Lexical Decomposition: Comprehension and Memory-219 I. The Problem 21 9 2) Experiments on Processing Diff tculty 225 3) Memory Experiments 233 Conclusions 240 12 BESTSELLERS FROM AFlPS PRESS SYSTEM REVIEW MANUAL ON SECURITY</td></tr></table>",
"num": null
}
}
}
}