~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING...

93
~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER 1974 isss.ue ,was released for production -on March 28, , , k!!!9B!ia. ~t cohtains abstracts 3f preprints and pub- IcatPohs available to the editors on March 20. NOTICE TO AUTHORS m; sciehce, those who read also publish. The help the reader-becoqe-author makes nnnouncement w&qmals. more helpful, On preparing drafts for semipublic eircu- lation: send a copy to the editorial office eo be ab~tr~acted. On receiving notice of acceptance for pub- lication in a book or journal: dnfqrrn the editor, giving full citation [as much as known) w8tb the collabsration of the readers, The Finite B$,$ing will provide much more timely i-qformation.

Transcript of ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING...

Page 1: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

~m: Journal of Computational Linguist its

THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS

m: 11 - NUMBER 4 DECEMBER 1974

isss.ue ,was re l eased f o r product ion -on March 28, , ,

k!!!9B!ia. ~t c o h t a i n s a b s t r a c t s 3f p r e p r i n t s and pub- I c a t P o h s available t o t h e e d i t o r s on March 2 0 .

NOTICE TO AUTHORS

m; sc iehce , t h o s e who read a l s o p u b l i s h . The h e l p t h e reader-becoqe-author makes nnnouncement

w&qmals. more h e l p f u l ,

On prepa r ing d r a f t s f o r semipublic eircu- l a t i o n : s e n d a copy t o t h e e d i t o r i a l off ice eo be a b ~ t r ~ a c t e d .

On r e c e i v i n g no t i ce of acceptance for pub- l i c a t i o n i n a book o r journal: dnfqrrn t he e d i t o r , g i v i n g f u l l c i t a t i o n [as much a s known)

w8tb t h e c o l l a b s r a t i o n o f the r eaders , The F i n i t e B$,$ing wil l provide much more t i m e l y i -q format ion .

Administrator
Note
Not Clear in the Film
Page 2: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

BIBLIOGRAPHY General . . . . . . . . . . . . . . . . . . . . . .

Current t rends in l i n q u i s t i c s 1 2 : a d j a c e n t ar ts &

I n f o r m a t i o n Processing 74 : p roceed ings o f IFIP Ca Prague B u l l e t i n o f Mathematical L i n g u i s t i c s 2 1

Phonetics . . . . . . . . . . . . . . . . . . . . . Speech recogni t ion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Speech synthesis . . . . . . . . . . . . . . . . . . . . Orthography . . . . . . . . . . . . . . . . Concordance ., .. Lexicography . . . . . . . . . . . . . . . . . . . Warnmar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Word order a n d word order change

d system for a u t o m a t i c i n f l e c t i o n a l a n a l y s i s (Russ . . . . . . . . . . . . . . . . . . . . parser^.. Semantics . . . . . . . . . . . . . . . . . . . . .

L e x i c a l semant ics: s ynonymi'c means o f l a n g u a g e . Discourse . . . . . . . . . . . . . . . . . . . . . Comprehension . . . . . . . . . . . . . . . . . . . Expression . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . Information structures Inference . . . . . . . . . . . . . . . . . . . . . Dialectology . . . . . . . . . . . . . . . . . . . Acquisition . . . . m a . . . . . . m . . . . . . .

Ins t ruc t ion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Documentation Translation . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . Programming Comput.ers. programming. an& n a t u r a l l a n g u a g e s l

S t u d y and compilation o f computer l a n g u a g e s . . . S t r i n g a n d list processing i n S N O B O L 4 . . . . . . . . . . . . . . . . . . . . . Fortran t e c h n i q u e s . . . . . . . . Picture analysis . . . . . . . .

Literature . . . . . . . . . . . . . . . . . . . . Computers i n t h e H u m a n i t i e s : Proceedings ICCH I A s s 9 a a t i o n for Li t e r a r y a n d ~ i n g u i s t i c C o m p u t i n g

. . . . . . . . . . . . . . . . . . . . Mathematics

m . 4 . science

n g r e s s

0 . 0 .

0 1 . 0

. a @ * . . . .

. . I *

* a * . . . . . i a n )

Page 3: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

General

C U R R E N T T R E N D S 1 N L I N G U I S T I C S

Thomas. A , Sebeok, E d i t o r Research Centex for t h e Language Sciences

Indiana university

Associate Editors: Ar thur S. Abramsun, Dell Hymes, flerbert Rubenstein

Edward Stankiewict

Assistant Edi tor : Bernard Spolsky

Assistants t o the Edi tor : Alexandra Di Lugl io Lucia Hadd Zoercher

iY0UTUN

The Hague P a r i s

1 9 7 4

CONTENTS

Master List of Abbreviations . . . . . . . . . . . . . . XI11

PART ONE: LINGUISTICS AND PHILOSOPHY

. . . . . Linguistics and Philosophy, by J. M. E. Maravcsik

On Logic and Theoretical ~inguistics , by Yehoshuq Bar-Hille!., Jonathan Malino, ~ v i s h a i Margalit . . . - 37

and Semantics, Euaenio Coseriu and

Page 4: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Paralinguistics, David

Facia l ~xpression and sady Movement, by Harvey 0 . Sarles . Proxemics, by 0.' Michael Watson , . . . . . . . . . . . . Classification and ~escription of Sign Languages,

by William C . Stokoe, Jr , . , . . . . . . . . . . . . , Writing and Writing Systems, by George L. Trager . . . , Speech Surroghtes : Drum and Whistle Systems,

by Donna Jean Umiker , . . . . . . . . . . . . . , . , Formalized Languages: Scientific,

by Sanda Golopentia-Eretescu . , , . . . , , . . . . , Zoosemiotics: Ethology and the Theory of S igns

by W. John Smith . . , . . . . . . . . . . . . . . . . PART T H E E : LINGUISTICS AND THE VGEBAL ARTS

Structural Poetics and Linguistics , by Edward Stankiewicz . Linguistics and Folkloristics, by William 0. Hendricks . . F o l k Poetry: General Problems, by V. N . Toporov . . . . Folk Poetry: ist tory and Typology, by K. Horalek . , . . . F o l k Narrative, by Dorothy Clement and Benjamin N. Colby . Growth of the .Theoretical Framework of Modern Poetics,

by Vyacheslav V. Ivanov. . . . . . . . . . * . . , , . . Theoretical Poetics in the Twentieth Century ,

b y F . S v e j k o v s k y . . . . . . . . . . . . . . . . . . . Rhetoric and Stylistics, by P . Guiraud . . . . . . . . . Literary Genres, by Tzvetan Todorov . . . . . . . . . . .

New Devices

PART FOUR: SPECIAL LANGUAGES

for Linguistics, Maurice Gross

Page 5: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

PART SIX: L'INGUISTICS AND PSYCHOLOGY

~sycholinguisti~s: An Overview, by Herbert Rubenstein, . . 1 0 7 1

An Historical View of ~sycholinguistics , by Arthur L. Blurnenthal . . . . . . . . . . . . . . , 1 1 0 5

Some Aspects of Language Acquisi t ion, by Ursula Bel lugi . 1 1 316

The Interact ion of Perception and Linguistic Structures: A Pre l imina ry ~ n v e s t i g a t i o n of Neo-Functionalism, by T. G. Bever . . . . . . . . . . . . . . . . . . . . 1159

Syntactic Factors in Memory, by Samuel Fillenbaum . . . 1235

Semantics and Comprehension, by Herbert H. Clark . . . . 1 2 9 1

Social Perception of Speech, by Moshe Anisfeld . . . . . . 1 4 2 9

PART SEVEN: ANTHROPOLOGY AND SOCIOLOGY

Anthropology and Sociology: An Overview, by Dell Hymes 1 4 4 5

Some New Developments in ~thnosemantics and the Theory and Practice of Lexical/Semantic Fields, by Oswald Werner, with William Hagedorn, George Roth, Emile Schepers, and Luis U2iart-e . . . . . . . . . . . . . . . . . . . . . 1 4 7 7

Social Class, Language, and Socialisation, by Basil B. Bernstein . . . b . . e . . . . . . . . . . . . . . 1545

Ethnomethodolagy, by Aaron V. Cicourel . . . . . . . . . 1563

S o c i o l i n g u i s t i c s , P r i de

The Sociology of Language: An Interdisciplinary Social Science Approach t o Language in Socie ty , by Joshua A. Fishman . . * . I . C . . . . . . ~ . . 1 6 2 9

PART EIGHT: LINGUISTICS AND ECONOMICS

L i n g u i s t i c s and Economics, by Ferruccio Rossi-Landi . . . 1 7 8 7

PART NINE : LINGUISTICS AND EDUCATION

Page 6: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER
Page 7: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

PART THIRTEEN: LINGUISTICS AS A PILOT SCIENCE

. . . . ~inguistics as a P i l o t Science, by Solomon Marcus 2 8 7 1

Specialty Trends i n the Language Sciences, by Paul L. Garvin . . . . . . . . . . . . . . . . . . . 2889

Indexes . . . . . . . . . . . . . . . . . . . . . . . . . 2 9 3 1 Index of Topics Index of Names Index o f Languages

Page 8: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

General

I N F O R M A T I O N P R O C E S S I N G 7 4

PROCFEDINGS OF I F I P CONGRESS 74 S t o c k h o l m , A u g u s t 5 - 1 0 , 1 9 7 4

Jack L. Rosenfeld, Editor Computer Sciences Department

IBM Thomas J , Watson Research Center

North-Holland Publishing Company Amsterdam & New York

I974

PARTIAL CONTENTS

Data communications and public networks: G. C. Allery

Composing music a n d generating sound by computer. P. Barbaud

~ o c i a 1 i m p l i c a t i o n s of computer t e chdo logy . H. Borko

A pr:oqramming methodology f o r opera t ing sys tern desigrt . P. Brinch Hansen

Recent i n v e s t i g a t i o n s i n r e l a t i o n a l d a t a b a s e systems. E. Codd

Rea l - t ime computer a n i m a t i o n , C . A. Csuri

Cost and benef i t s of i n f o r m a t i o n systems. J. C. Emery

E x t e n s i b l e l a n g u a g e s . B. A . Gallsr

Computer e x p e r i e n c e with se lecbed s e c o n d a r y a n d primarg s c h o o l c h i l d r e n . D, S. Headerson

The i m p a c t o f LSI t e c h n o l o g y on cemputer systems. G. B . Herzog

Complexi ty o f computer c o m p u t a t i o n s . J. Hopcroft

R e s o u r c e allocation i n computer systems and computer-communication n e t w o r k s . L. Kleinrock

~ n f o r m a t i o n s y s t e m s . B. Langefors

Page 9: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

I N F O R M A T I O N PROCESSING 74.

PARTIAL CONTENTS

Current and fu ture t rends i n d a t a base management systems. T. W. Olle

Two-level grammars in a c t i o n . J. E. L. Peck

Alphabetic and numeric d a t a processing: a view from t h e h u m a n i t i e s . J, Raben

Theoretical impedimefits t o artificial i n t e l l i g e n c e . M. 0. Rabin

Systems programming a s an emerging d i ~ c i p l i n e . G . Seegmdller

M u 1 t i p l e x i n g problems i n conpu ter communications. J. Seidler

S o f t w a r e implementation s tudies : problems a n d p ro spec t s . M, R, Shura-Bura

On t he des ign of programming l anguages . N. Wirth

Page 10: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

General

T H E P R A G U E B U L L E T I N O F

M A T H E M A T I C A L L I N G U I S T I C S

TABLE OF CONTENTS

Language types in c lass ic and new typology. Die Sprach typen in der k l a s s i s c h e n u n d der n e u r e n Typologie

. . . . . . . . . . . . . . . . . . . . . . . . P. S g a l l

On one type of dependency grammars A. Goralcikova . . . . . . w . . . + . . . . . . . l l .

Gaifman showed that in a c e r t a i n theory of dependency -

the number of dependents at a node could not exceed an integer f ixed fo r each grammar. Fitialov suggested oriented grammars, rewrite grammars with a governor marked in each rule; obviously such a grammar does n o t suffer Gaifman's limitation. A specially ordered grammar d iv ides rules i n which t h e symbol on t h e l e f t occurs in the string on the right i n t o recursive rules, which an be appl ied t o t h e i r own output, and pseudo- recursive rules which cannot. SO grammars a r e weakly equivalent t o CF grammars.

Questions of graphs and automata i n a generative descr ip t ion of language. - M. Piatek . . . , . ~ . . . .

2-grammar der ives a dependency tree from a s t a r t symbol by rules of six types: (1) replace a node w i t h a governor and one dependent; ( 2 ) change the l a b e l a t a node; ( 3 ) replace the labels of a gover- nor and one dependent simultaneously; (4) change the label of a terminal node; ( 5 ) change t h e label a t t h e origin; (6) move a aependent across i t s gov- ernor from l e f t - t o - r i g h t o r from right-to-left.

Page 11: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

LANGUAGES AMONG COMPUTERS r MACH I NES AN I MALS AND MEN

Lawrence M. Clark

Computers a n d Peop le , 24 , 1 , J a n u a r y 1 9 7 5 , 7 - 1 3

Reports )on a number o f aspects of language, discussea some significant problems of designation o f meaning, and indicates some probable f u t u r e developments i n language. Computers make extensive use of language t o fulfill t h e i r functions. To place computer languages i n the perspective of languages i n general i s h e l p f u l .

DECODING METHODOLOGY AS A TOOL FOR LINGUISTIC RESEARCH Methode de d e c h i f f r a g e , o u t i l de recherche en P i n g ~ i s t i g u e

B. V. Suhotin Russian Language Institute Mas cow

T . A , I n f o r m a t i o n s , 1 9 7 4 , 2, 3-43

These methods of analys is are among those t h a t w i l l work f o r any language without p r i o r knowledge other than what i s gained from linguisticalLy p r i o r analyses. The examples presented are algorithms f o r (1) c l a s s i f i c a t i on of letters i n t o vowels and consonants, ( 2 ) morpheme c l a s s i f i ca t ion , ( 3 ) determining the structure of simple phrases, ( 4 ) phonet ical ly t r a n s c r i b i n g s y l l a b i c le t ters , (5 ) determining the pronunciation of l e t t e r s .

Page 12: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

COMPARISON OF THE FORMANT SPACES OF RETROFLEXED AND

NON-RETROFLEXED VOWELS 0

Ir is Kameny

I E E E T r a n s a c t i o n s on A c o u s t i c s , S p e e c h a n d S i g n a l Processing ASSP-23, 1 9 7 5 , 5 8 - 9 9

The formant 1 ( F l ) and fa rmant 2 (F2) t r equency movements o f vowels n e x t t o /r/ are compared w i t h t he same vowels n e x t t o o t h e r consonants . With t h e e x c e p t i o n of /i/ t h e e f f e c t o f i n i t i a l /r/ on t h e fo l l owing s y l l a b l e n u c l e i i s minimal. The e f f e c t of f i n a l /r/ on the S y l l a b l e n u c l e i p r eced ing it i s a p p r e c i a b l e . Algor i thms are p o s t u l a t e d t o d e f i n e a r e t r o f l e x e d vowel space for vowels preceding /r/ i n t e ~ m s of the n o n - r e t r o f l e x e d vowel space.

Ingo R. Titze Dept. of Phys l c s & Astronomy Br~gham Young U n i v e r s i t y Provo, Utah

P h o n e t i c a 2 8 , 1 ' 2 9 - 1 7 0 , 1 9 7 3

A mathemat ica l model f o r d i g l t a l computer s l m u l a t l o n of human-like u t t e r a n c e s 1s developed. The o v e r a l l sys tem c o n s i s t s o f a p e r i o d s t r u c t u r e of 1 6 coupled masses for each of t h e v o c a l c o r d s , an 18 - sec t i on c y l i n d r i c a l t u b e approglmat ion of t h e pharynx and mouth, and a s i m i l a r 12 - sec t i on n a s a l t r a c t . S p e c i a l care has been t aken t o model s e p a r a t e l y t h e f u n c t i o n s of t h e voca l l igament t,he v a c a l r c muscle , and t h e mucosa. S imula ted phonat ion i~ modal, mixed and f a l s e t t o r e g i s t e r s i s p o s s i b l e . The pa ramete r s whleh c o n t r o l che n a t u r e of t h e phona t ion a r e l ung p r e s s u r e , e x t e r n a l t e n s i o n a p p l i e d t o ligament, v o c a l i c , and mucosa, and t h e in-bernal muscuLar a c t i o n of t h e v o c a l i s . Ap- p l i c a t i o n s are c l t e d I n a r e a s which i n c l u d e phys io logy , pa tho logy and pedagogy.

Page 13: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Phonetics

OFF THE HOOK

Gerald C. Keil Leeds University England

Computers and the Hurnan i t i e .~ 8 , 4 , 2 1 7 - 2 2 9

The IMPAC pro jec t of the Survey of English Dialects has developed a system for the machine representation of narrowly t r a n s c r i k d phonetic data. The external machine representation seeks t o maintain same proximity t o the IPA system and t o have the minimum number of symbols used t o represent each phone. The in te rna l code can be considered as a matrix i n which members of each row o r column share a common property. An internal pro- perty table expresses t h e characterist ics of each phone.

COMPUTER CONTROLLED RADIOGRAPHY FOR OBSERVATION OF MOVEMENTS OF

ART1 CULATORY AND OTHER HUMAN ORGANS

0. Fujimura, S. Kir i tan i and H. I sh ida Research Institute of Logopedics and Phoniatrics, Facul ty of Mediclne Univers i ty of Tokyo

Computers in B i o l o g y and Medicine, 3 , 3 7 1 - 3 8 4 , 1 9 7 3

On-line computer cont ro l of a f l y i n g spot X-ray microbeam generator is proposed f o r subskantial reduction of r a d i a t i o n dose and automatic processing of radiographic da ta . A small X-ray microbeam generator was used i n a p l l o t s tudy . Prel iminary ex- periments have demonstrated its applicability i n studies of ar- t i c u l a t o r y gestures and cerebral blood flow measurements. Moni- t o r ihg of the pos i t i on of a fiberscope i n the pharynx d u r i n g speech uttezances has been tested i n r ea l time succ ssfully w i t h 8 use of an integrated dose of approximatelv 1 6 mR cm /min a t an

Page 14: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Joyce Friedman Department o f Computer and Communication Sciences University of Michigan Ann Arbor

I E E E T r a n s a c t i o n s on Acoustics, Speech , a n d S i g n a l Process i o h , ASSP-23, Februa ry 1975, 1 0 0 - 1 0 3

A s e t of fast-speech rules has been tested on the computer us ing the phonological grammar tester (PGT) program of Friedman apd Morin. We examine the types of difficulties encountered i n the rules and discuss ways i n which t he program can be made more useful for studying f ast-speech rules.

Page 15: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Speech r e c o g n i o i o n -

S Y S T E M FOR A C O U S T I C - P H O N E T I C ANALYSIS OF CONTINUOUS SPEECH

C l i f f o r d J . Weins t e in and V f c t o r W . Zue Gtephanie S. k c c a n d l e s Department o f E lec t r i ca l L e e F. Mondshein E n g i n e e r i n g MIT L i n c o l n Daboratory M.1.T ~ e x i n g t o n , Plass Cambridge, M a s s

I E E E T r a n s a c t i o n s on A c o u s t i c s , Speech, and S i g n a l P r o c e s s i n g ASSP-23, F e b r u a r u 1 9 7 5 , 5 4 - 6 7

Spectrum a n a l v s i s v i a l i n e a r p ~ ~ e d i c t i o n , c o m ~ u t a t i o n of p a r a m e t e r s of the spectrum and fundamental frequency e x t r a c t i o n . p r e l i m i n a r y 'segmentation and classification v i e l d s cateqories of vowel; volume d i p w i t h l n vowel; f r l c a t l v e ; s t o p The d e c i s i o n tree is base6 onVenergy measurements i n s e l e c t e d f r equency bands , d e r i v a t i v e s and r a t i o s o f these measurement$, a v o i c i n g d e t e c t o r , and a f e w e d i t i n g r u l e s . More d e t a i l e d c l a s s i f i d a t i o n of d i p h - t h o n g s , semivowels , and nasals; d e t e c t e d vowel segment t o stored formant p o s i t i o n s i n a speaker -normal ized vowel t a b l e ; a f r i c a t i v e i d e n t i f i e r , which employs measurement o f r e l a t i v e s p e c t r a l e n e r g i e s i n seve-fal bands t o group t h e f r i c a t i v e segments i n t o phoneme- l i k e c a t e g o r i e s ; s t o p consonant c l a s s i f i c a t i o n based on t h e pro- p e r t i e s of t h e p l o s i v e b u r s t .

J0hn.W. Black, Sadanand Singh and E l i z a b e t h Janocosek Department Of Speech Communication Ohio State U n i v e r s i t y , Columbus

Report No. T R - 1 6 , M a r c h 1 9 7 4 . AD-776 6 4 9 / 6 G A

Acous t i c r e c o r d i n g s w e r e made of 31 ' d o u b l e t 1 consonant- c l u s t e r s w i t h f i v e vowels by 1 2 s p e a k e r s , The p a i r s of s y l l a b l e s w e r e heard by twe lve l i s t e n e r s who a s s l g n e d v a l u e s t o t h e a u r a l d i f f e r e n c e s between each p a i r i n t h e m a n n e r o f magnitude e s t i m a - t i o n ' . The c l u s t e r s w e r e treated as two g r o u p s , 1 8 n o n - s l b i l a n t c l u s ~ a* M s i - b i l a n t clusters. The r e s p o n s e s of e a c h l i s t e n e r became t h e d a t a f o r multidimensional a n a l y s i s . your -d imens iona l space proviCied t h e most efficient a n a l y s i s f o r b o t h sets of d a t a . The i n t e r p r e t a t i o n s of t h e s e dlrnenslons w e r e i n t e r m s of the fea - tures e i t h e r of t h e f i r s t o r o f t h e second member of t h e consonali t c l u s t e r s . I n t h e i n s t a n c e of t h e n u n - s i b i l a n t c l u s t e r s on dimen- s i o n one the p e r c e p t u a l f e a t u r e was de te rmined by t h e g roup ings of the second members, on dimensions two and t h r e e by the f x r s t mem- b e r s .

Page 16: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Speech R e c o g n i t i o n

PERCEPTUAL CONTINUOUS SPEECH RECOGNITION

H. Yi l rnazI L Ferber , W. Park, H. K e l l e t t , ahd E . Koprucu Perception Technology Corporation Winchester Mass

R e p o r t No. RADC-TR-74-180, J u l y 1374

The objective i s t o s t u d y and i n v e s t i g a t e the r e c o g n i t i o n of c o n n e c t e d speech composed of a c o n t e x t - f r e e l i m i t e d v o c a b u l a r y A new m e t h o d of s e g m e n t a t i o n i s based on t h e r e c o g n i t i o n o f vowels and vowel-like p h o n e t i c segments . T h i s i s c o u p l e d w i t h a s p e a k e r t r a n s f o r m a t i o n that maps t h e vowels o f e a c h speaker i n t o a standard space thus r e d u c i n g i n t e r - s p e a k e r v a r i a t i o n s . A m e t h o d of e x t e n d i n g these p r i n c i p l e s t o t h e r e c o g n i t i o n of con- s o n a n t s i s presented. [AD-783 8 9 9 / 8 G A ~ PC $ 3 . 7 5 , MF $2 .253

DIGITIZED SPEECH

J a m e s A . Moorer Depar tment of computer S c ~ e n c e Stanford U n i v e r s i t y S t a n f o r d , California

I E E E T r a n s a c t i o n s on A c o u s i : i c s , S p e e c h , a n d S i g n a l Processing, A S S P - 2 2 , 5 , October 1 9 7 4 , 3 3 0 - 3 3 8

The method i s shown t o be of s i m i l a r a c c u r a c y as t h e Cepstrum t e c h n i q u e . S i n c e the method i n v o l v e s o n l y a d d i t i o n s , no m u l t i p l i c a t i o h , lt i s shown to be f a s t e r than the S I F T a l g o r i t h m . T h e basis of t h e ~ r ~ e t h o d is searching fo r a m i n i m u m i n the magni tude of the d i f f e r e n c e between a speeeh segment and a d e l a y e d speech seoment. T h i s i s shown t o be e q u i v a l e n t t o selecting t h e comb filter which bes t a n n i h i l a t e s t h e l n p u t srg- nal. T h e c o m p u t a t i o n a l c o m p l e x i t y of the Cepstrum t e c h n i q u e thus i s p r o p o r t i o n a l t o N * log N where N i s t h e number of points In t h e window i n q u e s t i o n .

Page 17: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Speech r ecogn i , t i on

WHERE THE PHONEMES ARE: DEALING WITH AMBIGUITY IN ACOUSTIC-

PHONETIC RECOGNITION

Richard Schwartz and John Makhoul B o l t Beranek and Newman Inc . Cambridge, Mass

I E E E T r a n s a c t i o n s of; A c o u s t i c s , S p e e c h , and S l g n a l P r o c e s s i n g ASSP-23, 1975, 50-53

Errors i n a c o u s t i c p h o n e t i c r e c o g n i t i o n occur n o t o n l y because of t h e l i m i t e d scope of t h e r e c o g n i t i o n a l g o r i t h m , but a l s o because c e r t a i n a m b i g u i t i e s a r e i n h e r e n t i n a n a l y z i n g t h e speech s i g n a l . Examples of such a m b i g u i t i e s i n segmentation and f e a t u r e e x t r a c t i o n are g iven . A l a t t i c e r e p r e s e n t a t i o n of t h e segmenta t ion a l lows f o r m u l t i p l e c h o i c e s t h a t can be s o r t e d o u t by higher l e v e l pi-ocesses.

La r ry L. P f e i f e r Speech Communications Research Lab I n c . S a n t a Barbara, C a l i f o r n i a

R e p o r t No RADC-TR-74-214, A u g u s t 19 74

The o b j e c t i v e i s t o de te rmine if a sample can be a s s o c i a t e d w i t h r e f e r e n c e t a l k e r s . The method of comparing f e a t u r e v e c t o r s from i n d i v i d u a l sound e lements w a q chosen for exper iments u s l n g t h e i n v e r s e f i l t e r a n a l y s i s t echnique ( t h e a u t o c o r r e l a t i o n method of l i n e a r p r e d i c t i o n ) . Ten m a l e t a l k e r s s u p p l i e d speech samples band l imi t ed t o 3250 Hz. T h i r t e e n sound u n i t s , 1 0 vowels and 3 n a s a l s , w e r e s t u d i e d . Many a d d i t i o n a l i d e n t i f i c a t i o n tests were p e r f o m e d f o r t h e purpose of e v a l u a t i n g d i r f e r e n t d i s t a n c e f u n c t i o n s and d i f f e r e n t f e a t u r e v e c t o r s . [AD-787 860/6GA; PC $5.25, MF $ 2 2 5 1

Page 18: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Beatrice T. Oshika Victor W. Zue Rollin V. Weeks Joseph Aurbach Helene Neu Speech Communications M.I.T, Lincob System Development Research Laboratory Laboratory Corporation

Santa Barbara, C a l . Lexington, Mass Santa Monica, Cal,

I E E E T r a n s a c t i o n s on A c o u s t i c s , Speech, and S i g n a l P r o c e s s ~ n g ASSP-23, F e b r u a r g 1 9 7 5 , 104-112

This paper presents some phonological rules which describe systematic pronunciation variation occurring in natural continuous speech. It is argued that a speech understanding system must aqcount for such variation by incorporating phonological rules, either implicitly or explicitly, into the system. Spectrographic evidence for the phonological phenomena described by the rules is included,

David J. Broad Speech Communications Research Laboratory Santa Barbara, California

Report No. AFOSR-TR-74-0582, F e b r h a r y 1974

Theory of phonology: a theory of symbolization, a large compute'r-based quasi-phonemic/orthographic dictiona~y of American English, dialect description, and ?.he fomaLization of a functional phonemic theory. Logical procedures for the interpretation of acoustic phonetic data: a massive investigation of formant frequency transitions in CVC syllables as well as an analysis of the segment durations in the same syllables: the use of formant frequency infor- mation in automatic speech recognition; segmentation using formant dynamics and the sources of formant frequency variability; the re- lations between applied basic problems In speech and language.

Page 19: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Speech r e c o g n i t i o n

SYLLABLE AS A UNIT OF SPEECH RECOGNITION

Osamu Eujimura B e l l L a b o r a t o r i e s Murray H i l l , , N . J .

I E E E Transactions on Acoustics, S p e e c h , a n d S i g n a l Processing ASSP-23, F e b r u a r y 1 9 7 5 , 8 2 8 7

Basic problems involved i n a u t o m a t i c r e c a g n i t i o n of c o n t i n - uous speech are d i s c u s s e d w i t h r e f e r e n c e t o t h e r e c e n t l y developed t e m p l a t e matching t echn ique u s i n g dynamic programminq. I r r e g u l a r - i t i es i n p h o n e t i c m a n i f e s t a t i o n s of phonemes are d i s c u s s e d and it i s a rgued t h a e the s y l l a b l e , p h o n o l o g i c a l l y r e d e f i n e d , w i l l s e r v e as the e f f e c t i v e m i n i m a l u h i t i n t h e t i m e domain. E n g l i s h s y l l a b l e s t r u c t u r e s a r e d i s c u s s e d from t h i s p o i n t o f view u s i n g t h e n o t i o n s of " s y l ' l a b l e f e a t u r e s " and "vowel a f f i n i t y " .

A DESCRIPTION OF A PARAMETRICALLY CONTROLLED

MODULAR STRUCTURE FOR SPEECH PROCESSING

N. Rex Dixdn and Harvey F. Si lverman Computer, S c i e n c e s Department IBM Thomas J, Watson Research Cen te r Yorktown Heights, N.Y.

I E E E Transactions on Acoustics, S p e e c h , a n d Signal Processing A S S P - 2 3 , F e b r u a r y 1 9 7 5 , 8 7 - 9 1

The modular acoustic p r o c e s s o r (MAP) has been des igned fo r speech r e c o g n i t i o n . The p a r a m e t r i c a l l y o o n t r o l l e d ( s p e c t r a l ) a n a l y z e r ( P C A ) , serves as i n p u t t o an h i e x a r c h i c a l l y o p e r a t e d s t r i n g t r a n s c r i b e r (HOST). PCA allows p a r a m e t r i c s e l e c t i o n of seve . ra l a n a l y s i s methods, i n c l u d i n g d i s c r e t e F o u r i e r t r a n s f o r m , l i n e a r p r e d i c t i v e coding , and c h i r p z - t ransform ( C Z T ) , and of srnaothing, norrnalizat ' ion, i n t e r p o l a t i o n , and Fo e s t i m a t i o n methods. PCA deve l - ops s p e c t r o g r a p h i c r e p r e s e n t a t i o n s and per forms s p e c t r a l - s i m i l a r i t y matching and t r a i n i n g . HOST does segmen ta t ion , c l a s s i f i c a t i o n , and prosody a n a l y s i s . PCA i s a packaged, debugged, running system. A f i r s t v e r s i o n of H O S T i s o p e r a t i o n a l .

Page 20: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Speech r e c o g n i t i o n

REAL-TIME LINEAR-PREDI CTIVE CODING O F SPEECH ON THE SPS-41 TRI PLE-MI CROPROCESSOR MACHINE

Michael J . Knudsen Computer Sc ience Department Carnegie-Mellon U n i v e r s i t y Pittsburgh, PA

I E E E T r a n s a c t i o n s on Acoustics, Speech, a n d S i g n a l P r o c e s s i n g ASSP-23,, February 1 9 7 5 , 140-145

SPS-41, a commercially a v a i l a b l e s y s t e m , i s composed o f t h r e e d i s s i m i l a r micro-processors working i n p a r a l l e l . Using wser -wr i t t en microcode, one p r o c e s s o r performs 1/0 and maste r c o n t r o l , t h e second hand les loop index ing and coun t ing , and t h e t h i r d does t h e a c t u a l a r i t h m e t i c on d a t a . Such p a r a l l e l i s m a l l ows 2 x l o 6 1/0 o p e r a t i o n s and 4 x l o 6 m u l t i p l i c a t i o n s / s , b u t a c t u a l l y ~ e a l i z i n g t h l s p o t e n t i a l r e q u i r e s f r e s h approaches t o some o l d a lgo r i t hms . Most impor tan t i s a new a u t o c o r r e l a t i o n scheme. The p r e s e n t prognam c o n v e r t s frames of 2 5 6 1 6 - b i t samples i n t o 1 4 co- e f f i c i e n t s and t hen i n t o 128 p o i n t s of l o g a r i t h m i c power spectrum a t 100 f rames/s .

NOISY PHONETIC REPRESENTATION INTO STANDARD ORTHOGRAPHY

C. C . Tappext Speech P roces s ing Group IBM Thomas J. Watson Research Cen te r Yorktown ~ e i g h t s , N . Y .

I E E E T r a n s a c t i o n s on A c o u s t i c s , S p e e c h , a n d S z g n a l P r o c e s s i n g A S S P - 2 3 , F e b s u a i q y 1 9 7 5 , 129-134

A 250-word l e x i c o n and a f i n i t e - s t a t e grammar s p e c i f y t h e tree. The s e a r c h i s performed i n a b e s t - f i r s t manner. Phone t i c v a r i a n t s f o r . e a c h word are gene ra t ed automatical1.y by a s e t o f phono log ica l r u l e s - S u b s t a n t i a l imprbvement over e a r l i e r p e r f o r - mance on t h e same d a t a waS r e a l i z e d .

Page 21: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Speech recognition

APPLIED TO SPEECH RECOGNITION

Fumitada Itakura Acoustics Research Department h Rlectrical Communications Lab Bell Laboratories Nippon Telephone & Telegraph Murray Hill, N.J. Public Corporation

Musashino , Tokyo

IEEE T r a n s a c t i o n s on A c o u s t i c s , S p e e c h , and S i g n a l Processi 'ng A S S P - 2 3 , February 1 9 7 5 , 6 7 - 7 2

Isolated words, spoken by a designated talker, are recog- nized through calculation of a minimum prediction residual. A reference paktern for each word is stared as a time pattern of linear prediction coeffi~ients (LPC). The total log prediction residual of an input signal is minimized by optimally register- ing the reference LPC onto the input autocorrelation tmefficients. The input signal is recognized as the reference word which pro- duces the minimum prediction residual. In a 200-word recognition experiment, the recognition rate for a designated male talker is 97.3 percent for telephone input, and the recognition time is about 22 times real time.

Neil J. Miller Artificial Intelligence Laboratory Department of Computer Science Stanford University Stanford, California

I E E E T R A N S A C T I O N S ON A C O U S T I C S , S P E E C H , A N D S I G N A L P R O C E S S I N G A S S P - 2 3 , February 1 9 7 5 , 7 2 - 7 9

An algorithm determines fundagental frequency by segmenting the signal into pitch periods. Segmentation is achieved by ident- ifying the beginning of each pitch period. Segmentation has three phases. First, using zero crossmg and energy measurements, a data structure is constructed. Next, the number of candidate pitch period markers is reduced utilizing syllabic segmentation, coarse pitch frequency estimations, and discrimination functions. Finally, the remaining markers are corrected. This algorithm processes both male and female speech, provides a voiced-unvoiced decision, and operates in real time on a medim speed, general purpose computer.

Page 22: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Speech R e c o s n i t i o n

A PHONETIC-CONTEXT CONTROLLED STRATEGY FOR SEGMENTATION AND PHONETIC LABELING OF SPEECH

Paul Mermels te ln Haskins L a b o r a t o r i e s New H'aven, Conn.

I@E T r a n s a c t i o n s on A c o u s t i c s , S p e e c h , a n d S i g n a l P r o c e s s i n g A$SP-23,. February 1 9 7 5 , 7 9 - 8 2

I n a s e q u e n t i a l S t r a t e g y p r o c e s s e s are a p p l i e d t o a l a b e l e d speech segment and r e s u l t i n a p o s s i b l e subsegmenta t ion ; t h e subsegments are l a b e l e d by t h e p r o c e s s . No more segments are c o n s i d e r e d t h a n t h o s e a c t u a l l y d i f f e r e n t i a t e d by t h e a n a l y s i s s t e p s . The e x t r a c t i o n of a c o u s t i c cues p e r t i n e n t t o a p h o n e t i c f e a t u r e can be tuned t o classes o f sounds s e p a r a t e d on t h e b a s i s of o t h e r cues, i n c r e a s i n g t h e r e l i a b i l i t y o f segment l a b e l i n g . The a n a l y s i s sequence y i e l d s a s t r u c t u r e f o r t h e s y l l a b i c u n i t s of t h e speech s i g n a l t h a t can be used t o r e t r i e v e s i m i l a r syL- l ab i c u n i t s for detailed comparison.

CLASSIFICATION PERFORMANCE FOR MULTIPLE SYSTEMS

Harvey F. S i lverman and N . Rex Dixon Speech P r o c e s s i n g Group IBM Thomas Jv Watson Research Cen te r Yorktown H e i g h t s , N . Y .

I E E E T r l a n s a c t i o n s on A c o u s t i c s , S p e e c h , a n d S i g n a l Processing, A S S P - 2 3 , February 1 9 7 5 , 9 2 - 3 9

The sys tem p r o v i d e s for c o n c u r r e n t o b j e c t i v e e v a l u a t i o n o f up t o five methods a g a i n s t a s i n g l e r e f e r e n t . F o r segmenta- t i o n , t h e e v a l u a t o r p r o v i d e s f i r s t - o r d e r s t a t i s t i c s , a t the p h o n e t i c , class and summary l e v e l s , f o r f o u r t y p e s of e r r o r s : Missed, A d v e n t i t i o u s , Misplaced , and A d v e n t i t i o u s and misp laced e v e n t s . For c l a s s i f i c a t i o n , t h e e v a l u a t o r g i v e s con fus ion mat: r ices a t t h e p h o n e t i c , class and summary l e v e l s . The s y p s t i l l i n t h e developmenta l p r o c e s s , i s o p e r a t i o n a l a r u b m r ~ w t l y used.

Administrator
Note
Not Clear in the Film
Page 23: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Speech Synthesis

W O A. Ainsworth Communication Department University of .Keele Keele, Staffordshire, U.K.

I n t e r a a t i o n a l Journal of Man-Machine Studies 6 , 493-511, 2974

A string of phonetic symbols representing the sentence to be uttered is transformed into the control signals required by a parametric speech synthesizer using a small digital computer. The performance of the system was investigated by listening tests. In the first set of experiments consanant-vowel syllables were synthesized, and presented to listeners for identification. The vowels were readily.identified, but the fricatives less so- In the second set of experiments the intelligibility of synthesized sentences was examined. It was found that after about an hour of transcribing the sentences, listeners identified about 90% of the words correctly.

A PROGRAMMING SYSTEM FOR STUDIES IN SPEECH SYNTHESIS

P. V. S. Rao, R. B. Thosar Tata Institute for Fundamental Research Bombay,

IEEE Transactions on Acoustics, Speech, and Signal Processing, ASSP-22, 3 , 217-225, 1974

This paper describes a speech synthesis system which is particularly suitable for experimental investigations. The syn- thesis is accomplisfied in two stages. The concatenation stage gen- erates a schematized spectrographic representation corresponding to the symbolic input. The second stage consists in generating the corresponding acoustic signal. he-steady state characterization of each phoneme is supplied as data. Independent concatenation procedures incorporate context dependent effects such as format transitions, changes in the normal duration of vowels, etc. The parameter valhes f o r these procedures are obtained by a set of rules. Applicability of a rule is determined by attributes as- signed to the phonemes.

Page 24: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Orthography A

A THEORETI C A L APPROACH FOR CHARACTER RECOGN ITION BASE^ ON PHENOMENOLOGICAL ATTRIBUTES

B. Blesser, R. Sh i l lman , T. K u k l i n s k i , C . Cox, M . Eden and J . V e n t u ~ a Research L a b o r a t o r y of F l e c t r o n i c s Massachuse t t s I n s t i t u t e o f Technology Cambridge, Mass.

I n t e r n a t i o n a l Jogrna l o f Man-Machine S t u d i e s , 6 , 7 0 1 - 7 1 4

A t h e o r y based on a m b i g u i t i e s , r a t h e r t h a n on t h e clas- s i c a l a r c h e t y p a l shape o f l e t t e r s , l e a d s t o a l g o r i t h m s which w i l l per form more a c c u r a t e l y . L e t t e r s a r e d e s c r i b e d s n t e r m s o f an abstract set o f f u n c t i o n a l a t t r i b u t e s , each of which can be re- l a t e d t o a t y p e of ambiguity between two le t ters . The r e l a t i o n s between t h e f u n c t i o n a l a t t r i b u t e s , whlch s p e c l f y t h e l e t t e r ' s i d e n t i t y , and the p h y s i c a l a t t r i b u t e s , which are derived from t h e p h y s i c a l image, a r e c a l l e d g r a p h i c a l c o n t e x t r u l e s . These r u l e s can be de te rmined from p s y c h o l ~ g i c a l e x p e r i m e n t a t i o n .

M. R. E i n l e y , Jr. Department of Mathematics U n i v e r s i t y of Lava1 Quebec

P r o c e e d i n g s of the SeconG Open C o n f e ~ e n c e on Information Sclerice ~n Canada, e d l t e d by A . Gamache & R . Penner . O t t a w a : Canadian A s s o c i a t i o n f o r I n f o r m a t i o n Science, 1 9 7 4 , L63-180

The c l a s s i f i c a t i o n problem i s p r e s e n t e d f o r t h e set of 40,000 two-dimensional p a t t e r n s known a s t h e Chinese c h a r a c t e r s . The t r a d i t i o n a l c l a s s i f i c a t i o n a c c o r d i n g t o c e r t a i n meaning p a t t e r n s termed r a d i c a l s i s s k e t c h e d t o g e t h e r w i t h some v a r i a n t s d e r i v e d from it. Using t h e n o t i o n of two-dimensional fo rma l gkamar , a c l a s s i f i c a t i o n i s o u t l i n e d y i e l d i n g a q u a s i - a l g e b r a i c fo rmula f o r e a c h c h a r a c t e r . Also mentioned a r e s p i n - o f f s on t h e development of Chinese t e x t compos i t ion d e v i c e s u s i n g g r a p h i c - d i s p l a y t e c h - n i q u e s and mini-computers .

Page 25: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Concordance

J. H. Waite, R. Boehm, J. G . F i s h e r , S. D . E p s t e i n , D . J . S t e w a r t C r y p t a n a l y t i c Computer S c i e n c e s I n c . Cherry H i l l , N . J

This s tudy of the DDC Phrase Glossa ry i n c l u d e s a computer program t o t a b u l a t e work f r e q u e n c i e s f o r b l o c k s of phrases of op- tional s i , ze s . On t h e b a s i s of t h e s e d i s t r i b u t i o n s , e m p i r i c a l and s t a t i s t i c ~ l a n a l y s e s are made i n c l u d i n g t w o p r e d i c t i o n models. Two-word d i s t r i b u t i o n s are also i n c l u d e d . Based upon t h e a v a i l - a b l e d i s t r i b u t i o n s , a two-word Phrase G1ossar.y s i z e of 320,000 two- word p h r a s e s was dete rmined . Also i n c l u d e d are a n a l y s e s of v a r i o u s t e c h n i q u e s , such as suf,£ix t r u n c a t i o n , imbedded p h r a s e s , and query e f f e o t i v e n e s s . Comparisons are made of t h e DDC sys tem t o o t h e r p l a i n l a n g ~ a g e machine r e t r i e v a l sys tems . [AD-780 957/7GA PC $3 .75 , MF $1 .45 A p r i l 19741

J. L. M i t c h e l l

C o m p u t e r s i n €he H u m a n i t i e s , J . L . M i t c h e l l , E d i t o r , 1 9 7 4 , 1 3 2 - 1 4 5

A s a n e c e s s a r y p r e r e q u i s i t e t o a s y n t a c t i c i n v e s t i g a t i o n of t h e c h r o n i c l e t h e list of eve ry w o ~ d b e t i z e d f requency

£011 of

l i s t

owing ana the corpu , rank of

l y s e s S , cum every

are p u l a t i

word

roduced ve f r e q , cumul

: a l p h a b e t i z e d uency , alpha- a t i v e a b s o l u t e

f r e g u e n c . ~ of e v e r y group of words, p e r c e n t a g e and cumula t ive f r e - quency of t h e t e x t r e p r e s e n t e d by each word and group of words, a concor"dance, a frequency l i s t f o r grammatical c a t e g o r i e s , and t h e t e x t w i t h each word tagged f o r s y n t a c t i c c a t e g o r y .

Page 26: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Concordance

JEUDEMO: A TEXT HANDLING SYSTEM

P. BratLey, S . Lusignon, and F. Oue l e t t e

C o m p u t e r s i n t h e H u m a n i t i e s , J . 5 . M i t c h e l l , E d i t o r , 2 3 4 - 2 4 9 , 1 9 7 4

I n a t y p i c a l t e x t - p r o c e s s i n g t a s k , t h e s t r u c t u r e of t h e text must be d e s c r i b e d , t h e o p e r a t i o n s , w i t h any r e s t r i c t i o n s t o be performed d e f i n e d , and t h e format of r e s u l t s g iven . The p re - s e n t system a l l o w s , f o r t h e f i r s t p a r t , t he d e f i n i t i o n of t h e a l p h a b e t of a c o ~ p u s , t h e word s e p a r a t o r s , t a g s ( f o r homograph s e p a r a t i o n , c a t e g o r y markers , e t c . ) , and t h e language of the t e x t . Allowable ope ra t i on6 are: t h e l i s t i n g of a l l words p re - s e n t ; KWIC concordances; t h e b u i l d i n g o f i ndexes ; t h e s e a r c h i n g f o r words, o r word p a t t e r n s ; and s ea rches a s i n t h e p r ev ious o p e r a t i o n , b u t w i t h r e s t r i c t i o n s t o words of s p e c i f i e d f requency, o r t o s e c t i o n s of t h e corpus .

D. 5 . Koubourl is

C o m p u t e r s i n t h e H u m a n i t i e s , J . L . M i t c h e l l , E d i t o r , 2 2 5 - 2 3 3 , 1 9 7 4

A word-form concordance does n o t c o n j o i n i n f l e c t e d forms o f t h e same lexeme, nor does it s e p a r a t e homographs. By manually e d i t i n g t h e o u t p u t of a word-form concordance f o r t h e s e two phe- nomena and r e s o r t i n g , @ dic t ionary- fo rm concordance i s produced.

Lance S. Smith Brigham Young U n i v e r s i t y

P r o c e e d i n g s o f t h e [ B Y U ] L i n g u i s t i c s S y m p o s i u m , 1 9 7 3

The system has seven b a s i c phases : (1) Entry of source t e x t ; ( 2 ) Main d i c t i o n a r y update ; (3) Crea t ion o f upgraded t e x t f o r p r o c e s s i n g ; ( 4 ) upgraded t e x t p r e - e d i t f o r p roces s ing ; ( 5 ) Pro- d u c t i o n of K W I C concordance; ( 6 ) Product ion of keyword i n ph ra se concordance; ( 7 ) Product ion of word f requency , p a r t s l i s t , r e v e r s e a l p h a b e t i c a l word l i s t , and v a r i o u s s t a t i s t i c s , e . g . average number of words p e r s en t ence . I n ( 2 ) an exhaus t i ve l i s t of words i n t h e t e x t b u t n o t i n t h e d i c t i o n a r y i s produced, and an i n t e r - active program r e q u e s t s in fo rmat ion f o r each new word. Th i s i n - format ion i s merged i n t o t h e main d i c t i o n a r y . I n ( 3 ) in fo rmat ion from t h e d i c t i o n a r y i s appended t o each word of t h e t e x t and a m b i g u i t i e s i e s o l v e d by i n t e r a c t i v e l y i n t e r r o g a t i n g t h e u s e r .

Page 27: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Godelieve L, M. Berry-Rogghe

Computers i n t he Humanit ies , J . L . Mitchell, e d i t o r , 1 6 - 2 6 , 1 9 7 4

A phrasal verb is an idiomatic phrase of verb plus parti- cle, e.g. look after'. The author seeks to automatically con- struct a lexicon of phrasal verbs given an adequately large quantity of data, and statistical procedures.

$he statistical procedure used is 'collocation'--the probability of syntagmatic association of two items occurring separated by n items. An analysis of the particle 'in' shows that verbs from phrasal verbs are mpre closely collocated with this particle than non-idiomatic constituent Verbs.

SHAD : A SHAKESPEARE D I CT I ONARY

M. Spevack, H. J. Neuhaus, and T. Finkenstaedt

Computers i n t h e Humanit ies , J . L . M i t c h e l J , e d i t o r , 111-123, 1 9 7 4

SHAD merges information f ron a concordance of Shakespeare, a computer dictionary (drawn from the Shorter Oxford English Dic- tionary), and data from semi-automatic lemmatization.

Page 28: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

E. R. Maxwell, and R. N . Smith

Computers in t h e H u m a n i t i e s , 9 . L. M i t c h e l l , e d i t o r , 124-131, 1 9 7 4

An autonomous t h e o r y f o r l e x i c a l s t r u c t l l r e , c a l l e d Semant ic l i e l d Theory, i s presented. There i s a set of p r i m i t i v e s (about 2 0 ) : sameness, d i f f e r e n c e , e v e n t s , s t , mot ion , s p a c e , emot ion , e ts . N e u t r a l c o n c e p t s are d e f i n e d by p r i m i t i v e r e l a t i o n s t o t h e p r i m i t i v e s , e . g. , cause, change. A s eman t i c f i e l d (SF) i s faxon8rn- i c a l l y r e l a t e d t o a n e u t r a l concep t . F o r example, t h e semant ic f i e J d 'punch' i s a member of t h e n e u t r a l concep t ' h i t ' , w i t h ' f i s t ' as ' i n s t r u m e n t ' , and ' h i t ' i s an 'event' invol i r ing a mot ion a g a i n s t a n o b j e c t ( o b j e c t b e i n g d e f i n e d as e x p e r i e n c e r ' s body or immediate environment) by a n o t h e r o b ~ e c t , t h e t w o o b j e c t s b e i n g d i f f e r e n t .

A COMMON STRUCTURE FOR L E X I COGRAPH I C DATA

D . Sherman

Computers i n the H u m a n i t i e s , J . L . M i t c h e l l , E d i t o r , 2 1 5 - 2 2 4 , 1 9 7 4

L i b r a r i e s i n t h e U S and t h e UK have developed a s t a n d a r d s t r u c t u r e fo r da ta exchange, termed MARC--MAchine Readable C a t a l o g . Each r e c o r d has a f i x e d l e n g t h l e a d e r o f foymat d e f i n e d by t h e PIARC s t a n d a r d , which g i v e s t h e g e n e r a l r e c o r d s t a t u s and con-krol i n f o m a t i o n . Following t h e l e a d e r i s a table of c o n t e n t s and i n - v e n t o r y of a l l d a t a f i e l d s i n t h e r e c o r d . The d a t a p a r t of a r e c o r d i s d i v i d e d i n t o f i e l d s , each o f which i s tagged by a 3- digit number-; s u b - f i e l d s are headed by a symbol of t h e form $n, where n is a n i d e n t i f i e r code. The sys tem i s used t o encode W e b s t e r ' s Seventh C o l l e g i a t e D i c t i ~ n a r y , g i v i n g t h e WEBMARC file.

Page 29: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Lexicography

THE 'THESEE ' IHESAURUS FOR ELECTRI C I T Y AWD ELECTRON I ES :, DESCRIPTION AND METHOD OF USE ' T h e s e e ' t h e s . 4 u r u s pour 1 ' e l e c t r i c i te et 2 ' e l e c t r o n i q g e : d e s c r i p t i o n e6 m e t h o d e d ' u t i l i z a t i o n

A. DewX!Ze Grenoble

T h i s t r i l i n g u d l t h e s a u r u s , with both orthographic and magnetic tape implementlat ions, contains abou t 1 1 , 0 0 0 terms, Its five indexes are (1) d i c t i o n a r y , ( 2 ) relations of s u b s t i t u t i o n , descriptors w l t h terms, ( 3 ) related t e r m s , ( 4 ) polyhierarchic c lass i f ica t ior ) trees', (5) seman t i c fields.

LEXICQGRAPHY FOR A STRING GRAMMAR OF FRENCH La lexicographic pour u n e grammaire en e h a f n e s d u f r a n c a i s

Morris Sa lko f f and Anne Z r i b i Laboratoire d Automatique Documentaire et Linguistique Universite de P a r i s

R a p p o r t de Rekherches No. 3

The s t r u c t u r e of a dictionary to accompany Salkoff's grammar (cf. AJCL Microfiche 6 : 6 4 ) . Subclasses, s e l e c t i ~ n a l ~ constraints on verbs, t r e a t m e n t of multiple classification, idioms, homonyms, etc, An extensive analysis of the French l e x i c o n .

Page 30: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Charles N . L i , E d i t o r L i n g u ' i s t i c s Program

Univers i ty of C a l i f o r n i a Santa . Barbara

U n i v e r s i t y of Texas Press usk kin and London

TABLE OF CONTENTS

I n f l u e n c e s on word o r d e r change i n American s i g n l a n g u a g e Susan F i s c h e r

Dynamic aspects of word o r d e r i n t h e n u m e r a l c l a s s i f i e r Joseph H. Greenberg

Serial verbs a n d s y n t a c t i c change: N i g e r - C o n g o . Talmy G i v o n

On t h e change f r o m SQY tT, S V O : Evidence f rom Niger Congo L a r r y M. Hyman

A d i s c u s s i o n o f compound and w o r d o r d e r Winfred P. Lehmann

T h e s e m a n t i c f u n c t i o n o f w o r d order: A c a s e s t u d y i n Mandarin Charles N. Li and Sandra A . T h o m p s o n

On some f a c t o r s that affect and e f f e c t w o r d o r d e r Susan Steele

A n e x p l ana t i , o n of d r i f t Theo Wennemann

Order i n b a s e s t r u c t u r e Emrnon Bach

T h e p r e s e n t a t i v e movement, o r w h y t h e i d e a l w a r d o r d e s . is V.S.0.P. R o b e r t H e t z r o n

On the e x p l a n a t i o n of consti tuent o x d ~ r u n . i v e r s a l s Gerald S a n d e r s

Verb-anchor ing a n d verb m o v e m e n t Arthur S c h w a r t z

ISBN 0-292-79002-3 LC Card 74-17620

Page 31: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Grammar - A SYSTEM FOR AUTOMATI c INFLECTIONAL ANALYS I s

IMPLEMENTED FOR RUSSIAN

Anna-Lena S a g v a l l

A l m q v i s t & W i k s e l l S t o c k h o l m

1973

P a r t I. O n au toma t i c test a n a l y s i s . . . . . . - - . . - 1 3

1. Xntroduct ion . . . . , . . . . . . . . . . . . . 1 3 2 . General c o n s i d e r a t i o n s concern ing t h e c o n s t r u c t i o n

of a system for automatic t e x t a n a l y s i s . - . 13 3. Some comments on t h e development of systems f o r

aq toma t i c t e x t a n a l y s i s . . . . . . . . . . . . . 16

P a r t 11. Designing a system f o r au toma t i c i n f l e c t i o n a l a n a l y s i s of Russian t e x t s . . . - . . . . . . . . 19

Background t o t h e c o n s t r h c t i o n a£ a system f o r Russian inflectional a n a l y s i s . . . . . . . . . . 1 9 S p e c i f y i n g the new code (NC) . . . . . . . . 2 0 S tudying t h e o r i g i n a l cpde (OC) . . . . . . 2 6 Some b a s i c problems T , . . . . . . . . e . . . . 27 Choosing t h e d i c t i o n a r y represents-kions - - . . - 31 V e r i f y i n g oo )mpa t ib i l i t y between t h e d i c t i o n a r y segment ( D S ) and the second segments ( S S s ) f o t - -

b a s i c class 7 . . . . . . . . . . . . . . . 47 C l a s s i f y i n g t h e s t e m s . . . . . . o . * . C . * . 4 9 S e l e c t i o n a l c r i t e r i a , . . . . . . . . . . . . . 55 A p r e s e n t a t i o n of t h e second segment ~ y s t e m ~ f o r b a s i c class 1, 2 and 3 . . . . . . . . . . - 69 A p r e s e n t a t i o n of t h e t h i r d segment system f o r b a s i c c lass 7 . . . , . . . . . . . . . . . . -. . . 7 4 Demands on t h e a l g o r i t h m f o r t h e d ic-k ionary search 77

P a r t I I L P roces s ing Russian t e x t . . . . . . . - . . . . 81

1. P r e p a r a t o r y p r o c e s s i n g of t h e t e x t m a t e r i a l . 81 2. I n p u t t i n g and o r g a n i z i n g the text material . - 82 3. P roces s ing inAUTLEX . . . . . . . . - . 83 4. P r o g r a m l i s t s . . . . . . . . . . . . . . 9 0 5 . Techn ica l i n fo rma t ion . . . . . . . . . . - . 1 0 7

Conclus ion . . . . . . . . . . . . . . . . . . . . . . . . . 108

Appendices . , . . . . . . . . . . . . . . . . . . . . . . 1 0 9

Refe rences . . . . . * . . . . . . . . . . . . . . . . . . 141 ISBN 91-20-04159-4

Page 32: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

G r a m m a r

CONCERNING THE STRUCTURE OF A COHERENT TEXT

ON THE MORPHOLOGICAL LEVEL

F e l i x D r e i z i n Mathematics Department B a r -Tlan U n i v e r s i t y Ramat-Gan, ISRAEL

Hebrew Computational L i n g u i s t i c s N o , 8 , 1 9 7 4

The proposed se t o f r u l e s f o r c h a r a c t e r i z i n g agreement (= concord) phenomena i n Modern Hebrew i s sub-d iv ided a s f o l l o w s : a ) Gender and Numbek. concord w i t h i n t h e N P ; b ) D e f i n i t e n e s s ass ignment ; c) S u b j e c t -- Main Verb concord -- i n t u r n sub-d iv ided i n t o cases where t h e Main Verb i s a " f u l l " v e r b and t h o s e where it i s a c o p u l a . The fo rma t ion of these rples i s preceded by a b r i e f d e s c r i p t i v e s t a t e m e n t o f t y p e s o f redundancy r u l e s which i n t e r - a c t w i t h agreement phenomena [egg. c e r t a i n t y p e s o r nom- i n a l s are i n h e r e n t l y [ + D e f i n i t e ] ) . The phenomenon of agreement- ass ignment i s viewed a s a t r a n s f o r m a t i o n a l p r o c e s s o f " f e a t u r e - ass ignment" whereby a s p e c i f i c f e a t u r e o r Set of f e a t u r e s ( e . g . Gender, Number) i s c o p i e d from one t e r m t o o t h e r terms w i t h i n a g iven s y n t a c t i c c o n f i g u r a t i o n . The p r o c e s s i n v o l v e d i s essen- t i a l l y one of " d a u g h t e r - a d j u n c t i o n " . Note i s made of t h e o r d e r - i n g agreement ass ignment w i t h r e s p e c t t o o t h e r p r o c e s s e s such as p a s s i v i z a t i o n o r n o m i n a l i z a t i o n .

E . L y t l e , and D . Packard Brigham Young U n i v e r s i t y Provo, Utah

Prepr . in t , Annual M e e t i n g , Associati on f0.P C o m p u t a t i o n a l L i n g u ~ s t i cs 1 9 7 4

J u n c t i o n - r u l e schemata i n t e r r e l a t e c o n s t i t u e n t ope rands v i a a d j u n c t i o n , c o n j u n c t i o n , o r s u b j u n c t i o n . These fundamental r e l a t i o n s are f u r t h e r subd iv ided i n terms4 o f : (1) operand cate- g o r i e s ; ( 2 ) operand j u n c t i o n a t t r i b u t e s ; and ( 3 ) operand scope . C o n s t r a i n t s imposed upon t h e form and c o n t e n t of j u n c t i o n s e x c l u d e t h o s e n o t ev idenced by n a t u r a l language d a t a . A t t h e h i g h e s t l e v e l of s p e c i f i c i t y , j u n c t i o n markers r e p r e s e n t an i n t e r a c t i o n of i n d i v i d u a l i n d i c e s , class i n d i c e s , and a v a r i e t y of f u n c t i o n a l e n t i t i e s .

Page 33: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Grarnrnar

Mark .Strong Brigham Young University

Rroceed ings 0.f t h e [ B Y ? J l ~ i n g u i s t i c s Sgmposi urn, 1 9 7 2

German verbs have 25 forms per verb, and can use either 'have' or 'be' a$ an auxiliary. A verb class qystem is proposed in which information about the complete conjugation can be stored in two hexadecimal digits (i.e. in less than 32 classes). This com- pares with a detailed traditional verb class system that makes 47 distinctions and could not be contained in the space available.

Floyd H. Billings, Jr. Brigham Young University

P r o c e e d i n g s of t h e [BYU] L i n g u i s t i c s Symposium, 1 9 7 3

In junction grammar representations of sentence structure, the relations between lexical items is logical but not linear. Lex- ical ordering rules are thus independent from the syntactic representation. Some rules can be assigned by know ng which junction rule is involved e.g. in English the rule joining a preposition to its object is always left-to-right, but in German prepositions have to be clqssified as either preceding or fol- lowing. A second type of ordering rule involves the operands of a junction rule being more closely related to each other than to any outside element. An example is the processing of articles; an unmodified noun immediately follows the article, but is realized elsewhere when the noun is modified. Discontinuous orderifigs are omitted at their actual locakions and processed at a designated insertion point.

Page 34: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Grammar

CORPUS OF MODERN FRENCH VERB-AFFI x NOMINALIZATIONS C o r p u s des n o m i n a l i s a t i o n s v e r b a l o - a f f i x a l e s d u F r a n c a i s moderne

Laurent Bourbeau Groupe de recherches pour la traduction automatique Universite de Montreal

W o r k i n g P a p e r s i n the L i n g u i s t i c s of Machine Translation, 1974

A study of product ive affixes serving as l ex ica l indicators. One program edits a deck and writes a m a t r i x of verbs. A second lists the verbs by categories of various codes. A t h i r d lists all nominalizations indicated by codes. The results are tools f ~ r research. Tables of codes, card formats, e t c ,

Laurent Bourbeau Groupe de recherches pour l a t r a d u c t i o n automatique Universite de Montreal Working Papers i n the L i n g u i s t i c s of Machine Trans1 a t i o n , 1 9 7 4

Theor ies of Grevisse, Tesniere, Dubois, Tutescu. Coding of verbs: morphology, complements, genders of nouns der ived.

Page 35: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Parsers

A BEST-FIRST PARSER

W i l l i a m H. Paxton A r t i f i c i a l I n t e l l i g e n c e C e n t e r S t a n f o r d Research h s t i t u t e Menlo Park , California

S R I P u b l i c a t i o n No. Z108 A p r i l 1974

A p a r s e r for a speech undeys tand ing system i s d e s c r i b e d . The parser uses a b e s t - f i r s t s t r a t e g y i n which a l t e r n a t i v e p a t h s are assigned p t i o r i t i e s and paths are suspended as long as t h e r e i s a h igher p r i o r i t y a l t e r n a t i v e t o explore. D i s c u s s i o n s are i n c l u d e d on t h e t ypes of steps i n a parse, t h e ass ignment of p r i o r i t i e s , c o o p e r a t i o n among competing p a r s e s , and e x p e r i m e n t a l results.

R. Grishman, N . S a g e r , C . Raze, and B. Bookchin New York U n i v e r s i t y

Proceedings of t h e N a p i o n d l Computer C o n f e r e n c e , 1 9 7 3 , 4 2 7 - 4 3 4

T h e s t r i n g grammar has t h r e e components: (1) A set of s o m e 3 0 0 BNF d e f i n i t i o n s f o r combining e l emen ta ry s t r i n g s i n t o s e n t e n c e s ( 2 ) A set of r e s t r i c t i o n s on t h e s t r i n g s . ( 3 ) A word D i c t i o n - a r y . The parser i s top-down se r ia l w i t h a u t o m a t i c backup. I t produces a l l p a r s e trees of a s e n t e n c e . R e s t r i c t i o n s are written i n a s u b s e t o f E n g l i s h and t r a n s l a t e d by the p a r s e r i n t o l i s t s of b a s i c o p e r a t i o n s recogn ized by t h e r e s t r i c t i o n i n t e r p r e t e r . For c o n j u n c t i o n s , s a t i s f a c t i o n of an e lement of t h e i r d e f i n i t i o n causes an i n t e r r u p t t o i n s e r t i n t h e tree a p r o c e s s node t h a t l a t e r causes zeroed s l o t s t o b e filled i n by l ink-s t o o t h e r s u b t r e e s .

Page 36: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

L E X I C A L S E M A N T I C S

Leksi ceska j a S e m a n t i k a Sihon ' ; imicesk ie Sredstva J a z y k q

Ju . D . A p r e s j a n

S c i e n c e Press Moscow

1 9 7 4

T a b l e of C o n t e n t s

FORE*ORD . . . . . . . . . . . . . . . . . . . . . . . . . . 1. The fundamenta l i d e a s o f modern s e m a n t i c s . . . . . . .

S o u r c e s of s e m a n t i c s . . . . . . . . . . . r . h . . . 6

Modern s e m a n t i c s a s p a r t o f a g e n e r a l t h e o r y o£ l anguage 11

The "Meaning ---- Tex t" model and i t s e v o l u t i o n . . . . 36

2 . Semant ic l anguage a s a means of i n t e r p r e t i n g l e x i c a 2 meaning . . . . . . . . . . . . . . . . , . . . . , .

The l i n g u i s t i c s i g n and t h e c o n c e p t o f l e x i c a l meaning

E lemen t s o f a l anguage f o r t h e i n t e r p r e t a t i o n o f l e x i c a l meaning . . . . . . . . . . . . . . . . . . 7 0

D i c t i o n a r y o f t h e s e m a n t i c l anguage . . . . , . . . 70

Syn tax of t h e s e m a n t i c l anguage . . . . . . . . . Laws of i n t e r a c t i o n of s i g n s . . . . . . . . . . .

Requirements f o r i n t e r p r e t a t i o n and f o r induced e x p r e s s i o n . . . . . . . . . . . . . . . . . . . . .

Exper iments i n t h e i n t e r p r e t a t i o n o f s i g n s . . . . . . 107

Samples ,of i n t e r p r e t a t i o n . . . . . . . . . . . . 107

T e s t o f t h e c o r r e c t n e s s of i n t e r p r e t a t i o n . . . . 113

The r o l e of s e m a n t i c l anguage for d e s c r i p t i v e l i n g u i s t i c s 1 1 4

From i n t e r p r e t a t i o n tb deep s y n t a c t i c s t r u c t u r e : a model of government . . . . . . . . . . . . . . . . . 119

The s e m a n t i c v a l e n c e of a word . . . . . . . . . . 119

Page 37: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Genera l c h a r a c t e r i s t i c s of t h e means of p a r a p h r a s i n g . 3 . Word fo rma t ion and polysemy . . . . . . . . . . . .

Word fo rma t ion i n t h e proper meaning of t h e word . . S u p p l e t i v e word formation . . . . . . . . . . . . .

. . . . . . . . . . . . Polysemy ( semant ic d e r i v a t i o n )

. . . . Types of ambigu i ty i n language and speech

. . . . . . . . . . Polysemy and word fo rma t ion

Regular polysemy o f s u b s t a n t i v e s . . . . . . . . . . . . . . . . . . . . . A c t a n t m e a n i n g

. . . . . . . . . . Other t y p e s of meaning

. . . . . . . . . . . Regular polysemy of v e r b s

' C a u s a t i o n ' . ' e x t r a c t i o n ' . ' l i q u i d a t i o n ' . removal ' . ' e l a b o r a t i o n ' . ' d e fo rma t ion1 .

~ c t i o n ' - ' c a u s a t i o n of a c t i o n ' . - m a . .

. . . . . . . . . Other c a u s a t i v e meanings

Regular polysemy of adject ives . . . . . . . . . . . . . . . . . . . . . . Causa t i ve meaning

. . . . . . . . . . . . . Purpos ivemean ing

P a r a m e t r i c meaning . . . . . . . . . . . . . . . . . . . . . . O+her t y p e s of meaning

. . . . . . . . . . . . . . . . . . 4 . Lexical synonyms

. . . . . . . . . . . Definition cf lexical svnonyns .

. . . Lexical synonymy: a n a l y s i s and d e f i n i t i o n

Sources of l e x i c a l s y ~ o n y m s . . . . . . . . . . . . . . . . . . . c o m b i n a b i l i t y d i s t i n c t i o n s among synonyms

. . . . . . . . . . I n c l u s i o n of c o m b i n a b i l i t i e s

. . . . . . . . I n t e r s e c t i o n o f c o r n b i n a b i l i t i e s

. . . . . . F u l l c o i n c i d e n c e of c o m b i n a b i l i t i e s

Quasisynonyms . . . . . . . . . . . . . . . . . . . Geno-spec i f i c d i s t i n c t i o n . . . . . . . . . . . S p e c i o - s p e c i f i c d i s t i n c t i o n . . . . . . . . . . N e u t r a l i z a t i o n of semant ic d i s t i n c t i o n . . . . .

Page 38: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

On the concept of nuance of meaning . . . . . . . . . Series of quasisynonyms and semantic role

5 . Lexical converses . . . . . . . . . . . . . . . . . . . . . . . . . . . Preliminary remark and definition

Sources of lexical converses . . . . . . . . . . . . Ready made converses . . . . . . . . . . . . .

. . . Regular methods of formation of converses

. . . . . . . . . . . . . . Basic types of converses

Syntactic types . . . . . . . . . . . . . . . . Semantic types . . . . . . . . . . . . . . . .

Two-place converses . . . . . . . . . . . Three-place converses . . . . . . . . . .

Combinability types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Quasiconverses

Definition and basic types . . . . . . . . . . . Neutralization of semantic distinctions among . . . . . . . . . . . . . . . . . quasiconverses

. . . . . . . . . . . . . . . . . . 6 . Lexical antonyms

. . . . . . . . . . . . . . . . . Preliminary remark

. . . . . . . . . . . . Semantic analysis of antonyms

The ' begin ' end'

The 'action' . 'annihilation of the result of action' type . . . . . . . . . . . . . . . . .

The 'R' - 'not R ' type . . . . . . . . . . . . . . . . . . . . . . . . The 'more1-'less' type

. . . . . . . . . . . . Other types of antonyms

Complex antonymy and khe definition of antonyms . . . . . . . Other questions in the theory of antonyms

. . . . . . . . . Semantic asymmetry of antonyms

. . . . . . Cornbinability distinction of antonyms

. . . . . . . . . Means of formation of antonyms

. . . . . . . . . . . . . . . . . . . . Quasiantonyms

Page 39: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

LEXICAL SENANTICS (CONTINUED)

. . . . . . . . . . . . . 7 Deep syntactic transformation

Introductory note . . . . . . . . . . . . . . . . . . Some new rules of paraphrasing . . . . . . . . . . .

Epuimeaning transformations . . . . . . . . . . Implicative transformations . . . . . . . . . .

Syntagmatic restrictions imposed on transformaZi~n (fi l ters) . . . . . . . . . . . . . . . . . . . . .

Conclusion . . . . . . . . . . . . . . . . . . . . . Bibliography . . . . . . . . . . . . . . . . . . . .

Page 40: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Discourse

Barbara G. Deutsch Artificial Intelligence Center Stanford Research Institute Menlo Park, California

SRI P u b l i c a t i o n No. 2 1 0 6 A p r i l 1 9 7 4

The discourse and task information in task oriented dialogs and their Use in a speech understanding system are discussed. The results of analyzing some tgsk oriented dialogs are given, pre- liminary model of the structure of these dialogs and heuristics for building and using it in a speech understanding system are presented.

Page 41: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Comprehension

THE SRI SPEECH UNDERSTANDING SYSTEM

Donald E. Walker Artificial I h t e l l i g e n c e Cen te r S t an fo rd Research I n s t i t u t e Menlo Park, California

SRI P u b l i c a t i o n No. 2 1 0 7 A p r i l 1974

This paper describes t h e s t r u c t u r e of t h e SRI speech under- s t a n d i n g system and p r e s e n t s t h e a v a i l a b l e data on i t s performance. The system i s d i s t i n c t i v e i n t h e way that knowledge of v a r i o u s sou rce s i s coo rd ina t ed by a " b e s t - f i r s t " p a r s e r t o predict t h e sequence of words i n an u t t e r a n c e , and i n t h e use of word f u n c t i o n s --programs that r e p r e s e n t t h e a c o u s t i c c h a r a c t e r i s t i c s of a word-- t o t es t t h e p r e d i c t i o n s .

G. Brown Department of Computer Science Rutgers U n i v e r s i t y New Brunswick, N . J .

Report No. CBM-TR-34, 1 9 7 4

Attempts t o unders tand and i n t e r p r e t n a t u r a l language d e s c r i p t i o n s of humaq a c t i o n . P l a n s and e p i s o d e s must r e p l a c e s e n t e n c e s as u n i t s o f human a c t i o n t o f a c i l i t a t e i n t e r p r e t a t i o n of mo t iva t i on . A p l a n i s an a c t i o n o r a sequence of a c t i o n s caused by a person i n o r d e r t o ach i eve a fo reseeabIe goal. An episode is a sequence o f acts c o n t a i n i n g a s i n g l e p l a n o r s e v e r a l i n t e r - r e l a t e d p l ans . The B e l i e v e r System u s e s Schmidt ' s t h e o r y of i n t e n t i o n and personal cqusa t i on to i s o l a t e a p l an from a ser ies of acts which may be most ly u n r e l a t e d t o t h e p l an .

Page 42: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Bonnie L. Nash-Webber Bolt Beranek and Newman Inc. Cambridge, Mass

R e p o r t No. B B N - 2 8 9 6 , A I - 1 9 , Oc tbber , 1 9 7 4

Syntactic constraints and expectations are based on the patterns formed by a given set sf iinguistic objects, e.g. nouns verbs, adjectives, etc. Pragmatic ones arise from notions of conversational structure and the types of linguistic behaviok appropriate to a given situation. The bases for semantic con- straints and expectations are an a priori sense of what can be meaningful and the ways in which meaningful concepts can be realized in actual language. The paper describes how semantics is being used in several recent speech understanding systems and dis-cusses in detail some actual problems that have arisen. [Ad-787 616/2GA; PC $4.25; MF $2.251

John W. Klovstad and Lee F. ~ondshein M. I. T . Lincoln Laboratory Lexington, Mass.

I E ~ E T r a n s a c t i o n s on A c o u s t i c s , S p e e c h , a n d S i g n a l Processing A S S P - 2 3 , F e b x u g r y 1 9 7 5 , 1 1 8 - 1 2 3

CASPERS (Computer-Automated Speech Perception System) is a user-modifiable facility for translating strings of acoustic symbols into sentences. Three distinctive aspects of the system's design are the dynamic application of acoustic-phonological rules across word boundaries, an acoustic-unit splitting-and-merging strategy for treating the dictionary matching problem, and an extensive capability for handling Semantic routines within an augmented context-free grammar.

Page 43: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Comprehension

MOTIVATION AND OVERYI EW OF SPEECHLIS: AN EXPERIMENTAL PROTOTYPE

FOR SPEECH UNDERSTANDING RESEARCH

W. A . Woods Bolt Beranek and Newman I n c . Cambridge, Mass.

Z E E E T r a n s a c t i o n s on A c o u s t i c s , S p e e c h , a n d S i g n a l P r o c e s s i n g A S S P - 2 3 , 1 9 7 5 , 2 - 1 0

S y n t a c t i c , s e m a n t i c , p r a g m a t i c and l e x i c a l knowledge i n t e r - act w i t h a c o u s t i c a l and p h o n o l o g i c a l i n f o r m a t i o n i n t h e p r o c e s s of speech u n d e r s t a n d i n g . A f e a t u r e - e x t r a c t i o n component p r o d u c e s a segment l a t t i c e o f p h o n e t i c d e s c r i p t i o n s o f t h e a c o u s t i c s i g n a l . Words from a l e x i c o n are matched a g a i n s t t h e i n p u t s i g n a l . A s y f i t a o t i c component judges t h e g r a m m a t i c a l i t y o f h y p o t h e s i z e d i n t e r p r e t a t i o n s , and a s e m a n t i c component judges m e a n i n g r u l n e s s . A p r a g m a t i c component judges the l i k e l i h o o d o f a s e n t e n c e b e i n g uttered i n t h e s i t u a t i o n by t h e s p e a k e r . The c o n t r o l component u s e s t h e above components p r e d i c t i v e l y t o c o n s t r u c t ' t h e o r i e s ' t h a t can be e v a l u a t e d by o t h e r components o r u sed t o s e t m o n i t o r s , t h a t , when t r i g g e r e d , i n i t i a t e p r o c e d u r e s t o a s s i m i l a t e t h e e v e n t .

A PROSODI CALLY GUIDED SPEECH UNDERSTAND1 NG STRATEGY

Wayne A. L e a , Mark F. Medress , and. Toby E. S k i n n e r S p e r r y Univac S t . P a u l , Minnesota

I E E E T r a g s a c t i o n s on A c o u s t i c s S p e e c h , q n d S i g n a l Processing ASSP-23, 1 9 7 5 , 3 0 - 3 8

P r o s o d i c features break up c o n t i n u o u s speech i n t o s e n t e n c e s and phrases, and l o c a t e s t ~ e s s e d s y l l a b l e s i n those phrases . The most r e l i ab le p h o n e t i c d a t a a r e o b t a i n e d by p e r f o r m i n g a d i s t i n - g u i s h i n g f e a t u r e a n a l y s i s within t h e stressed s y l l a b l e s and by l o c a t i n g s i b i l a n t s and o t h e r r o b u s t f e ' a t u r e i n f o r m a t i o n i n un- stressed s y l l a b l e s . The numbers and l o c a t i o n s o f s y n t a ~ t i c boun- d a r i e s and s t r e s s e d s y l l a b l e s a r e uyed t o se lee t l i k e l y s y n t a c t i c and s e m a n t i c s t r u c t u r e s , w i t h which words are h y p o t h e s i z e d t o c o r r e s p o n d t o t h e p a r t i a l d i s t i n g u i s h i n g f e a t u r e s m a t r i c e s o b t a i n e d from t h e s egmen ta l a n a l y s e s .

Page 44: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Comprehension

PauL Rovner , Bonnie Nash-Webber, and W i l l i a m A. Woods B o l t Beranek and Newman I n c . Cambridge, Mass

I E E E T r a n s a c t i o n s on A c o u s t i c s , S p e e c h ; a n d Signal P r o c e s s i n g ASSP-23, 1 9 7 5 , 136-140

An e n t i r e l y a c c u r a t e and p r e c i s e a c o u s t i c t r a n s c r i p t i o n of s p e e c h i s u n a t t a i n a b l e . Applying knowledge a b o u t t h e phono- l o g y , s y n t a x , and s e m a n t i c s o f a l a n g u a g e , and t h e p r a g m a t i c c o n s t r a i n t s imposed by a t a s k domain can r e s o l v e much of t h e a c o u s t i c ambigu i ty . L e x i c a l r e t r i e v a l and word matching prpograms map segments of p h o n e t i c t r a n s c r i p t i o n s of t h e a c o u s t i c s i g n a l . S y n t a c t i c , s e m a n t i c and pragrnakic components of t h e sys t em form h y p o t h e s e s a b o u t t h e b r i g i n a l u t t e r a n c e which change a s e v i d e n c e f o r o r a g a i n s t them i s found. T h e o r i e s se t t r a p s t-o c a t c h . ev i - dence ; when a t r a p i s t r i g g e r e d , an e v a l u a t i o n i s made to d e c i d e if o r when t o r e p r o c e s s . A component can a l s o make a ' p r o p o s a l ' which i s a r e q u e s t t o t r y immedia te ly t o match words a g a i n s t p a r t of t h e u t t e r a n c e .

Bonnie Nash-Webber B o l t Beranek and Neman I n c . Cambridge, Mass

I E E E T r a n s a c t i o n s on A c o u s t i c s , S p e e c h , and S i g n a l Proee . s s ing ASSP-23, 1 9 7 5 , 1 2 4 - 1 2 9

The p r i n c i p a l data s t r u c t u r e s o f t h e ' BBN SPEECHLIS s e m a n t i c sys t em a r e a s e m a n t i c network and c a s e frame kokens. The network r e p r e s e n t s a s s o c i a t i o n s among words and c o n c e p t s . The case f rames d e s c r i b e how t h e s e m a n t i c r e l a t i o n s h i p s may Ue e x p r e s s e d i n an u t t e r a n c e . The s e m a n t i c sys t em p r o p o s e s word-s t h a t migh t have o c c u r r e d i n t h e o r i g i n a l u t t e r a n c e b u t have n o t y e t been r ecog - n i z e d , c o n s t r u c t s mean ingfu l sets of word matches from p o s s i b l e o n e s , and e v a l u a t e s t h e c o n s i s t e n c y o f s y n t a c t i c s t r u c t u r e s and s e m a n t i c h y p o t h e s i s . Two f u r t h e r t a s k s for it a r e under i n v e s t i g a - t i o n : (1) t o g u i d e s y n t a x , arid ( 2 ) t o t u r n t h e b e s t t h e o r y a b o u t an u t t e r a n c e i n t o a fo rma l p r o c e d u r e Eor o p e r a t i n g on a d a t a b a s e .

Page 45: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

comprehension

A PRACTICAL A P P L I C A T I O N OF A REAL-T IME ISOLATED-WORD RECOGNIT ION

SYSTEM USING SYNTACTIC CONSTRAINTS

Jean-Paul Haton L a b o r a t o i r e d'~1ectricite e t d Automatique U n i v e r s i t e de Nancy, Nancy, France

I E E E Transactions an Acoustics, S p e e c h , a n d S i g n a l Processing ASSP-22, December 1 9 7 4 , 416-419

The r e c o g n i t i a n o f s e n t e n c e s of a l anguage used i n n u m e r i c a l command of machine t o o l s i s d e s c r i b e d . The a c o u s t i c level o p e r a t e s w i t h dynamic matching procedure and knowledge abou t s y n t a c t i c s and semantics of t h e l anguage i s used t o predict t h e incoming words . With such a s y n t a x - d i r e c t e d sys tem, r e a l - t i m e r e c o g n i t i o n of s e n t e n - ces pronounced word-by-word i s ve ry a c c u r a t e l y a c h i e v e d , even f o r s e v e r a l speakers.

A COMPUTER PROGRAM THAT LEARNS TO UNDERSTAND NATURAL LANGUAGE,

Sara R. Jordan

C o m p u t e r s i n t h e Humanities, J . L . M i t c h e 2 1 , e d i t o r , 2 0 5 - 2 2 4 , 1 9 7 4

Under ly ing t h e system i s a memory i n g raph s t r u c t u r e fo rm. Concept nodes a r e r e l a t e d by the f o l l o w i n g re la t ions: t r a n s f o r m s t o , combines t o form f a c t , member/subset of t h i s c l a s s , c lass membership i n , e q u i v a l e n c e , d e s c r i p t i o n . Each c o n c e p t node ' t r a n s f o r m s t o ' words i n n a t u r a l l a n g u a g e s , i n t h i s case F r e n c h , German, and E n g l i s h . Mechanical t r a n s l a t i o n i s performed by ' t r a n s f o r m i n g t o ' one l anguage f r o m another f o r the c o n c e p t s of t h e i n p u t . O u e s t i o n answering i s c a r r i e d o u t by i n f e r e n c e s on set membership.

Page 46: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Comarehension

W . A . Woods B o l t Beranek and. Newman Cambridge, M a s s a c h u s e t t s

P r o c e e d i n g s of t h e N a t i o n a l C o m p u t s r Conference, 1 9 7 3 , 4 4 1 - 4 5 0

The BBN LUNAR sys tem i s d e s c r i b e d . I t e n a b l e s u s e r s t o i n t e r r o - gate two d a t a f i l e s , u s i n g . a l a r g e s u b s e t of E n g l i s h : (1) Ana- lyses of Apqllo 11 l u n a r r o c k samples ; ( 2 ) A key phrase index t o r e p o r t s ~f t h e f i r s t annua l Lunar S c i e n c e Confe-rence. A n aug- mented t r a n s i t i o n network grammar t r a n s l a t e s n a t u r a l l anguage r e q u e s t s i n t o a fo rma l que ry l anguage , a g e n e r a l i z a t i o n of t h e p r e d i c a t e c a l c u l u s , which o p e r a t e s on t h e d a t a ba se .

SOME PRINCIPLES OF COMPUTERIZED LANGUAGE ANALYSIS

R. Brent Thoompson Brigham Young U n i v e r s i t y

P r o c e e d i - n g s of t h e [ B Y U ] Linguistics Symposi urn, 1 9 7 2

The f o u r s t a g e s i n a u t o m a t i c l anguage a n a l y s i s are (1) Determin- i n g t h e k i n d s o f l i n g u i s t i c e i e m e n t s i n t h e i n p u t s e n t e n c e ; ( 2 ) Determining t h e s t r u c t u r a l r e l a t i o n s h i p s among e l e m e n t s ; (31 F i n d i n g t h e r e f e r e n t i a l i n f o r m a t i o n that may be p r e s e n t ; ( 4 ) F i n d i n g t h e c o n t e x t u a l i n f o r m a t i o n t h a t may be p r e s e n t . The BYU group u s e s j u n c t i o n grammar f o r ( 2 . ) and i s beg inn ing t o work on (3-4)

R. Byron Purves Brigham Young U n i v e r s i t y

ProceedLngs of the [B-YU] L i n g u i s t i c s S y m p o s i u m , 1 9 7 3

A s y n t a c t i c r e c o g n i z e r u t i l i z i n g b i n a r y r u l e s i s a p p l i e d t o t h e t e s k i n g of random s t r i n g s drawn from a v o c a b u l a r y of 8 0 0 words . U s e o f t h e r e c o g n i z e r i n a set. of 80 u t t e r a n c e s gave 65% e r r o r - f r e e r e s u l t s ; t h i s compared w i t h 35% when o n l y a r e x i c a l recog- n i z e r was u sed .

Page 47: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Express ion

N e i l M. Goldman S t a n f o r d U n i v e r s i t y S t a n f o r d , C a l i f o r n i a

Communications of t h e A . C . M . 18, 1975, 96-106

A model of n a t u r a l language based on Schank ' s r e p r e s e n t a - tion of meaning. A program produces s e n t e n c e p a r a p h r a s e s which demons t ra te unde r s t and ing with r e s p e c t t o a g iven c o n t e x t . T h i s g e n e r a t o r o p e r a t e s i n c o n j u n c t i o n w i t h a combined memory and i n - f e rence . model. The model encompasses s e v e r a l d i v e r s e c l a s s e s of l i n g u i s t i c 'knowledge, which i n c l u d e (1) e x e c u t a b l e t es t s o f con- c e p t u a l p r o p e r t i e s s t o r e d i n d i s c r i m i n a t i o n n e t s , ( 23 i n f o r m a t i o n r e l a t i n g concep tua l and s y n t a c t i c r u l e s , s t o r e d i n a word s e n s e d i c t i o n a r y , and ( 3 ) s u r f a c e grammatical knowledge s t o r e d i n a formal grammar.

META-SYMBOLIC SIMULATION SYSTEM

Sheldon K l e i n , John F. Aeschlimann, Matthew A. Appelbaum, David F. & a l s i g e r , E l i z a b e t h J . C u r t i s , Mark F o s t e r , S . David K a l i s h , S c o t t J . Kamin, Ying-Da L e e , Lynne A. P r i c e , avid F . S a l s i e d e r Computer S c i e n c e s Department U n i v e r s i t y of Wisconsin Madison

T e c h n i c a l Report # 2 2 6 , Octobef 19 7 4 WIS-CS-226- 7 4

The p l o t of s e v e r a l myths i s g iven i n r e l a t i o n a l form; t h e s t r u c t u r e Propp sugges t ed i s g iven s i m i l a r l y . C o m p a t i b i l i t y of s e l e c t i o n s of c h a r a c t e r s , o b j e c t s , and f u n c t i o n s i s c o n t r o l l e d by subscripts, etc . Programs, grammars, t r a c e s , and output are e x h i b i t e d and commented.

Page 48: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Information structures

SETS, ENTITIES, AND THINGS

Michael E. Senko Plathematical Sciences Department IBM Research Laboratory Yorktown Heights, N.Y.

I n f o r m a t i o n Systems, 1 , 1 9 7 5 , 3 - 1 3

This article reviews progress in the creation of a scien- tific discipline far information systems, It discusses contribu- tions 5rom four sources of fuhdarnental knowledge: (1) Information Systems. Technology ; (2) Scientific Computation Technology ; (3) Ling~~istic~; and (4) Mathematics. It then selectively reviews progress on an information systems science in the most active areas of study: name-based representations, stored repres&tations, access languages, and information systems performance. This discussian relies on the definition of a series of abstract, structured levels for the description, design, and implementation of generalized data base management systems.

Page 49: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

In f e r ence

A HEURISTIC APPROACH TO INDUCTIVE INFERENCE

IN FACT RETRIEVAL SYSTEMS

C. Will iam Skinner North C a r o l i n a S t a t e Unive r s i ty Raleigh

Communications of t h e A C M , 1 7 , December 1 9 7 4 , 7 0 7 - 7 1 2 '

The procedures make use of a s i m i l a r i t y s t r u c t u r e which i s imposed on t h e data base us ing nonnumerical c l u s t e f i h g a lgor i thms, They are implemented i n a model fac t r e t r i e v a l system which uses a formal query language and a p r o p e r t y - l i s t data s t r u c t u r e , The procedures a r e used i n a program of exper iments with t e s t d a t a bases which a r e a l t e r e d by d e l e t i n g p a r t of t h e d a t a and by pur- pose ly i n t roduc ing f a l s e d a t a . he system can i n f e r t h e c o r r e c t response under a v a r i e t y of c o n d i t i o n s invo lv ing incomplete and i n c o n s i s t e n t data.

FOR A THEOREM PROVER

Jack Minker and Gordon J. VanderBrug Department of Computer Science Univers i ty of Maryland Col lege P a r k

I n t e r n a t i o n a l J o u r n a l o f Computer and I n f o r m a t i o n S c i e n c e s , 3 , 3 , 1 9 7 4 2 1 7 - 2 5 0

Two r e p r e s e p t a t i o n s o f - t h e language r e c o g n i t i o n problem for a theorem prover i n f i r s t - o r d e r l o g i c a r e p r e sen t ed and c o n t r a s t e d . One of t h e r e p r e s e n t a t i o n s i s based on t h e f a m i l i a r method of gen- e r a t i n g s e n t e n t i a l forms of t h e language, and t h e o t h e r i s based on t h e Cocke pa r s ing a lgor i thm. An augmented theorem prover i s des- c r i bed which permi ts r e cogn i t i on of r e c u r s i v e languages. The s t a t e - t r ans fo rmat ion mebhod developed by Corde l l Green t o c o n s t r u c t pro- blem s o l u t i o n s i n r e so lu t ion-based systems can be used t o obtain. t h e p a r s e t ree . In p a r t i c u l a r t h e end-order t raversa l of t h e pa r se free i s de r ived i n one of the r e p r e s e n t a t i o n s . The paper de- f i n e s an i n f e r ence system, termed t h e c y c l e i n f e r e n c e system, which makes it p o s s i b l e f o r t h e theorem p jover t o model t h e method on which t h e r e p r e s e n t a t i o n i s based. Thee gene ra l a p p l i c a b i l i t y of t h e c y c l e ir i ference system t o S ta te -space problems i s d i s cus sed . Given an u n s a t i s f i a b l e set S f where each c l a u s e has a t most one p o s i t i v e l i t e r a l , it i s shown t h a t t h e r e e x i s t s an i n p u t proof The clauses f o r t h e two r e p r e s e n t a t i o n s s a t i s f y t h e s e cond i t i ons a s do many s t a t e - s p a c e problems.

Page 50: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

A COMPUTER MODEL FOR THE ONTOGENY OF PIDGIN & CREOLE LANGUAGES

Sheldon Klein and L i n g u i s t i c s Department Un ive r s i t y of Wisconsin Madison

V. Rozencvejg I MGPIIYa ~ a b o r a t o r i y a Machinnogo Perevoda Moskva

Technica l Report #238, December 1 9 7 4 , Computer S c i e n c e s Department u n i v e r s i t y of isc cons in

A system f o r simulation of language contact as a function of s o c i o c u l t u r a l , demographic and h i s t o r i c a l factors; computer model f o r t h e g e n e r a t i o n and gsowth of Pidg in and Creole languages p u r e l y i n terms of structural principles and mechanisms. A genera- tive semant ic grammar i s r e q u i r e d f o r each language. The system c o n t a i n s representations of speakers i n t e r a c t i n g o h v e r s a : ~ ~ o n a l l y . They negot ia te and b a r g a i n , t r y i n g t o communicate, s e l e c t i n g con- s t r u c t i o n s that minimize t h e problems of semantic p a r s i n g .

A METHOD FOR ASSESSING V A R I A B L E RULE AND I Y P L I C A T I O N SCALE

ANALYSES OF L I N G U I S T I C V A R I A T I O N

D. Sankof f , and P. Rousseau

I n : Computers i n t h e Humani t i es , J . L M i t c h e l l , e ~ i t o r , , 3 - 1 5 , 19 7

There are currently two t h e o r i e s of l i n g u i s t i c v a r i a t i o n , One sugges t s t h a t there i s an under ly ing probabilistic component i n the competence of each speaker; the other c o n s i d e r s the varia- t i o n t o be an artefact of g r o u p i n g speake r s with d i s c r e t e l y d i f - f e r e n t grammars--there be ing an i m p l i c a t i o n a l scaling r e l a t i o n among t h e p o s s i b l e grammars,

A rigorous comparison is made by making a v a r i a b l e r u l e a n a l y s i s and an i m p l i c a t i o n a l scaling model f o r data on t h e de- l e t i o n of t h e complementizer QUE i n Montreal French. Using t h e p r o b a b i l i t i e s n r e d i c t e d by the v a r i a b l e r u l e , t h e errors expected i n f i t t i n g t h e da ta t o the proposed scale are ca lcu la t ed by Monte C a r l o s i m u l a t i o n t echn iques . I f t h e a c t u a l number of scaling errors i s s i g n i f i c a n t l y less than predic ted , then t h e Var iab le r u l e a n a l y s i s should be r e j e c t e d . Bu t t h e number i s found t o be exactly as expected from a v a r i a b l e rule a n a l y s i s .

Page 51: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Acquisition

Larry R. Harris Dartmouth College Hanover, N.H.

R e p o r t No. TR-74-1, October , 19 '74

Adaptive techniques for lexical correlation and grammatical i n f e r e n c e suitable f o r n a t u r a l language p r o c e s s i n g are d e s c r i b e d . These techniques form t h e b a s i s for a n a t u r a l language unders tand- ing system that improves i t s performance w i t h t i m e . [AD-787 805 / 1Gh; PC $3.75, MF $2.251

Page 52: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

I n s t r u c t i o n

INFORMATION PROCESS I NG MODELS AND COMPUTER AIDS

FOR HUMAN PERFORMANCE: SECOND-LANGUAGE LEARNING

D a n i e l N . Kalikow B o l t Beranek and Newman I n c . Cambridge, Mass.

R e p o r t No. B B N - 2 8 4 1 ; AFOSR-TR-74-1730, J u n e 1974

D e s c r i p t i o n of t h e second f i e l d e v a l u a t i o n expe r imen t on t h e Mark I1 model o f t h e Automated P r o n u n c i a t i o n I n s t r u c t o r ( b P I ) sys tem. Twa matched groups af s t u d e n t s were s t u d i e d . A l l were native s p e a k e r s of S p a n i s h , and all were e n r o l l e d i n t h e i n t e n - si've E n g l i s h Program a t t h e U n i v e r s i t y of Miami. One g roup was tested and t r a i n e d w i t h t h e A P I system; t h e o ther was simply tested within t h e same time frame. [ ~ D - 7 8 7 876/2GA; PC $6.2.5, MF $2.251

A SEMANTICALLY CENTERED PARSING SYSTEP FOR M I XED I N I T I A T I V E

CAI SYSTEMS

R. R. Bur ton B o l t Beranek and Newman Cambridge, Mass.

P r e p r i n t , A n n u a l Meeting, A s s o c i a t i o n f o r Computational L i n g u i s t i c s , 1 9 7 4

SOPHIE i s a C A I sys tem f o r t e a c h i n g e l e c t r o n i c s . I t uses A 1 t e c h n i q u e s t o per fo rm ques tLon-answer ing , h y p o t h e s i s v e r i f i c a t i o n and t h e o r y formation. Most of its c a p a b i l i t i e s a r e d e r i v e d from u s i n g s i m u l a t i o n models. I t i n c l u d e s a h i g h l y t,uned s t r u c t u r a l parser f o r a l l o w i n g t h e s t u d e n t t o communicate i n a subset of E n g l i s h .

Page 53: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

a MODEL DRIVEN QUESTIONsANSWERING SYSTEM FOP A CAI ENVIRONMENT J. S. Brown A i r Force Human Resources Labora to ry Lowry AFB Colorado

Mimeographed 1973

A q u e s t i o n answering system which p e r m i t s a computer- a s s i s t e d i n s t r u c t i o n ( C A I ) s t u d e n t g r e a t e r i n i t i a t i v e i n t h e v a r i e t y of q u e s t i o n s he can ask i s ciescribcli. A method i s p r e - s e n t e d t o r e p r e s e n t the dynamic p r o c e s s e s of a s u b j e c t matter a r e a by augmented f i n i t e s t a t e automata , which p e r m i t s e f f i c i e n t infer- enc ing abou t dynamic p r o c e s s e s and p r o v i d e s a s a t i s f a c t o r y deep s t r u c t u r e for paragraph g e n e r a t i o n . A C A I system deaLing w i t h meteorology i s d e s c r i b e d which u s e s t h i s au tomat ion model. [EDRS ED077195; $0.65-MF, $3.29-HC]

T o Manwell

ACM SIGCUE B u l l e t i n , 7 , J a n u a r y 1 9 7 3 , 5 - 1 7

A d e s c r i p t i o n o f a p r o t o t y p e computer assisted i n s t r u c t i o n system f o r teaching Russ ian . Although t h e cou r se stresses t h e Russian morphologica l sys tem, t h e c o n s t r u c t i o n of t h e computer program i s a p p l i c a b l e t o o t h e r languages and language t e a c h i n g s p e c i a l t i e s .

Page 54: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Documentat ion

ON AUTOMATIC QUESTION MODIFICATION IN FREE TEXT SEARCH

Christine Schaab

Z M D - A - 2 6 Z e n t r a l s t e l l e f u r m a s c h i n e l l e Dokumenta t ion B e b t h - V e r t r i e b G m b H . B e r l i n 3 0 . May 31, 1 9 7 4

T o incfease t h e hope of a h i t i n f r e e - t e x t s e a r c h , ques- t i o n s can be expanded by t h e a d d i t i o n of b r o a d e r terms, n a r r o w e r terms, r e l a t e d terms, and synonyms. To redu-ce t h e chance of 6 a l s e drops , e x p a n s i o n s c a n c a r r y f - r a c t i o n a l w e i g h t s ; a match i s accepted o n l y above a t h r e s h o l d . Examples are a n a l y z e d . [ I S B N 3-410-44026-71

SUPPLEMENTARY PROGRAMS FOR INPUT TO STAIRS IN THE I 8 D - ARE.A

Z M D - A - 2 7 Z e n t r a l s t e l l a f u r masch ine l le D o k u m e n t a t i o n B e u t h V e r l a g G M B H . B e r l i n 3 0 , J u l y 1 5 , 1974

S T A I R S i s a n IBM program. The a d d i t i ~ ~ s improve 1-0 o p e r a t i o n s i n i n f o r m a t i o n and documenta t ion u s e . C o n t e n t : Data bank c o n s t r u c t i o n ; d i c t i o n a r y improvements; d a t a i n p u t ; p e r a m e t e r i n p u t ; d ia logue r e t r i e v a l ; b a t c h r e t r i e v a l ; u s e r a c c o u n t i n g .

STATISTICAL RELATIONS BETWEEN TEXT WORDS AND D E S C R I PTORS

Rainer Kragenings

Z M D - A - 2 5 Z e n t r a l s - t e l l e f u r m a s c h i n e l l c Dokumenta t ion B e u t h - V e r t r i e h GmbH. B e r l i n 3 Q . M a y 2 , 1 9 7 4

grom six issues of Food Science and Technology Abst-acts , ~ o n ~ a i n i n g 8405 a b s t r a c t s , t h e c o n d i t i o n a l p r o b a b i l i t y Z a? a d e s c r i p t o r g i v e n a t e x t word was computed. I n a seventh i s s u e , c o n t a i n i n g 1 2 , 7 0 5 d e s c r i p t o r a p p l i c a t i o n s , t h e a u t o m a t i c a s s i g n - ment o f d e s c r i p t o r s w a s t e s t e d . With Z = 0 . 3 as c u t o f f , 2 8 , 2 5 1 a p p l i c a t i o n s include 9 , 1 3 9 c o r r e c t ; with Z = 0.7, 4,936 applica- t i d n s mclude 3,782 correct. [ I S B N 3-410-44025-91

Page 55: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Documentat ion

J. M e Carroll and J. Cakarnis Computer Science Department University of Western Ontario

I n Proceedinas o f t h e Second Open Conference on I n f o r m a t i o n S c i e n c e d *

i n canada; e d i t e d b y A . G a m a c h e & R . Penner. O t t a w a : C a n a d i a n A s s o c i a t i o n f o r I n f o r m a t i o a S c i e n c e , 1 9 7 4 , 7 3 - 7 8

Content-significant sentences can be extracted automatic- ally in decreasing order of importance from scientific papers available in machine-sensible format. Ordering is accomplished according to multiple regression of a non-linear combination of variables. The dependent variable is a subjective welyhting of sentence importance. The independent variables include each word's relathe -frequency, the type-to-token ratio, mean-word length, and the predominant parts of speech encountered.

Page 56: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

T r a n s l a t i o n

MACH 1 NE TRANSLATION

L a r i s s a Toma, Pau l Garre t t , Ludek Kozl ik , Donald Perwin, and Chuck S t a r r Latsec Inc . La Jolla, C a l i f o r n i a

Repore No. R ~ D c - ~ R - 7 4 - 1 8 9 , A u g u s g 1 9 7 4

The f i n a l @DC suppor ted o p t i m i z a t i o n phase of t h e SYSTRAN Russian-English t r a n s l a t i o n system. The primary t H r u s t o f $ h i s e f f o r t was d i r e c t e d a t implementing t h e use of semant ic a n a l y s i s i n bo-th sou rce language a n a l y s i s and t a r g e t language s y n t h e s i s . Th i s p r o j e c t has shown semo-syntac t ic a n a l y s i s t o be a h i g h l y f e a s i b l e means of s o p h i s t i c a t i n g machine t r a n s l a t i o n and dec rea s - i n g t h e need f o r p o s t - e d i t i n g . [AD-787 671/7GA; PC $5.75,MF $2.251

E. J. Lehmann Na t iona l Techn ica l In fo rmat ion S e r v i c e

Report No. COM-73-1171/8, October 1973 Price $20.00

Bibl iography c o n t a i n i n g 100 s e l e c t e d a b s t r a c t s of r e s e a r c h r e p o r t s r e t r i e v e d us ing t h e ~ a t i o n a l Techn ica l In fo rmat ian S e r v i c e o n - l i n e s ea r ch system. Research on machine t r a n s l a t i o n of v a r i o u s languages i s covered. Topics concerning s y n t a x , computer program- ming, computer hardware and semant ics are i n c l u d e d .

Page 57: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Bozena H e n i s z D o s t e r t Texas A&M U n i v e r s i t y

Report No. A D - 7 6 8 451

The u t i l i t y of u n e d i t e d R u s s i a n - E n g l i s h machine t r a n s l a t i o n i n o p e r a t i o n a l e n v i r o n m e n t . The s t u d y i s b a s e d on t h e p e r f o r m a n c e o f t h e Georgetown MT s y s t e m a t t h e AEC Oak Ridge N a t i o n a l L a b o r a t o r y and EURACT.OM Common f i e s e a r c h C e n t e r . P r o d u c t i o n volume-,, s u p p l i e r s / u s e r s o f machine t r a n s l a t i o n services, p r o d u c t i o n cos t , compute r e n v i r o n m e n t , and irnprovemencs s i n c e 1963 . ~ e t h o d o l o 6 ~ o f c o l l e c t i o n and a n a l y s i s of i n d i v i d u a l a s s e d s m e n t s . A wide r a n g e o f u n i f o r m l y favorable r e s p o n s e s e l i c i t e d by q u e s t i o n n a i r e a.nd p e r s o n a l i n t e r v i e w from u s e r s i n t h e USA, I t a l y , Belg ium, Germany and H o l l a n d .

Peter P. Toma, J e r r y A . C a r l s o n , David R . S t o u g h t a n , Joann P . Ryan L a t s e c Inc. La J o l l a , C a l i f o r n i a

R e c o x t 3 0 . R A D C - T R - 7 3 - 3 6 8 , December 1 9 7 3

SYSTPAM s y s t e m d i s p l a y s s i m u l t a n e o u s l y on a CRT a R u s s i a n i n p u t s e n t e n c e a@ t h e E n g l i s h o u t p u t , p l u s some c o n t e x t . T h e e d i t o r c a n d e l e t e , i n s e r t , r e a r r a n g e , e t c , v i a key-board o p e r a t i o n s . Recommendations f o r o p t i n i z a t i o n o f t h i s s y s t e m i n - clude h6w e d i t i n g f u n c t i o n s migh t b e s t be c a s r i e d o u t on v i d e o e d i t i n g t e r m i n a l s i n c o n j u n c t i o n w i t h a c o m p u t e r i z e d t y p e s e t t i n c j sys t e r r . V a r i o u s c r i t e r i a f o r c h o o s i n q a t y p e s e t t e r a r e con- s idered , and a Photon Pacesetter Mark I1 i s recormended t o best s e r v e t h e f u t u r e needs o f t h e T e c h n i c a l T r a n s l a t i o n D i v i s i o n a t W r i g h t - P a t t e r s o n AFB. E x p l o r e s t h e f e a s i b i l i t y o f a u t o m a t i c a l l y f l a g g i n g SYSTFJ,N o u t p u t t h r o u g h a p p l i c a t i o n of E n q l i s h w e l l - f o rmedness c r i t e r i a . I n c l u d e s a s u r v e y of t h e d i s t r i b u t i o n i n F n q l i s h of adnominal g e n i t i v e construction^, compound n o u n s , and p o s s e s s i v e - n o u n p l u s noun c d n s t r u c t l o n s an?. an i l l u s t r a k i c n o f how t h e f i n a i n g s o f t h i s s u r v e y m i g h t be a p p l i e d t o improve t h e F n g l i s h o u t p u t of R u s s i a n adnominal g e n i t i v e s t r u c t u r e s . [ A D - 7 7 5 160/5GA,. PC $500, MF $1.451

Page 58: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Translation

~ i l l i a m S-Y Wang, and Stephen W. Chan University of California Berkeley

R e p o r t No. RADC-TR-74-22, F e b r u a r y 1 9 7 4

Describes a 2-1/3 year effort to further develop t h e prototype Chinese-English Machine Translation System. Additionel r u l e s were incorporated into the existing grammar f o r Chinese analysis and interlingual transfer, with emphasis on the latter. CHIDIC was upcfated and revise& Approximately 16,000 new entries were added to CIIIDIC, bringing the tdtal available entries to oGer 73,000. Linguistic work on a random access dictionary in- corporating feature notation was carried out. &. new design for the translation system was initiated and partially programmed. for conversion of the current system from a CDC 6400 version into an IBM version. Better control of the parsing process was achieved by improving the segmentation procedures during input, and by ad- dition of more revealing diagnostic printouts as steps toward re- duction of spurious ambiguities. The Model 600D Chinese Tele- printer System was used for the first time to prepare lar,ge batches of teqts for input. A total of 307 pages af machine readable texts, comprising 300,000 characters were prepared dur- ing this report [AD-776 813/8GA; PC 54.75, MF $1.451

BASED ON J U N C T I O N GRAMMAR

Lance S, S m i t h Brigham Young University

P r o c e e d i n g s f t h e [ B Y U ] L i n g u i s t i c s Symposi urn, 1 . Q 7 2

Initially the s~stefn was applled to Russian analysis and English synthesis. Later version$ have Russian and English synthesis, and English, ~rench, Spanish, Portuguese, German, and Japanese synthesis. Analysis is based on the junction grammar model 05 syntax, and has a vertical cycle, i . e . , all the tests are applied to a single node before moving on to the next node, Reverse Polish notation is used to represent the analysis. A skeleton supervisor calls in language specific routines for language specifrc problems, for example, in the interlingual transfer pro~ess .

Page 59: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Translation

Alhn K. Melby Brigham- Young University

P r o c e e d i n g s o f the [ B Y U ] L i n g u i s t i c s ~ y m p o s i urn, 1.9 7 3

The system for manipulating syntactic analyses generated using the junction grammar formalization. The system is used to cunstrdct inputs for synthesis routines and to study compaxa- tive grammars of l a n g u a g a In addition to operating on syntac- tic structures, semantic ambiguities are resolved by requests to the user.

ON THE FRENCH EQU I VALENTS OF ENGL I SH PASS I VE CONSTRUCT1 ONS

Irena Bellert Groupe de Recherches pour la Traduction Automatique Universite de Mnntreal

E t u d e s d e l i n g u ' i s t i q u e a p p l i q u e @ a l a t r a d u c t i o n a u t o r n a t i q u e , 1974

selection of passive, h p e r s o n a l (il , on) , reflexive, active. - - Keys are anaphora, .mod-al, adverbs, quantifiersi by-phrase , heaviness,

Page 60: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

COMPUTERS, PROGRAMMING , AND NATURAL LANGUAGES D r d i n a t e u r u r P r o g r a m m a t i o n , ot L a n p u c s Naturcfles

Jacques A n d r e and Catherine Fuchs

Maison 4M M a m e 4 9 B o u l e v a r d P s e u i l 1 . y

3 7 0 2 7 Tours C o d e x France

TABLE OF CONTENTS

IV.

VI.

VII.

VIII.

IX.

X..

XII.

XIII.

Algorithms, programming, and computers

H a r d w a r e and software

Basic notions of a programming l a n g u a g e

Simple modes

Syn tax and semantics-

Tests

I t e ra t ion i r i s t r u c t i o h s

Tables

Structures

R e f e r e n c e s

~ o u t i n e s

L i s t s and trees

A concrete r e a l i z a t i o n

Described as a book f o r s t u d e n t s in linguistics, soc io logy , psy-

chology, and history. Analysis of linguistic deep s t r u c t u r e

u s i n g a language based on A l g o l 6 8 .

35 .00 Francs

Page 61: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Y: Wallach Department o f Electrical Eng inee r ing

Technion-Israel Institute of Technology Haifa, Israel

Gordon a n d B r e a c h S c i e n c e P u b l A s h e r s N e w York, London , a n d P a r i s

1 9 7 4

TABLE OF CONTENTS

IV.

VII.

V I I I

Mo t iva t i on

Language descriptions

A PL/I subset

I n t r o d u c t i o n t o omp piling t e c h n i q u e s

P a r s i n g methods

List p r o c e s s i n g

Precedence method

G r q m m a r t r a , n s fo rma t iqns

A l g o l

A d d i t i o n a l l a n g u a g e features

References

ISBN 0 677 04QIO 5 LC C a r d 73-89202

Page 62: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

STRING AND LIST PROCESSING II4 SilOBOt~r: TECHN IQUES AND APPLI CAT1 ONS

Ralph E . Griswold Department of Computer Science

The University of Arizona

Prentice-Hall , Inc, EngZewood Cliffs, N e k J e r s e y

1 9 7 5

TABLE O F CONTENTS

1. Pattern matchinq

2. Defined fupctions

3. Structur'es

4, Applications in Mathematics

5 . Cryptography

6. Document preparation

7, Ad'dkthnal applications

Appendix A. Character sets

Append'ix B. SoPuti'ons to selected exerci~es

References

Dkfined f u n c t 5 o n s

Subject index

"SNOBOL4 is usually described as a string-processing, language.,. [hut] is...a aeneral-purpose language that stresses 'nonnumerical' facilities. The lisb-processing facilities in SNOBOL4 ake not) as well known as the string-processing facilities. " p. xi

ISBN 0-13-853010-6

Page 63: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Programming

F O R T P A N T E C H N ' I Q U E S

WITH S P E C I A L REFERENCE TO NQN-NUMERI CAL A P P L I C A T I O N S

A . Col in Day

C a m b r i d g e at. t h e u n i v e r s i t y Press

1 9 7 2

TABLE OF CONTENTS

1. Basic techniques 1

2 . Numbers and c h a r a c t e r s 1 4

3. P l o t t i n g graphs on t h e l i n e p r i n t e r 20

4 . Searching a tahle 35

5. Cograc te rs and words 4 3

6 . Stacks and queues

7 . Lisk p rocess ing

8 . S o r t i n g

9 . Symbol-state t a b l e s

Bibl iography

Index

I S B N 0 521 08549 7 hard cover

0 521 09719 3 paperback

LC Card 72-78891 $3.9 5 paperback

Page 64: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

A MULTI -PROCESS1 NG APPROACH TO NATURAL LANGUAGE

Ronald M. Xaplan Harvard U n i v e r s i t y Cambridge, Massachuse t t s

P r o c e e d i ~ g s af t h e 1 9 7 3 N a t i o n a l C o m p u t e r C o n f e r e n c e , 4 3 5 - 4 4 0 .

The Genera l S y n t a c t i c P r o c e s s o r (GSP) i n c o r p o r a t e s b a s i c f a c i - l i t i e s o f Woods's auqmented t y a n s i t i o n network grammar and Kay ' s ' power fu l p a r s e r ' . The former i s a t ~ p - d o w n sys tem t h a t can n e e d l e s s l y r e p e a t computa t ion on b a c k t r a c k i n g . The l a t t e r i s a bottom-up p a r s e r that e x h a u s t i v e l y forms e v e r y w e l l f o r m e d . s t r i n g i n a s e n t e n c e . GSP ovkrcomes t h e d i s a d v a n t a g e s of t h e s e sys tems th rough use of a t r a n s i t i o n netowrk a s t h e formal i sm f o r the grammar, and c h a r t s a s p a r s e s t r u c t u r e s . I n a c h a r t e ach con- s t i t d e n t i s r e p r e s e n t e d on ly once ; t h u s a c h a r t r e p r e s e n t s i n one s t r u c t u r e a l l p o s s i b l e p a r s e s of a s e n t e n c e . The subnet - works of GSP a r e conce ived as a c o l l e c t i o n o f asynch-ronous pro- c e s s e s which o p e r a t e on o v e r l a p p i n g c h a r t s e c t i o n s and u s e t h e c h a r t t o communicate w i t h each o t h e r .

Daryl Gibb Brigham Young U n i v e r s i t y

Pro-ceedings of t h e [ B Y U ] L i n g u i s t i c s Symposi urn, 1 9 7 3

I n p r o c e s s i n g an E n g l i s h s e n t e n c e , humans b r i n g i n t o p l a y a v a s t amount of e x p e r i e n c e and l o g i c . I n t h e BYU sys tem, t h e a u t o m a t i c a n a l y s i s i s a s s i s t e d by human i n t e r a c t i o n t o r e s o l v e problems of a n t e c e d e n t s of p ro fo rms , t h e noun ph ra se modi f i ed by a p r e p o s i - t i o n a l p h r a s e , e tc . The sys tem i s be ing used t o s t u a y t h e prob- l e m s t h a t a r i s e i n language a n a l y s i s and t o form a ba se f o r e x t e n d i n g t h e automated system.

Page 65: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

P i 6 t u r e a n a l y s i s

ISIS: AN INTERACTIVE FACILITY FOR SCENE ANALYSIS RESEARCH

J. M. Tenenbaum, T. D . Garvey, S. A. Weyl, and H . C . Wolf A r t i f i c i a l I n t e l l i g e n ~ e ~ C e n t e r S t an fo rd Research I n s t i t u t e Menlo Park , C a l i f o r n i a

SRI Publication No. ill J u n e 1974

Summarizing i n i t i a l p rog re s s i n developing a computer sy s - t e m t h a t can be r a p i d l y proorammed t o ana lyze any c l a s s of p i c t o r - i a l scenes . Scene a n a l y s i s programs have been awkward t o develop u s ing conven t iona l programming systems because of t h e d i f f i c u l t y of fo rmula t ing p i c t o r i a l d e s c r i p t i o n s i n symbolic terms. P i c t u r e p roces s ing t echn iques a r e i n h e r e n t l y ad hoc and must be deduced e m p i r i c a l l y f o r each a p p l i c a t i o n .

An i n t e r a c t i v e system s p e c i f i c a l l y des igned f o r exp re s s ing and exper iment ing w i th p e r c e p t u a l s t r a t e g i e s , it a l lows an e x p e r i - menter t o d e s c r i b e b a s i c p e r c e p t u a l concep t s t o a computer i n terms of p i c t o r i a l examples. Examples a r e de s igna t ed g r a p h i c a l l y by e n c i r c l i n g a r e a s of a d i sp l ayed scene w i th a c u r s o r . A concept i s r ep re sen t ed i n t e r n a l l y by va lue s of p r i m i t i v e f e a t u r e - e x t r a c t i o n o p e r a t o r s t h a t d i s t i n g u i s h it from examples of p r e v i o u s l y d e f i n e d concepts . Concepts s o d e f i n e d c o n s t i t u t e a common vocabulary , shared by man and f iachine, t h a t can be used symbol ica l ly i n des- c r i b i n g o b j e c t s and s p e c i f y i n g scene a n a l y s i s p rocedures .

Theasys tem has been used t o fo rmula te i n t e r a c t i v e l y des- c r i p t i o n s that d i s t i n g u i s h o b j e c t s in indoor room scenes and pro- grams t h a t l o c a t e t h e s e o b j e c t s i n images.

Page 66: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Picture analysis

A RELATIONAL DATA BASE SCHEMA FOR DESCRIBING COMPLEX PICTURES

WITH COLOR AND TEXTURE

T.osiyasu L. Kunii, Stephen Weyl and Jay M. Tenenbaum Information Science Artificial Intelligence Center Laboratories Stanford Research Institute

University of Tokyo Menlo Park, California

SRI P u b l i c a t i o n No. 2 1 0 9 J u n e 1 9 7 4

The potential for applying computers to large masses of pictorial information, such as remotely sensed earth resource data or medical photographs, leads to the necessity for carefully designing underlying data structures. This paper presents a re- lational schema for describing complex pictures having color and texture. The schema is in abstract form free from any specific implemented storage structure. It provides a means for extending the lifetime of pictorial data by divorcing it from par t i cu ld r hardware and applications programs. Furthermore, it allows inte- gration with share& data bases that include symbolic and numerical information.

The schema presented uses Codd's relational formalism to achieve modularity and associativity of data. Since this forma- lism was originally developed for commercial applications, this paper provides an outline of the relevant concepts. To acconuno- date picture-processing applications, procedures for reducing relations to canonical form, based on a world model, are consid- ered from an inductive viewpoint.

Page 67: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Literature

C O M P U T E R S I N T H E H U E A N I T I E S J. L. Mitchell, Editor University of Minnesota

E d i n b u r g h U n i v e r s i t y P r e s s U n i v e r s i t y o f Minnesota Press

M i n n e a p o l i s 1 9 7 4

TABLE OF CONTENTS

L i n g u i s t i c s

A method for assessing variable rule and implicational scale analyses of linquistic variation D. Sankoff and P. Rousseau . . . . . . . . . . . . . 3

Automatic identification of phrasal verbs Godelieve L. M. Berry-Rogghe . . . . . . . . . . . . 16

The creation of a set of alphabets for the Chinese language - K . L. Su . . . . . . . . . . . . . . . . 27

Why and how do we study the sounds of speech? W. S-Y. Wang . . . . . . . . . . . . . . . . . . . . 39

L i t e r a r y S t y l i s t i c ' s

The semantic significance of spatial movement in narrative verse: patterns of regressive imagery in the Divine Comedy. - C . Martindale . . . . . . . . . 57

On the authenticity of the Baligant episode in the Chanson de Roland. - J. R. Allen . . . . . . . . . . 65

Authorship attribution in Jacobean dramatic texts W. M. Baillie . . . . . . . . . . . . . . . . . . . . 73

Measuring alliteration: a study in method. N. Be Wright . . . . . . . . . . . . . . . . . . . . 82

An EYEBALL view of Blake's Sonss of Innocence and - Experience. - D . Ross . . . . . . . . . . . . . . . . 9 4

A summary of this paper appears on the indicated frame of this fiche.

Page 68: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

C O M P U T E R S I N T H E H U M A N I T I E S

TABLE OF CONTENTS (Continued)

L e x i c o g x a p h y a n d L a n g u a g e

SHAD: a Shakespeare dictionary H. Spevack, J. J. Neuhaus and T. Finkenstaedt . . I11

A computerized lexicon of English E.R.Maxwe1landR.N. Smith . . . . . . . . . . . 124

The language of the Peterborough Chronicle J. L. Mitchell . . . . . . . . . . . . . . . . . . 1 3 2

I n f o r m a t i o n R e t r i e v a l

A list of French prose fictiofi, 1751-1800: a progress . . . . . . . . . . . . . report. - R. L. Frautschi

A comp~te~rized bibliography of Scottish poetry . . . . . G. R. Roy-, R. L. Oakman and A. C. Gillon 168

Computer-output microfiche f n the Catalag of American~Portxaits. - W. P. Cole . . 175

New a-pproaches t o epigraphic problems in Roman history E . J. Jory . . . . . . . . . . . . . . . . . . . . . 184

An information system for the J o i n t Caesarea Maritima (Israel) archaeological excavations. - D. D. Fisher

Systems f o r t h e H u m a n i t i e s

A computer program that learns to understand natural . . . . . . . . . . . . language. - Sara R. -Jordan

A common structure for lexicographic data . . . . . . . . . . . . . . . . . . . . D o Sherman

From a wordlform concordance to a dictionary-form . . . . . . . . . concordance. - D. 3. Koubourlis

JEUDEMO: a text-handling system P. Bratley, S. Lusignan and Francine Ouellette

Page 69: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

C O M P U T E R S 111 T H E H U M A N I T I E S

TRBLE OF CONTENTS (Continued)

FORTRAN as a.medium for language a n a l y s i s R. H. Rasche . . . . . . . . . . . . . . . . . . .

M u s i c

Analysis of t o n a l musio a t the level of perception i.A.Morton9 . s . . e . . * . .

MUSTRAN 11: a foundat ion f o r computational musicology . . . . . . . . . . . . . . . . . . . . . J - W e n k e r

A r t a n d Poetry

Computer-assisted poetry: the writing machine is for everybody. - R. W. Bailey . . . . . . . . . . . . .

Randomly generated graphics H - K a w a n o . . . . . . . . . . . . . . . . . . . . . 296

CompQter graphics Ruth Leavitt . . . . . . . . . . . . . . . . . . . 298

~ e x t u r e d animated poetry and the film Morning Elevator . . . . . . . . . . . . . . . . . . . . . & . L a y z e r 300

$PLAT.: a computer lariguage f o r artists D. Donohue and J. Skelton . . . . . . . . . . . . 301

Page 70: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Li te ra tu re

B U L L E T I N V o l u m e 2 N u m b e r 3

M i c h a e l m a s T e r m 1 9 7 4

CONTENTS

R. Hirschmann, Gueqt e d i t o r i a l . . . . . . . . . . , . . . . 2

Nona Newman, The u s e of genera l -purpose s t a t i s t i c a l packages i n l i n g u i s t i c s r e s e a r c h . . . . . . . . . . . . . . . . . 4

G . P. Zarri , A p r o j e c t of a new and updated e d i t i c m of the f i f t h volume of t h e Corpus In s r ip t i onum Lat inarum, w i t h a u t o m a t i c p r e p a r a t i o n of i ndexes . . . - . . . . . . . .

L. A . U l e , C l u s t e r a n a l y s i s . . . . . . . . . . . . . . . . 16

J o W. Lewis, Courses fo r humani t i e s a t u d e n t s - a p e r s o n a l v iewpoin t . . . . . . . . . . . . . . . . . . . . . . . .

J i t k a S t i n d l o v a , Fonds lexical t cheque imp lan t e s u r c a r t e s p e r f o r e e s e t s u r bandes magnet iques: 1 achevement de l a premiere e t a p e du t r a v a i l * . * . . . . . . . . . . . . 25

J . L . Dawson, Suff is: removal and word c o ~ l f i a t i o n . . . . . 33

J. E. G. Dixon, A p r o s e concordance: R a b e l a i s . . . . . . 4 7

N o D . Thomson, L i t e r a r y s t a t i s t i c s I V : on h y p o t h e s i s t e s t i n g 55

J . J . Helm, APA Computer col loquium: Decemb-er 1973 . . . . 6-2

J. R. A l l e n , Computers and c r i t i c s : a r e p o r t on t h e 1973 MLA Convention . . . . . . . . . . . . . . . I - . . . .

W. Lenders , B e r i c h t ~ b e r d i e LDV-fi t t ings i n Mbchen i m F e b r u a r 1 9 7 3 und i m J a n u a r 1 9 7 4 . . . . . . . . . . . .

K . HBlker, The r o l e o f gramrhar i n non-automatic and a u t o matic text p r o c e s s i n g : Conference a t the Z i F of t h e U n i v e r s i t y of B i e l e f e l d , West Germany, February 1974 . . . 7 3

Page 71: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

L i t e r a t u r e

.ON THE AUTHENTICITY QF THE BAL-IGANT EPISODE IN THE 'CHANWN

J. R. Allen

Computers i n th'e H u m a n i t i e s , J . L. M i t c h e l l , e d i t o r , 6 5 - 7 2 , 1 9 7 4

There is a dispute over the authenticity of one episode 04 the poem. The author uses a vocabulary distribution test to show that there is a significant indication of stylistic differ- ences between t h e B a l i g a n t episode a n d t h e rest of t h e poem.

Computers i n t h e H u m a n i t i e s J . L . M i t c h e l l , e d i t o r , 7 3 - 8 1 , 1974

Using the EYEBALL program for stylistic analysis, statis- tics are found for function-word modifiers, complements, noun modifiers and coordinators/subordinators that distinguish the writings of Fletcher from those of Shakespeare. This data is to be applied to Henry VIII, the authorship of which is disputed between the two writers.

AN EYEBALL VIEW aF BLAKE'S SONGS OF INNOCENCE AND OF EXPPRIENCE D. Ross

Computers i n t h e H u m a n i t i e s , J . L . Mitchell e d i t o r , 9 4 - 1 0 8 , 1 9 7 4

Starting from a text in natural language the EYEBALL s y s - tem.provides statistics of vocabulary distribution, the nurqber ~f s9llables per word, and an augmented text with annotations for each word which indicate syllable length, grammatical category and function, locations i n clause, sentence and text. Analyses of word and clause length, distribution of word classes, and pro- perties of combined word classes are also produced. The system is illustrated by application to Blake's early poems.

Page 72: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Literature

C. Mar t inda le

C o m p u t e r s in t h e ~ u m a n i t i e s , J . L. M i t c h e l l , e d i tor., 57-64, 1974

Usi,ng COUNT, a Content analysis program of the G e n e r a l Inquirer ilk, w i t h a c o n t e n t analysis dictionary, the Regressive Imagery Dictionary, the hypothesis t h a t a quantitative transla- tion from t h e imagery of downward spatial movement into psycho- a n a l y t i c r e g r e s s i o n , and ascending movement into movement >way from regression, is substantiated.

ANNUAL BIBLIOGRAPHY FOR 1973: LANGUAGE AND LITERATURE

Computers a n d t h e H u m a n i t i e s , 8 , 1974, 2 0 0 - 1 0 8

An unannotated 1istLng by au thor of some 310 arbicles.

Page 73: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

Mathematics

INDEXING AND RETRIEVAL

Hubert Hti ther

ZMD-A-24 Zen t ra1s t : e l l e - u r m a s c h i n e l l e Dokumentation B e u t h - V e r t r i e b G m b H , Berlin 3 0 . A p r i j 30, 1 9 7 4

The algebraic theory of relations on a set: transitivity, symmetry, equivalence, order. Statistical theory: distribution theory for relations, equivalence c lasses, growth. Application of matrix theory. No examples from documentation. [ I S B N 3-4JQ-44024-XI

Page 74: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

American Journal of Computational Linguistics Micrvf iche 14 7 4

N A M E I N D E X A J C L

Names accompanied only by the title of a contaibutj..on or equally

limited information are omitted. C is an opaque card,

Abelson, Philip Problems in scientific pub,lishing 6 : 11

Abramson, Arthur S. Current trends in linguistics 12 14:3

Adams, Scott NAS/NRC committee on international information 6:8

Adkinson, Burton Repackaging abstracts seminar 6:9

Aeschlimann, John F. Modelling Propp & Levi-Strauss 14:47

Agrawal, Arun On-line speech intelligibility measureme~t 6 : 5 5

Ainsworth, W. A. Performance of a speech synthesis system 14:23

Al-Bayati, H. A. Informatics in developing countries 3 : 2 3

Allen, J. R. Authentizity of an episode in 'Rolande' J.4-71

Allen, Jonathan Reading aloud by computer 1: 8, 6 ; 59

Alford, M e H, T. Literary statistics summer school 1975 9:13

~ n d r 6 , JaCqus Computers, programming, and natural languages 14 : 60

Andreewsky, M. Computational linguist,ics summer school 1975 9:10-12

AppeJbaum, Matthew A. Modelling Propp & Levi-Strauss 1 4 : 4 7

Apresjan, Ju. D. Lexica l semantics 14: 36

A'rbib, Michael A. 'Automaton framework for neural nets 1:74

Atkinson, Richard C. NSF deputy d i r e c t o r nominated 9 : 24

Aurbach, Joseph Phonological rules in speech understanding 14:18

Bailey, Richand W. Lexicography: bibliography 1:9-15

MEMEM: a new approach to lexicography 1:36

Baker, Wm. J. Discriminant function analysis of genres C38, M11

C is an opaque card

M is a microfi~he

13:13 is microfiche 13,

frame 13

Page 75: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NAME INDEX' 1974

Baillie, W. M. A u t h o r s h i p of Jacobean dramas 14:71

Bals ige r , David F. Modelling Propp and Levi-Strnss k4:47

Barnett, Jeffrey A vocal data management system 1 : 2 8

Baron, Robert J. Neural network model of Language 1:75, 6:94

Beling, Gerd Procedures for thesaurus translation 1:66

Bell W. ATS in the teaching of exposition 6: 78

Bellert, Irena French equivalents of English passives 1459

Benesova, E. Analysis of abstracts (relations, arguments) 1.:64

Berkeley, Edmund C. Computer programming in language 1:69

Berry-Rogghe, Godelieve L. M. Phrasal verbs 14 :-27

Bien, Janusz. S t . Marysia: a conversational system 6:70

Artificial intelligence in Poland: bibliography 6:26-38

Bigelow, R. H. REL: ~nglish bulk data input 1:61

Billings, Floyd H. Jr. Syntactic ordering 1 4 : 3 3

Black, John W. English consonant clusCers: perception 14:15

Bledsoe, W. W. Man-machine theorem-proving system 6:74

BIe-sser, B. Character recognition by abstra'ct attributes 14:24

Character recognition: bibliography 6:62

Bobrow, Daniel G. Programming languages for A1 6 : 8 6

Bocqa, Minerva Rumanian alphabet 6:61, 9:38-52

Boehm, Barry W. Reliable software conference 6 : 21

Boehm, R. Phrase distributions and dictionary growth 14:25

Book, Rofiald V. Structure of context-sensitive grammars 1:39

Bookchin, B. The linguistic string parser 14:35

Borden, Ronald F. Microfiche viewer guide 1:3

Borillo, A. Textual-graphic information system 6:93

Formalization of linguistic d a t a about pictures 6:81

French interrogative constructions 6-81

B o r l o , . Textual-graphic information system 6 :93

Bourbeau, Laurent ~ r e n c h verb-af fix nominalization 14 i 3 4

.Norn ina l i za th 14: 3 4

Bourrelly, L. Textual-graphic information system 6 : 9 3

Brainerd, B. Discriminant analysis o f novel, romaqce 6:91

Word counts of Shakespeare's characters 6:91

Page 76: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NAME INDEX 1974

Branstad, Dennis Km ACM guide to computer security 9:27

Bratley, P. JEUDEMO tlexe handling system 14:26

Bre iv ik , Patricia On-line searching in libraries 6:10

Brenner, Everett H. Indexing course for UNESCO 6:9

Broad, David J. Speech recognition 14:18

Brooks, Iiuven Computer psychodiagnostician 6 :92

Bross, Irwin D. J. Analysis of a jargon 6: 83

Brown, G. The believer system 14:41

Brown., J. S. Model-driven question-answering in CAI 14:53

Brown, W. Owen Speech processing: Walsh-Hadamard transforms 1:27

Bruderer, Herbert Survey of MT operations, experiments C29

Bruell, Peter Man-machine theorem-proving system 6:74

Brunnstein, Klaus Information structure in CAI 6 : 7 8 , 1:60

Burchinal; Lee G . User aspects Of information 6:9

Burke, D. Canadian bilingual legal vocabulayy 1 : 36

Burton, Dolores SIGLASH treasurer 1973-1975 6:20

Burton, R. R. Semantic parser for mixed initiative CAI 14:52

Busa, Robexto Index Thornisticus qoes to press 9:26

Buttelmann, H. William Semantic translation of CF languages C21 M 7

Cakarnis, J. Extraction of content-significant sentences 14:55

Carbonell, Jaime R. Natural semantics in AT, C l O , M 3

Carlson, Jerry A. Machine-aided editing 14-:57

Carlson, Walter M. Information technology and privacy 6 : 3 9

Carroll, J. M. Extraction 01 content significant sentences 14:55

Cary, Charles Dm Content analysis of Soviet politics C31

Chafe, Wallace L. Verbalization and rans slat ion C37, M10

Chan, Stephen W. Chinese-~nglish MT 1458

Chen, David Time, causality, and coexistence in retrieval

Cherniavsky, V. S. PUSTO-NEPUSTO retrieval system 6 : 1 4

Chouraqui, E* Textual-graphic information system 6 :93

Chu, Wesley W. Network communication structures C32

Clark, Lawrence M. Computers, machines, animals, men 14: 11

Page 77: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

'NAME INDEX 19 7 4

Cofer, Char les N. S t r u c t u r e o f human memory 6 : 3 9

Cohen, Jacques Theorem prover i n Algol 6 8 6:76

Colby, Kenneth Mark Computer models of thought & larrg'uage 1 :51

Recogni t ion of na tu ra l language d i a logue expressions C 1 2 , M5

Coles, L. Stephen I n t e l l i g e n t machines are on the way 6:87

Robotics : b ib l i og raphy 6 : 88

C o l l i n s , Al lan M. Natural semant ics i n A1 C10 , M3

Cour t i n , J. Ihteractive parser f o r man-machine communication 1 : 4 2

Cox, C . Phenomenological c h a r a c t e r recognit ion 1 4 :.24

Charac te r r ecogn i t i on : b ib l i og raphy 6 : 6 2

Cunningham, Michael A. Neural n e t model of c o g n i t i o n 6:95

C u r t i s , Elizabeth J. Modelling Propp & Levj-Stranss 1 4 : 4 7

Dara-Abrams, Benay Paren theses i n spoken algebra 1:29

Day, A . Col in Fo r t r an : non-numerical t echn iques 1 4 : 6 3

DeHeer, T. Syntactic t races i n re t r ieval 6 :82

Denisov, P. N. P r i n c i p l e s o f l i n g u i s t i c models 6 :43

Deutsch, Barbara G . S t r u c t u r e of t a s k - o r i e n t e d d i a l o g s J4 : 40

Deweze, A . French t he sau rus f o r e l e c t r o n i c s 1 4 : 2 9

Dil le r , T i m SOLAR p r o j e c t d i s t r i b u t e s m a t e r i a l s 6 : 7

D i l l i g a n , Robert Computers and t h e humani t ies conf;erence 9 : 1 4 - 1 8

DiLuglio, Alexandra Cur r en t t r e n d s i n l i n g u i s t i c s 1 2 1 4 : 3

Dipon, N . Ray Adaptive c o n t r o l i n speech r e c o g n i t i o n 6 : 5 4

Sequen t i a l decoding f o r phonet ic -graphic convers ion 1 :31

Paramet t i c modular speech p roces so r 1 4 : 1 9

Comparator f o r speech seqrnenters, c l a s s i f i e r s 1 4 : 22

D o s t e r t , Bozena Henisz REL: in fo rmat ion system 1:61

E v a h a t i o n of Georgetown MT system, 1963-1973 14:57

Dreizin, F e l i x Morphological s t r u c t u r e of cbherent t e x t 1 4 : 3 2

Drennon, Gary G . CASE s i m u l a t o r of c l i n i c a l encounters *6:77

GENESY'S g e n e r a t i n g system fo r CASE 6 : 78

Page 78: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NAME I N N E X 1974

Eden, M. Phenomenological c h a r a c t e r r e c o g n i t i o n 1 4 : 2 4

Char a c t e r r e c o g n i t i o n : b ib l i og raphy 6 : 6 2

Ein-Dbr, P a Two d i c t i o n a r y s t r u c t u r e s f o r r e t r i e v a l 1 : 6 2 , 6 : 8 2

Engel , Gerald L a Computer cu r r i cu lum f o r undergraduates C19

E l L ~ o t t , A . Ronald Speech p rocess ing : Walsh-Hadamard 1 : 2 7

Embry , Jonathan Vocabulary of yaung Navajo c h i l d r e n 1 : 7 2

Epb te in , George Mul t ip le -va lued l o g i c symposium 1975 C 7

E p s t e i n , S. D. Phrase d i s t r i b u t i o n s and d i c t i o n a r y growth 14;25

Erman. Lee D. Speech recogn ic lon hodel and system 1 :26

Fahlman, Sco t t E l l i o t t P lanning system f o r r o b o t b u i l d e r 6:87

Faught , B i l l Recogni t ion of n a t u r a l language exp re s s ions C 1 2 M5

F e r b e r , L a P e r c e p t u a l cont inuous speech r e c o g n i t i o n 1 4 : 1 6

Fernandez de l a Vega, W . Textua l -graphic system 6 :93

F i n d l e r , Nicholas V. Kinship s t r u c t u r e s r e v i s i t e d 1:73

A few s teps toward computer l ex icomet ry C 1 1 , M 4

T i m e , r e t r i e v a l o f temporal r e l a k i o n s , c a u s a l i t y 1:63

F i n l e y , M a R Jr. Chinese c h a r a c t e r c l a s s i f i c a f i o n 14 .~24

F i n k e n s t a e d t , T . SHAD: a Shakespeare d i c t i o n a r y 14;27

F i r s c h e i n , Oscar I n t e l l i g e n t machines 0% t h e way 6187

F i s c h i e r , Martin A, I n t e l l i g e n t machines on t he way 6:87

F i s h e r , J . G. Phrase d i s t r i b u t i o n s and d i c t i o n a r y growth 14:25

Fishman, Daniel B. Q* s ea r ch a lgo r i t hm f o r deduc t i ve Q-A 1 - 5 6

MRPPS i n t e r a c t i v e proof procedure f o r Q-A system 6 : 7 4

F i t c h , H. Goraon Computer-furthered i n s t r u c t i o n 1:57

F i t z p a t r i c k , E i l e e n Lexical s u b c l a s s e s of t h e s t r i n g parser C9 M 2

F l e t c h e r , J . D m Reading: CAI: s p e l l i n g - p a t t e r n t r a n s f e r 1:59

F o s t e r , Nark Modell ing Propp and Levl -St rauss 14-4

Freed , 'Ma M a Genera t ion of freshman Eng l i sh e x e r c i s e s 1 ; 5 7

Friedman, Joyce Exp lo ra t i on of f a s t - speech r u l e s 14:14

Page 79: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NAME INDEX 1974

Fu, K. 8. Syllable detection in continuous speech 6:53

Speaker re.cognition by nasal spectra, coar~iculation 6:53

Fuchs, Catherine Computers, programming, natural languages 1 4 : 6 0

Fujimura, Osamu Syllable as a unit of speech recognition 14:19

C~mputer-controlled radiography 14:13

Computational processing of palatographic patterns 6:51

Fujisaki, H. Coarticulation: formant frequencies 6 : 4 8

Gaddy, Dale Microform Handbook 6:25

Garrett Paul Semantics in ~ussian-English MT 14:56

Gaevey, T. D m ISIS: interactive facility for scene analysis 14:65

Gibb, Daryl English analysis: interactive system 14:64

Glasersfeld, Ernst von Yerkish language for nonhumaas C 3 9 , M12

Glave, Frederick E. Network communication structures C3-2

Goenenc, G. Code decipherability and Turkish syllables 1:35

Goldman, Neil M. Sentence paraphrasing from conceptual base 14:47

Gomberg, S. The REL command language 1 :.61

Goralcikova, A. A type of dependency grammar 14:lO

G~uin, A. R. Introduction to automatic translation 1:68

Graham, George J. Concept collection in political science 6:20

Grandy, Tom B. Network structures conference 1975 C32

Gray, Harry J. Design and test of a cognitive model 6 : 9 5

Green, Duff, I11 Educational data systems conference 6:11

Greenfield, N. R. Computer system support for data qnalysis 1 : 6 5

Grishman, R. The linguistic string parser 14:35

Griswold, Ralph E. SNOBOL&: string and list processes 14*:62

Gross, Maurice Feasibility of high-quality MT 6 : 8 5 -

Gueguen, M. Man-machine dialogues, speech recognition 9 :12

Guenoche, A. Textual-graphic information system 6:93

Page 80: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NlWEl I N D E X 1974

Hagamen, W . D . ATS f o r t e a c h i n g e x p o s i t i o n 6:78

H a j i c ~ v a , E . Negat ion i n f u n c t i o n a l - g e n e r a t i v e grammar 1 : 4 4

H a r l e s s , W i l l i a m G . CASE simuLaCes c l i n i c a l e n c o u n t e r s 6:77

GENESYS g e n e r a t i n g sys tem f o r CASE 6 : 7 7

B a r r i s , B r i a n I n t e r n a t i o n a l CL c o n f e r e n c e , O t t a w a , 1976 G 6 M9:3

H a r r i s , L a r r y R. N a t u r a l language a c q u i s i r i o n 14 :51

H a r t l e y , J . R , More i n t e l l i g e n t C A I systems 1:57

Haton, Jean-Paul Speech r e c o g n i t i o n : i s o l a t e d words 14:45

H e b e n s t r e i t Computers i n educat ion confe rence 1 9 7 5 C8, M9:22

Heidorn , G. E . Simulationprograrnming i n E n g l i s h 1 : 6 9

Hendr ix , Gary G. S imul taneous a c t i o n s & conbinuous p r o c e s s e s 1:70

~ B r a u l t , Dan ie l C'ontent a n a l y s i s o f s c i e n t i f i c t e x t 9:11

H e r s k o v i t s , Anne t te Gene ra t ion of French 6 : 8 4

Hesnard, A. Tex tua l -g raph ic i n f o r m a t i o n sys tem 6:93

H i k i , Shizuo P e r s o n a l vowel q u a l i t y : a c o u s t i c s 6; 57

Hirschmqnn, Rudolf Computers and the - human i t i e s confe rence 9 : 1 4 - 1 8

Hobbs, J e r r y Rober t Metalanguage f o r grammat ica l r e s t r i c t i o n s 6:68

Hoffman, A . A. J. Computer c u r r i c u l u m f o r unde rg radua te s C 1 9

H o l l i d a y , B a b e t t e Vocabulary of young Navajo c h i l d r e n 1 : 7 2

Holm, Wayne Vocab-ulary o f young Navajo c h i l d r e n 1 : 7 2

Hoyle , W . G. I ndex ing ; document c l + s s i f i c a t i o n 1 : 6 5

Hughes, George W. Segment c l a s s i f i c a t i o n i n speech 1 : 2 8

Buther , Hubert Mathematic31 r e l a t i o n s i n r e t r i e v a l 1 4 : 7 3

Ijyder, S . S . Genera t ing Urdu-Farsi-Arabic s c r i p t 1 :35

Hymes, D e l l C u r r e n t t r e n d s i n l i n g u i s t i c s 1 2 14:3

Ich ikawa, Aki ra Pa rame te r s of spoken d i g i t s 1 : 3 1

Imagawa, H. Xaray s c a n n e r 6 : 4 8

I s a a c s , Richard Verbal analogy problems 6 : 72

Page 81: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NAME I N D E X 1 9 7 4

I s h i d a , H. Computer c o n t r o l l e d radiography 1 4 : 1 3

I t a h a s h i , Shu ich i Discrete-word r e c o g n i t i o n 1 : 2 6

I t a k u r a , Fumitada Speech r ecogn i t i on : minimum res idua l 1 4 : 2 1

I t o h , K. X-ray scanner 6:48

Ives, Kenneth H. Economy s p e l l i n g computerized

Jamison, Steven L. Computing c a r e e r s f o r t h e deaf C35

Janocosek, E l i z a b e t h Engl i sh conso-nant clusters: percep t ion 14:15

J a y a n t , Nuggehally S o Delta modulation f o r voice s y n t h e s i s 1:33

Johnson, E m i l y G . P r i n t e d t e x t d i s c r i m i n a t i o n 6 : 6 1

Jordan , Sa ra R . Program l e a r n s t o unders tand language 1 4 : 4 5

Kagaya, Ryohei Chinese c h a r a c t e r r e p r e s e n t a t i o n 6 : 4 8

Process ing pa l a tog raph ic p a t t e r n q 6:51

Kalikow, Daniel N. CAI i n second-language p rodunc ia t ion

Ka l i sh , S . David Modelling Propp and Levi-Strauss 14:47

KalJikourdis , D . Theory of conversa t ions & i n d i v i d u a l s 1 : 5 8

Kameny, Iris Retrof lexed and nonre t ro f l exed vowels 1 4 : 1 2

Kamin, S c o t t J . Modelling Propp & Levi-St rauss 1 4 : 4 7

Kaplan, Ronald M o Mult iprocess ing approach t o language 1 4 : 6 4

Keenan, S t e l l a ~ndexing course f o r UNESCO 6 :9

K e i l , Gerald C. Narrow phonet ic t r a n s c r i p t i o n 14:13

Keller, Howard H. German root system 1:36

Kellett , H . Speech r ecogn i t i on : pe rcep t ion 14:16

Kido, X e n ' i t i Speech r ecogn i t i on : phonology, d i c t i o n a r y 1 : 2 6

K i l m e r , William L. Neural nets t h a t learn 1 : 7 4

K i r i t a n i , S. X-ray scanner 6:48

K i r i t a n i , S * Computer c o n t r o l l e d radiography 14:13

Klatt, Dennis Reading aloud by computer 6:59

Spectrogram-reading experiment 6:52

Page 82: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NAME I N D E X 1 9 7 4

K l e i n , Sheldon Discovery of d e e p - s t r u c t u r e r u l e s 1 :54

Ontogeny o f p i d g i n & c r e o l e l anguages 1 4 : 5 0

Modell ing Propp & Lev i -S t r auss 1 4 : 4 7

K l e i n , Wolfgang F u n c t i o n a l g e n e r a t i v e grammar i n Prague 6.:45

K l i n g e r , A l l e n Computat ional l i b g u i s t i c s : p r o g r e s s & g o a l s 6:73

Kloker , Dean R. P a r e n t h e s e s i n spoken a l g e b r a 1: 29

Klovs tad , John W. CASPERS speech r e c o g n i t i o n system 1 4 : 4 2

Knudsen, Michael J. Speech r e c o g n i t i o n : t r i p l e mic roprocesso r 14 :2 (

K ~ b a y a s h i , Y o Chinese c h a r a c t e r r e c o g n i t i o n : code 6:48

Koprucu, E . P e r c e p t u a l con t inuous speech r e c o g n i t i o n 14:16

Koubour l i s , D. J . Manually e d i t e d concordance 1 4 : 2 6

Koz l ik , Ludek A. Rand d a t a i n SYSTRAN 6 : 6 3 6:67

Semant ics i n Russ ian-Engl ish MT 14:56

Kragenings , Ra ine r S t a t i s t i c a l s e l e c t i o n of d e s c r i p t o r s 14:54

K u k l i n s k i , T . Phenomenological c h a r a c t e r r e c o g n i t i o n 14:24

C h a r a c t e r r e c o g n i t i o n : b i b l i o g r a p h y 6 : 6 2

Kun i i , Tosiyasu R e l a t i o n a l s t o r a g e of p i c t u r e s w i t h c o l o r 1 4 : 6 6

Kuo, Nan-Hung Computer symposium i n Ta ipe i 1975 C33

Landry, B. C. Computer -ass i s ted language a n a l y s i s system 1 : 4 1

Langer , Andy Computer programming i n n a t u r a l language 1 : 6 9

Lavoie , Jean Zornputer-aided l e a r n i n g system 1 58

L e a , Wayne A . S y n t a c t i c r e c o g n i t i o n w i t h o u t p h o n e t i c s 1 : 2 9

P r o s o d i c a l l y guided speech r e c o g n i t i o n 14:43

Ledley, Robert S . Medical d i ,agnosis : concep t a n a l y s i s 6:75

L e e , Ying-Da Modell ing Propp & Lev i -S t r auss 14:47

Lehmann, E . J. MT: b i b l i o g r a p h y 14:56

Lehrnann, Winfred P . German-English MT system 6:84

Leppo, M. ATS i n t h e t e a c h i n g of e x p o s i t i o n 6:78

Lesk, Michael Chairman, SIGLASH, 1973-1975 6:20

L.i, C h a r l e s N . Word o r d e r and word o r d e r change 14:30

Page 83: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

WORD INDEX 1974

Li, Kung-Pu Segment classification in continuous speech 1 : 2 8

Syllable detection in continuous speech 6 : 5 3

Lindblom, Bjorn E. F. Segmental-nonsegmental interaction

Linden, D. ATS in the teaching of expasition 6:78

Lineweaver, J. Informtion languages with grammar 1:63

Ljudskanov, A. Mathematics and computers in linguistics C16

Lovins, Julie B. Pronunciation test system 6:48

bukaszewicz, Witold MARYSIA: a conversational system 6 : 7 0

Lummis, Robert C. Speaker verification: intensity 1:27

Lusignon, S. JEUDEMO: a text handling system 14:26

Lytle, E. Junction grammar as a base for CL U : 3 2

Madden, J. D. Computer conference in Tokyo 1975 C18

Maegard, B. Segmentation of French sentences 1 : 4 2

~ a k h o u i , Sohn Spectral analysis: linear prediction 1:24

Inference in speech recognition 6:71

Ambiguity in acoustic-phonetic recognition 14:17

Makino, Shozo Speech recognition: phonology, dictionary 1:26

Maksym, Joseph N. Pitch extraction by waveform prediction 1:25

Manwell, T. CAI; Russian morphology 14:53

March, J. P. Indexing: value of document parts 1:64

Marckworth, Mary Lois Discriminant analysis genres Mll

Marcus, Solomon Romanian investigations in math, CC 1:21

Marichal, M. Informatics, phi1 ology conference 1974 6 : 18

Marinov, V. Breadth-first search: surprising results 1: 56

Markel, John D. Formant analysis : digital inverse filter 1 : 251

Martindale, C. Spatial movement in narrative verse 14:72

Marxer, John J. CASE simulator af clinical encounters 6:77

GENESYS geneating system for CASE 6:78

Matsumoto, Hiroshi Personal vowel quality: acoustics

Maxwell, E. R e Lexicon of English 14:28

McCandless Stephanie S. Formant extraction: prediction

~coustic-phonetic analysis of continuous speech 14:15

Page 84: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

WORD INDEX 1974 8 4

McSkirnin, James R. Q* s e a r c h a l g o r i t h m f o r d e d u c t i v e Q-A 1: 56

M&PS i n t e r a c t i v e proof p rocedure f o r Q-A sys tem 6:74

Meara, N . M. Computer-ass is ted language a n a l y s i s 1 : 4 1

Medress, Mark F. P r o s o d i c speech r e c o g n i t i o n s t r a t e g y 1 4 : 4 3

Melby, A . K . J u n c t i o n grammar and machine assisted t r a n s l a t i o n 1:54

I n t e r a c t i v e s e n t e n c e p a r s i n g and t r a n s f e r 1 4 : 59

Mel'chuk, I . A. S u r f a c e - s y n t a c t i c r e l a t i o n s i n E n g l i s h 1:3-8

Meredi th , Dennis L. Reading a loud by computer 6:59

Mermels te in , Pau l Segmentat ion and p h o n e t i c l a b e l i n g 14:22

Merwin, Richard E, Making computers easier t o use C25

Miller, G e ~ r g e E . CASE s t imula tor o f c l i n i c a l e n c o u n t e r s 6:77

G E N E ~ Y S g e n e r a t i n g system f o r CASE 6 : 7 8

Miller, N e i l J. P i t c h d e t e c t i o n by d a t a r e d u c t i o n 1 4 : 2 1

Mil ler , Perry Lowell L o c a l l y o rgan ized parser 6 : 5 8

Minker, Jack Language r e c o g n i t i o n f o r a theorem p-rover 14:49

Q* a l g o r i t h m for deductive Q-A system :56

MRPPS i n t e r a c t i v e proof p rocedure f o r Q-A 6:74

M i t c h e l l , J . L. Computers i n t h e human i t i e s 14:67

M i t c h e l l , J. L. The language o f t h e Peterborough C h r o n i c l e 14:25

Mondshein, Lee F. The CASPERS speech p e r c e p t i o n system 1 4 4 2

Acous t ic -phone t ic a n a l y s i s o f con t inuous speech 14:15

Moore, Dan ie l Verba l analogy problems 6: 72

Moorer, James A. Optimum comb p i t c h p e r i o d a n a l y s i s 1 4 : 1 6

MO& Renato D e Speech r e c o g n i t i o n : d e s c r i p t i v e t e c h n i q u e 1 : 2 4

Mullen, Karen SIGLASH e d i t o r , 1973-,1975 6 : 2 0

Nakano, Yasuaki Speech r e c o g n i t i o n : pa ramete r s f o r digits 1: 31

Nakata) Kazuo Speech r e c o g n i t i o n : parameters f o r d i g i t s 1: 31

ash-hiebber, Bonnie Speech r e c o g n i t i o n : s eman t i c s 1 4 : 4 4

Speech r e c o g n i t i o n : s eman t i c s 1 4 : 4 2

Speech r e c o g n i t i o n : c o n t r o i c o n c e p t s 1 4 : 4 4

Workshop on CL t h e o r y 1 9 7 5 9 : 4 - 9 , C 2 5

Page 85: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NAME INDEX

Neely , Riohard B. Speech r e c o g n i t i o n : model & system 1: 26

Neu, Helene Speech r e c o g n i t i o n : p h o n o l o g i c a l rules 14:18

Neuhaus, H. J . SHAD: a Shakespeare d i c t i o n a r y 1 4 : 27

N i c k e l , Gerhard Applied l i n g u i s t i c s conference 1 9 7 5 C27

Nicke r son , Raymond S. Teaching speech t o t h e deaf 1 : 6 0

Niederjbhn, R u s s e l l J. C o n t i n u a n t phonemes i n E n g l i s h 1 : 3 2

Niimi, S. ~ e c o r d i n g of l a r y n g e a l m u s c l e s , glottal shape 6 : 4 8

N i l s s o n , N i l s J . A r t i f i c i a l i n t e l l i g e n c e 6:49

Nimura, Tadamoto P e r s o n a l vowel q u a l i t y : a c o u s t i c s 6 5 7

Oakman, R. L . CAI i n t he h u m a n i t i e s a t U . Sou th Carol ina 1 : 2 3

Ohsuga, S. E x t r a c t i n g meaning f rom i n p u t s e n t e n c e s 1 : 5 3

Olriey , John SOLAR d i s t r i b u t e s f i r s t materials 6 : 7

~ ' ~ a l i e y , Michael H . What do s t a n d a r d TGs produce? 1: 38

Parentheses i n spoken a l g e b r a 1 : 2 9

Orne Jerrold ' B i b l i o g r a p h i c control seminar 6 : 9

Oshika , Beatrice T. Speech r e c o g n i t i o n : phonology 1 4 : 1 8

O t t e n , Casper Computes programming in natural language 1:69

O u e l l e t t e , F. JEUDEMO: a text handling system 1 4 : 2 6

Packard, D . 3 u ~ c t i ~ n grammar i n CL 1 4 : 3 2

Pagan, F . G . Representations f o r seniantic r e l a t i ons 1 : 4 3 , 6 : 6 9

Paitich, ~ a n i e l CAPER: p s y c h o l o g i c a l examina t ion l r 7 2

Eanevova, J. A m o d e l for s y n t h e s i s of Czech 1 : 5 5

Pardo, F r a n c i s Compute r -a s s i s t ed language a n a l y s i s 1 : 39

Park, W. Percep tua l continuous speech recogni t ion 1 4 : 1 6

P a r k i s o n , Roger C . Recogflition of expressions C 1 2 , M 5

Phsk, G. A t h e o r y of conversatrions and i n d i v i d u a l s 1 :58

P a t r i c k , Robert L . AFIPS system s e c u r i t y review manual 9: 2 7

Paxton , William H. A best-first parse r 1 4 : 3 5

Page 86: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NAME I N D E X 1974 8 6

Pep insky , Harold B e Metalanguage f o r communicat ian r e s e a r c h 6 : 7 1

Compu te r - a s s i s t ed l anguage a n a l y s i s sys tem 1: 4 1

Perwin , Donald Seman t i c s i n Russ i an -Eng l i sh MT 1.4:56

P f e i f e r , L a r r y L. I n v e r s e filter for s p e a k e r i d e n t i f i c a t i o n 14:lJ

P f e i f e r , M . Automat ic s u f f i x analysis 1: 4 1

P h i l l i p s , Brian Topic a n a l y s i s 1:53

Model of c o g n i t i v e knowledge 6:15

P l a t e k , M. Automata i n a g e n e r a t i v e d e s c r i p t i o n of l anguage 14:lO

Plath, Warren J. S t r i n g t r a n s f o r m a t i o n s i n REQUEST C22, M 8

Porch, Ann Devices for p r e p a r i n g f i l e s of text 6 :60

P o y t h r e s s , Vern Embedded prQnoun r e f e r e n c e 6 : 66

Price, Lynne A . Mode l l ing Propp & L e v i - S t r a u s s 14:47

Pur.ves, R . Byzon Speech r e c o g n i t i o n e x p e r i m e n t 14:46

Raben, Jo seph The humanis t i n t h e computer l a b 6: 50

Rab ine r , Lawrence P. Speech analysis-synt- l - resis , Fourier 1:30

Algorithm for b o u n d a r i e s i n ADPCM speech 6 : 5 2

Rab inowi t z , A r t h u r S . S e q u e n t i a l decod ing of speech 1 : 3 1

Radimsky, Anne-Louise Guichard Semant ic a n a l y s i s of E n g l i s h 1 : 5 2

Rao, P . V . S . Programming system for speech s y n t h e s i s 14:23

Raphael, B e r t r a m Programming l a n g u a g e s f o r A 1 6 : 8 6

Raskin, V i c t o r R e s t r i c t e d sub languages in MT 9:28-37

Rawson, D. Set-theoretic semant ics f o r ma thema t i ca l t e x t 1 :45

R a z e , C . T h e l i n g u i s t i c s t r i n g parser 14:35

Reddy, D . Raj Speech r e c o g n i t i o n : model & system 1 : 2 6

Reed, Susan K . ACM guide ' t o cgmputer s e c u r i t y 9 :27 '

R i c h , A. B r e a d t h - f i r s t search: s u r p r i s i n g r e s u l t s 1 : 5 6

Rickman, Jon I n t e r a c t i v e o n - l i n e t h e s a u r u s 1 : 6 2

Rieger, chuck Unders tand ing by conceptual i n f e r e n c e C40, M13

Riesbeck, C. K. Expectation as a mechanisa of comprehen'sion 1 :53

R o b e r t s , A . Hood NSF g ~ a n t for new j ~ u r n a l of CL 1 : 2

Robinson, J a y L , MEMEM: a new approach t o l e x i ~ o g r a p h y 1:36

Rondeau, Guy I n t e r f i a t i o n a b CL c o n f e r e n c e , Ot tawa 1 9 7 6 C6, M9:3

Page 87: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

N8ME INDEX 1974 87

Root, J u d i t h A . CASE s i m u l a t o r f o r c l i n i c a l e n c o u n t e r s 6 : 7 7

EENESYS g e n e r a t i n g system f o r CASE 6 :78

Rosen, Barry K . S y n t a c t i c complex i ty 6 : 6 6

Rosenberg, Aaron E m Speaker v e r i f i c a t i o n : human a b i l i t y 1 :'3O

R o s e n f e l d , Jack L. IFIP congress 7 4 p r o c e e d i n g s 14 :8

R o s e n t h a l , L. H a Boundary d e t e c t i o n i n ADPCM speech 6 :52

Ross, D m An EYEBALL view o f B l a k e ' s songs of i n n o c e n c e . . . 1 4 : 7 1

R o t h a u s e r , E r n s t H . Speech i n d i g i t a l c o m u n i c a t i ~ n 1 :34

Rousseau, P. Assessment of l i n g u i s t i c v a r i a t i o n theor ies 14:50

Rovner, P a u l C o n t r o l c o n c e p t s i n speech r e c o g n i t i o n 1 4 : 4 4

Rozencvejg , V. Ontogeny of p i d g i n & creole l a n g u a g e s 14:50

R u b e n s t e i n , Herbert C u r r e n t t r e n d s i n l i n g u i s t i c s 1 2 14:3

Rubin, Andee F l o w c h a r t s of SHRDLU1s grammar 6 : 6 7

Rush, J . E m Compute r -a s s i s t ed l anguage a n a l y s i s sys t em 1 : 4 1

R u s t i n , R a n d a l l N a t u r a l l anguage p rocess ing 1:19

Ryan, Joann P . Machine-aided e d i t i n g 1 4 : 5 7

S a g e r , N a o m i L e x i c a l subclasses of t h e s t r i n g p a r s e r C 9 , M 2

The l i n g u i s t i c s t r i n g parser 14:35

S a g v a l l , Anna-Lena I n f l e c t i o n a l a n a l y s i s of ~ u s s i a n 14 :31

Russ ian bel les- let t res , schoolbook text f i l e C 3 4

Sahin, Kenan E m Response r o u t i n g i n Se lcuk ne tworks 2 :74

~ a l k o f f , Morris S t r i n g grammar fo r French 6 : 6 4

Lezicography f o r a s t ~ i n g grammar f o r French 14:29

S a l s i e d e r , David G . Model l ing Propp & L e v i - S t r a u s s 14:47

S a l t o n , Gerard SMART retrieval system; d e s c r i p t o r sets 6:16

Sankoff, D . A s s e s s i n g l i n g u i s t i c v a r i a t i o n t h e o r i e s 14:50

Sa rgen t , D m C. S y l l a b l e d e t e c t i o n i n c o n t i n u o u s speech 6 : 5 3

Sato, Y . C o a r t i c u l a t i o n i n vowel sequence r e c o g n i t i o n 6 : 4 8

Sawashima, M a R e c ~ r d i n g o f l a r y n g e a l muscles, g l o t t i s 6 : 4 8

Schaab, C h r i s t i n e Q u e s t i o n modif ica t - fon i n r e t r i e v 3 l 1 4 : 5 4

Page 88: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

S c h a f e r , Ronald W. Speech a n a l y s i s - s y n t h e s i s : F o u r i e r

Boundaries in ADPCM speech 6 : 5 2

Schank, Roger C . C a u s a l i t y and r e a s o n i n g 1:,43

Computer mode'ls of though t and language 1 : 5 1

Workshop on Q t h e o r y 1 9 7 5 9 : 4-9

S c h e f f l e r , F. L . Index ing v a l u e of p a r t s o f documents 1:64

Schmidt , Joachim W. S t r u c t u r e and r e t r i e v a l i n CAI L:60 6 : 7 8

Schne ide r , Hans-Jochen In fo rma t ion systems j o u r n a l 6:80

CL: summer s c h o o l 1 9 7 4 6 : 1 4

S c h n e l l e , Helmut T h e o r e t i c a l l i n g u i s t i c s j o u r n a l 1:18

Schuck, Hans Jochen Procedures f o r t r a n s l a t i n g t hesau r i 1:66

Schumacher, H . H . Index ing v a l u e of p a r t s of documents 1:64

Schwar tz , Richard Ambiguity i n a c o u s t i c - p h o n e t i c cdnve r s ion 14:17

S c o t t , B. C . E . Theory of c o n v e r s a t i o n s and i n d i v i d u a l s 6:71

S c o t t , S e r n a r d E . The LogosMT system 6:5-6

S e b e ~ k , Thomas A. C u r r e n t t r e n d s i n l i n g u i s t i c s 1 2 14:3

S e l j a n , E. A h y b r i d r e t r i e v a l language 1 : 6 6

Senko, Michael E. Records, r e l a t i o n s , s e t s , e n t i t i e s , thingus .14:48

S e s s i o n s , Viv ian S . Urban i n f o r m a t i o n sys tems 6 ~ 3 9

S g a l l , Petr Automatic t e x t p r o c e s s i n g 1 : 2 0

Semantic and l o g i c a l r e p r e s e n t a t i o n of the s e n t e n c e 1 : 4 4

S h a p i r o , S t u a r t C . Review of Grammar, meaning, CL ( ~ i l K ' s ) 1: 46450

Sherman, Donald Webster's Seven th C o l l e g i a t e D i c t i o n a r y 6 : 6 3

A common s t r u c t u r e f b k l e x i c o g r a p h i e d a t a 14:28

S h e r r , Lawrence A . Computer - fur thered i n s t r u c t i o n 1 : 5 7

Sh i l lman , R . C h a r a c t e r r ecogn i t i on . : b i b l i o g r a p h y 6;62

Sh i l lman , R. C h a r a c t e r r e c o g n i t i o n : phenomenology 1 4 : 2 4

Shooman, M . L . R e l i a b l e s o f t w a r e con fe rence 1 9 7 5 6 : 2 1

Shum,F. Ying Y . Speech. p r o c e s s i n g : Walsh-Hadamard t r a n s f o r m s 1 : 2 7

S i k l o s s y , L . B r e a d t h [ - f i r s t s e a r c h : s u r p r i s i n g r e s u l t s 1:56

L,AWALY r o b o t p l a n n i n g sys tem 6 : 1 6

S i l ' ~ ~ e m a n , ,Harvey I?. P a r a m e t r i c modular speech p r o c e s s o r 1 4 : 1 9

Comparator f o r speech segmente rs , c l a s s i f i e r s 1 4 : 2 2

Simmons, Robert Tex tua l -g raph ic sy\stem 6:17

S ingh , Sadanand E n g l i s h c o n s o n a n t - c l a s t e r p e r c e p t i o n 14:15

Page 89: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

N W I N D E X 19'74 89

Skinner, i. William H e u r i s t i c s of i n f e r e n c e i n r e t r i e v a l 1 4 : 4 9

Sleeman, D. H. More i n t e l l i g e n t C A I 1: 57

Smith, Joan M. L i t e r a r y & l i n g u i s t i c computing b u l l e t i n 6 : 8 9

Smith, John B. Language ana lyze r : s p e c i f i c a t i o n s 6 :50

Smith, Lance S. Concordance & s t a t i s t i c s program 14:26

NT based on junc t ion grammar 1 4 : 5 8

Smith, R. N . Lexicon of Engl i sh L4:28

Snow, Thomas B. Segment c l a s s i f i c a t i o n i n cont inuous speech 1 : 2 8

Sone, ~ o s h i o Pe r sona l vowel q u a l i t y : a c o u s t i c s 6 : 5 7

Sophar, Gerald Document acces s seminar 6:9

Spang-Hanssen, E . Segmentation of French sen t ences 1 : 4 2

Spevack, M. SHAD: a Shakespeare d i c t i o n a r y 1 4 : 2 7

Spolsky, Bernard Vocabulary of young Navajo c h i l d r e n 1 : 7 2

Curren t t r e n d s i n l i n g u i s t i c s 1 2 1 4 : 3

Stank iewicz , Edward Cur ren t t r e n d s i n l i n g u i s t i c s 1 2 1 4 : 3

S t a r r , Chuck Semantics i n Russian-English MT 14:56

Stechow, Arnim v, Func t iona l g e n e r a t i v e grammar i n Prague 6 : 4 5

Stermole , David G. Discourse a n a l y s i s of a jargon 6 :93

Stevens , Kenneth N . Spectrogram read ing experiment 6:JZ

Teaching speech t o t h e deaf 1: 60

Stevens , Mary E l i z a b e t h AFIPS system secur i ty manual 9:27

S t ewar t , D. J. Phrase d i s t r i b u t i o n s and d i c t i o n a r y growth 14:25

Stokolova , N . A . Informat ion languages w i th grammar 1 : 6 3

Stoughton, David R. Machine-aided e d i t i n g 1 4 : 5 7

S t rong , Mark MT: German v e r b = c l a s s system 14:33

S t rong , Suzanne Marvin S t r u c t u r a l s u r r o g a t e s of Engl i sh t e x t 1: 52;6 :72

Computer a s s i s t e d language a n a l y s i s system 1:41

Su, Lo-Soun Speaker i d e n t i f i c a t i o n : n a s a l spectra 6:53

S u g i t a , Shigeharu English-Japanese MT 1:6&

Sukhot in , B. V. Determinat ion of s imple-sentence s t r u c t u r e 1 :42

Deciphering e x t r a t e r r e s t r i a l messages 1 : 7 1

Decoding methodology as a l i n g u i s t i c r e s e a r c h t o o l 14:ll

Svensson, Stig-Goran Segmental-nonsegmental i n t e r a c t i o n s 6 : 5 6

Page 90: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

NAME INDEX 1974

Szanser , A. 5 . Automatix error Correction i n t e x t 1 : 6 5

Szepe, Gyorgy C o n s i d e r a t i o n s f o r a future ana lys i s (MT) 1: 2 1

Szpakowicz, Btanis3aw MARYSIA: a c o n v e r ~ a t i o n a l sys tem 6 :70

T a p p e r t , C . C . Tree search i n p h o n e t i c - o r t h o g r a p h i c mapping 1 4 : 2 0

Adap t ive control bf c l a s s i f i c a t i o n , decod ing 6 :54

S e q u e n t i a l decod ing i n p h o n e t i c - g r a p h i c c o n v e r s i o n 1 : 3 1

T-atsumi, I . F. P r o c e s s i n g o f p a l a t o g r a p h i c p a t t e r n s 6 :51

TeKenbaum, J a y M . I n t e l l i g e n t machines a r e on t h e . way 6 : 87

IS IS : i n t e r a c t i v e f a c i l i t y for s c e n e a n a l y s i s 14:65

R e l a t i o n a l schema f o r s c e n e s w i t h c o l o r , t e x t u r e 1 4 2 6 6

Ter-Misakyants , E. T. Frequency d i c t i o n a r y of mathemat ics 1 9 7

Thomas, I a n B. C o n t i n u a n t phoneme r e c o g n i t i o n i n E n g l i s h 1 : 3 2

Thompson, R. B ren t S t a g e s of compute r ized l anguage a n a l y s i s 14:46

Thosqr, R e B e Speech s y n t h e s i s programming system 1 4 : 2 3

Titze, Ingo R. Human v o c a l sys tem: ma thema t i ca l model 1 4 : 1 2

T o g n o t t i , J . T e x t u a l - g r a p h i c i n f o r m a t i o n sys tem 6:93

Toma, L a r i s s a Seman t i c s i n Russian-English MT 14:56

Toma, Peter P . Machine-aided e d i t i n g L4 : 57

Rand c o r p ~ r a t i o n d a t a i n SYSTRAN 6 : 6 7 6 : 6 3

T r i l l i n g , Lau ren t Theorem p r o v e r i n Algol 6 8 6:76

Tuggle , F r a n c i s D. Verbal analogy problems 6 : 7 2

Compute r - fu r the red i n s t r u c t i o n 1 :57

Turh, Rein Speech f ~ r man-computer communicatf on 6 : 58

Ucuzoglu, Nathan SOLAR d c s t r i b u t e s f i rs t h a t e r i a l s

V a l l e y , J . A. Compu te r - a s s i s t ed language a n a l y s i s 1 : ' 4 1

Van de Craen , P . Con juga t ion o f Dutch verbs 1 :30

Page 91: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

VanderBrug, Gordon J. Language recognition in a theorem prover 14:49

Vauquois, Bernard Automatic translation 9:11

Veenhuis, A. A. M. Informatics in developing countries 9:23

Venezky, Richard L. Computer applications in lexicography 1 : 3 7

Ventura, J. Phenomenological character recognition 14:24

Characte'r recogniticm: bibliography 6:62

Vestal, Stanley C. Verbal analogy problems 6:72

Virb-el, J. Corpus of Latin inscriptions 6 : 93

Textual-graphic information system 6:93

VLeduts , E. Information languages with grammar

Wachal., Robert SIGLASH secretary 1973-1975 6:20

Waite, J. H. Phrase distributions and growth prediction 14:25

Waite, Stephen SIGLASH vice-chairman, 1973-1975 6:20

Walden, W. E. Interactive thesau~us structures 1: 62

Walker, Donald E. SRI speech understanding system 14 : 41

Directoy of workers in A1 6 : 4

Wallach, Y. Study and compilation of computer laqguages 14:61

Wang, William S.-Y. Chinese-English MT system 14:58

Wasserman, Paul Library and information services today 1 : 2 2

Weber, J. C. ATS in the teaching of exposition 6 :78

Weeks, Rollin V. Phonological rules in speech recognition 14:18

Wegner, Peter Theorem prover in Algol 68 6 : 7 6

Weil, Ben H. Information interface meeting 1975 6:9, 9:19-,20

Weinstein, Clifford J. Acoustic-phonetic analysis 14:15

Weinstock, John Nordic ahd General Linguistics conference C28

Wersig, Gernot Procedures for thesaurus translation 1:66

Weyl, S. A. ISIS: interactive scene andysis 14:65

Relational schema for color and texture of scenes 1%:66

Wilks, Yorick Natural language inference 6 : 7 5

Grammar, meaning, and the machine analysis of language 1:46-50

Page 92: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER

'NWE I N D E X 1974

Wilson, Linda L a CASE s i m u l a t o r o f c l i n i c a l e n c o u n t e r s 6 : 7 7

GENESYS geqerat ing system 5 o r CASE 6:78

Wisbey, R. A . Chairfnan, ALLC 1 :7

Wolf, H a C . ISIS i n t e r a c t i v e s c e n e a n a l y s i s 14:65

W o l f a r t , H . C h r i s t o p h Computer -ass i s ted 1 i n g u i s . t i c analysis 1:39

Woods, Wil l iam A. LUNAR re t r ieval system 1 4 : 4 6

SPEECHLIS: speech underStanding system 14:43

I n f e r e n c e problems i n speech u n d e r s t a n d i n g 6:71

C o n t r o l c o n c e p t s i n speech u n d e r s t a n d i n g 1 4 : 4 4

Yeh, R. T . Reliable s o f t w a r e confe rence 6 : 2 1

Yilmaz, H a P e r c e p t u a l c o n t i n u o u s speech r e c o g n i t i o n 1 4 : 1 6

Yong, C . E m Computer -ass i s ted language a n a l y s i s system 1 : 4 1

Yoshida , M a V o w e l sequence r e c o g n i t i o n : c p a r t i c h l a t i o n 6 : 4 8

young; C a r o l E l i z a b e t h . Automatic i n d e x i n g prOcedures 6:83

Zampol l i , Antonio Ariosto concordance 6 : 1 8

~ n t e r n a t i o n a l CL c o n f e r e n c e 1973: p roceed ings

Summer s c h o o l on CL 1 9 7 4 6 : 12-13

Zelkowitz, Computer de tworks confe rence C 1 7

Zoerche r , Luc ia Hadd C u r r e n t trends i n l i n g u i s t i c s 1 2 14:3

Z r i b i , Anne Lexicography fol: a string grammar of French 1 4 : 2 9

Zue, V i c t o r W . Acous t i c -phone t i c a n a l y s i s 14:15

P h o n o l o g i c a l rules i n speech unde ' rs tanding 14:18

Page 93: ~m: Journal Computational Linguist · ~m: Journal of Computational Linguist its THE FINITE STRING >= JER OF ME ASSOCIATI ON FOR COMPUTATIONAL LINGUI ST1 CS m: 11 - NUMBER 4 DECEMBER