paperhash stringlengths 40 40 | s2_corpus_id stringlengths 3 9 | arxiv_id stringclasses 0
values | title stringlengths 7 324 | abstract stringlengths 0 7.23k ⌀ | authors dict | summary stringclasses 0
values | field_of_study listlengths | venue stringlengths 15 253 ⌀ | publication_date stringdate 1952-06-01 00:00:00 2019-07-01 00:00:00 | n_references int32 0 4.92k ⌀ | n_citations int32 0 84.2k ⌀ | n_influential_citations int32 | introduction stringlengths 15 173k ⌀ | background stringlengths 2 115k ⌀ | methodology stringlengths 40 140k ⌀ | experiments_results stringlengths 1 142k ⌀ | conclusion stringlengths 7 38k ⌀ | full_text stringlengths 29 195k | decision bool 0
classes | decision_text stringclasses 0
values | reviews dict | comments dict | references dict | hypothesis stringlengths 105 1.27k ⌀ | month_since_publication int32 67 872 | avg_citations_per_month float32 0 1.24k ⌀ | mean_score float32 | mean_confidence float32 | mean_novelty float32 | mean_correctness float32 | mean_clarity float32 | mean_impact float32 | mean_reproducibility float32 | openreview_submission_id stringclasses 0
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
83f0fd6a9a3ff55996987777073285d00a8962d1 | 244077614 | null | Present interest in mechanical translation | On November 30, 1950, WFL sent out a letter of inquiry on the subject of Mechanical Translation to various men in the field. Their answers are now in, and the following is WFL's attempt at summarizing the present status of this problem as it is being tackled in both Europe and America. I. Men who are actually doing som... | {
"name": [
"Loomis, W. F."
],
"affiliation": [
null
]
} | null | null | Proceedings of the Conference on Mechanical Translation | 1952-06-01 | 0 | 0 | null | Booth writes that Richens' approach deals mainly with dictionary translation plus explanation which enables account to be taken of word endings in accordance with standard grammar also contained in the dictionary. He says that Richens is the most notable worker in MT in England.Calvin Mooers of the Zator Company writes... | null | null | null | Huskey writes that he is interested in running pilot tests concerning MT on their SWAC. This machine has an internal memory of 256 words at present, which is being enlarged to 8,000 with a magnetic drum and even 100,000 with a magnetic tape unit. SWAC was not designed for non-numerical work, but Huskey feels that it wi... | Main paper:
dr. a. d. booth, birkbeck college, london.:
Booth writes that he is primarily interested at present in codifying words so as to utilize memory space most advantageously.Donald MacKay writes that Booth hopes to mechanize a dictionary by electronic means.
dr. r. h. richens, institute of agricultural gene... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 872 | 0 | null | null | null | null | null | null | null | null |
5c9910a11e5ee5212ecf09e122e37da10c36a47d | 19613776 | null | Problems of vocabulary frequency and distribution | than in the procedures by which such information was obtained. To save valuable time for discussion, I shall make a few introductory and rather categorical statements especially pertinent to frequency problems in linguistics and to mechanical translation. If I sound dogmatic, the impression should be attributed to hast... | {
"name": [
"Bull, William E."
],
"affiliation": [
null
]
} | null | null | Proceedings of the Conference on Mechanical Translation | 1952-06-01 | 0 | 1 | null | PART I: Introduction: I assumed in preparing this report that this group would be more interested in conclusions and operational facts than in the procedures by which such information was obtained. To save valuable time for discussion, I shall make a few introductory and rather categorical statements especially pertine... | null | null | null | null | Main paper:
:
PART I: Introduction: I assumed in preparing this report that this group would be more interested in conclusions and operational facts than in the procedures by which such information was obtained. To save valuable time for discussion, I shall make a few introductory and rather categorical statements ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 872 | 0.001147 | null | null | null | null | null | null | null | null |
7e4ed27ac1f48d1493c0f3e39474767c9bb311d9 | 244077686 | null | The structure of the problem of mechanical translation | The problem of mechanical translation has three principal components: (i) the formulation of a set of specifications for the objective to be attained; (ii) the design of a translating machine; and (iii) theoretical translation problems. | {
"name": [
"Helmer, Olaf"
],
"affiliation": [
null
]
} | null | null | Proceedings of the Conference on Mechanical Translation | 1952-06-01 | 0 | 0 | null | null | null | null | null | Decisions under (i) will have to be made under consideration of the purpose to which the translation output will be put. The prime distinction here is as to whether the emphasis is placed on an accurate transmittal of the cognitive content of the input or rather on a faithful rendering of the style and emotional conten... | Main paper:
:
Decisions under (i) will have to be made under consideration of the purpose to which the translation output will be put. The prime distinction here is as to whether the emphasis is placed on an accurate transmittal of the cognitive content of the input or rather on a faithful rendering of the style an... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 872 | 0 | null | null | null | null | null | null | null | null |
3a02ddf01c8742cca94e8470f135d35f56ae1941 | 244077675 | null | Word-by-word translation | When I learned that I had been summoned to address myself to the topic of word-by-word translation I felt like a geographer invited to discuss the utility of the conception that the world is flat. In short, I can only say that word-by-word translation is not possible, if we are to understand by the term a wordwise tran... | {
"name": [
"Oswald, Victor A."
],
"affiliation": [
null
]
} | null | null | Proceedings of the Conference on Mechanical Translation | 1952-06-01 | 0 | 3 | null | to be sure, but it presupposes a human translator with a grasp of what we vaguely call "the elements" of German, a translator who is, for instance, equipped to find his way among multiple choices of the sort I outlined above. Pollard's rule 1 is that when a noun (identifiable by capitalization) occurs on a "break" (com... | null | null | null | null | Main paper:
:
to be sure, but it presupposes a human translator with a grasp of what we vaguely call "the elements" of German, a translator who is, for instance, equipped to find his way among multiple choices of the sort I outlined above. Pollard's rule 1 is that when a noun (identifiable by capitalization) occurs... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 872 | 0.00344 | null | null | null | null | null | null | null | null |
3c0dd4b5f42e88d1317475b575df699d95023edd | 27957304 | null | The conference on mechanical translation held at {M}.{I}.{T}., {J}une 17-20, 1952 | The following report was prepared immediately after the writer's return from the conference. It was written from the viewpoint of an engineer listening to experts in a field far separated from his own. Such judgments as may be found interspersed amongst the reports of individual papers are of an engineering nature, and... | {
"name": [
"Reynolds, Craig"
],
"affiliation": [
null
]
} | null | null | Proceedings of the Conference on Mechanical Translation | 1952-06-01 | 0 | 7 | null | The concept of mechanical translation originated in two areas, the first being cryptographic work conducted by various governments during the late war, and the second being the successful inauguration and employment of the simultaneous translation schemes presently employed by the UN and other internation conferences. ... | null | null | null | null | Main paper:
:
The concept of mechanical translation originated in two areas, the first being cryptographic work conducted by various governments during the late war, and the second being the successful inauguration and employment of the simultaneous translation schemes presently employed by the UN and other interna... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 872 | 0.008028 | null | null | null | null | null | null | null | null |
524607d74ad17c1ef4fbd9dc1108232db2570d1e | 243627545 | null | Translation | The attached memorandum on translation from one language to another, and on the possibility of contributing to this process by the use of modern computing devices of very high speed, capacity, and logical flexibility, has been written with one hope only -that it might possibly serve in some small way as a stimulus to s... | {
"name": [
"Weaver, Warren"
],
"affiliation": [
null
]
} | null | null | Proceedings of the Conference on Mechanical Translation | 1952-06-01 | 0 | 0 | null | There is no need to do more than mention the obvious fact that a multiplicity of language impedes cultural interchange between the peoples of the earth, and is a serious deterrent to international understanding.The present memorandum, assuming the validity and importance of this fact, contains some comments and suggest... | null | null | null | null | Main paper:
translation l) preliminary remarks:
There is no need to do more than mention the obvious fact that a multiplicity of language impedes cultural interchange between the peoples of the earth, and is a serious deterrent to international understanding.The present memorandum, assuming the validity and importa... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 872 | 0 | null | null | null | null | null | null | null | null |
99001a274718e0a23c849257892a6dd36ab92e70 | 244077696 | null | Organisation and Method in Mechanical Translation Work | Certain postulates are posited as a basis for the orientation and organization of research in mechanical translation. They are the following: 1. The essential problem of mechanical translation is the establishment of acceptable correlation between the signs of one system (the source language) and those of another (the ... | {
"name": [
"Dostert, L. E."
],
"affiliation": [
null
]
} | null | null | Proceedings of the International Conference on Mechanical Translation | 1956-10-01 | 0 | 0 | null | 1. The essential problem of mechanical translation is the establishment of acceptable correlation between the signs of one system (the source language) and those of another (the target language). 2. The signs of natural language, unlike the symbols of such systems as mathematics or chemistry, may be incomplete and mult... | null | null | null | null | Main paper:
:
1. The essential problem of mechanical translation is the establishment of acceptable correlation between the signs of one system (the source language) and those of another (the target language). 2. The signs of natural language, unlike the symbols of such systems as mathematics or chemistry, may be i... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 820 | 0 | null | null | null | null | null | null | null | null |
42b86f3b83f075155e3a16733126f9eaf68748c5 | 34116601 | null | The Requirements of Lexical Storage | Lexical Search In recent studies of Machine Translation a good deal of attention has been paid to translation, but very little to machine. There seems to be a feeling the machine will be more or less like existing computers. Such an assumption must be taken with caution. | {
"name": [
"King, Gilbert W."
],
"affiliation": [
null
]
} | null | null | Research in Machine Translation | 1957-04-01 | 0 | 0 | null | There are two ways to carry out computations on a machine. One is to construct the required result by algorithms; for example, the quantity sin x can be calculated by a repetitive formula equivalent to a power series. The other is to rely heavily on table look-up. In present-day computers the latter method is almost ex... | null | null | null | null | Main paper:
:
There are two ways to carry out computations on a machine. One is to construct the required result by algorithms; for example, the quantity sin x can be calculated by a repetitive formula equivalent to a power series. The other is to rely heavily on table look-up. In present-day computers the latter m... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 814 | 0 | null | null | null | null | null | null | null | null |
826fb686f66a4416310bd5c35f049afb688c737c | 41645107 | null | Grouping and Dependency Theories | Immediate-constituent analysis and dependency analysis (two theories of syntactic description) are based, respectively, on the topologies of grouping and of trees. A correspondence between structures of the two types is defined, and the two topologies are compared, mainly in terms of their empirical applications. The t... | {
"name": [
"Hays, David G."
],
"affiliation": [
null
]
} | null | null | Proceedings of the National Symposium on Machine Translation | 1960-02-01 | 0 | 23 | null | 1 I am grateful to Jane Pyne, H. Hiž, A. Madansky, and T. W. Mullikin for their criticisms and suggestions, which have helped substantially in the long, slow development of the material presented here. None is to be blamed for remaining errors. 2 For examples of Soviet work using dependency theory, see the abstracts by... | null | null | null | null | Main paper:
:
1 I am grateful to Jane Pyne, H. Hiž, A. Madansky, and T. W. Mullikin for their criticisms and suggestions, which have helped substantially in the long, slow development of the material presented here. None is to be blamed for remaining errors. 2 For examples of Soviet work using dependency theory, se... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 780 | 0.029487 | null | null | null | null | null | null | null | null |
cfeffb24d9d90495ac75e028893e0768e601ef30 | 244077632 | null | Linguistic Research at the {RAND} Corporation | This paper describes postediting rules for description of funclion in context, work on computational routines for semi-automatic analysis, the concept of idiom-in-structure, and two broad problems on which work is just beginning at RAND: grammatic transformation and distributional semantics. The latter problems are esp... | {
"name": [
"Hays, David G."
],
"affiliation": [
null
]
} | null | null | Proceedings of the National Symposium on Machine Translation | 1960-02-01 | 1 | 0 | null | We are spending this winter in writing a major report. After nearly three years of research, and after processing a quartermillion running words of text, we find that we have a lot to say. In the self-description that we furnished the National Science Foundation for its most recent survey of MT studies, 2 we expressed ... | null | null | null | null | Main paper:
introduction:
We are spending this winter in writing a major report. After nearly three years of research, and after processing a quartermillion running words of text, we find that we have a lot to say. In the self-description that we furnished the National Science Foundation for its most recent survey ... | null | null | null | null | {
"paperhash": [
"edmundson|research_methodology_for_machine_translation"
],
"title": [
"Research methodology for machine translation"
],
"abstract": [
"The general approach used at The RAND Corporation is that of convergence by successive refinements. The philosophy that underlies this approach i... | null | 780 | 0 | null | null | null | null | null | null | null | null |
02190c10c526b103a65549726f5c7906b6b60cd9 | 244077657 | null | {MT} at the {M}assachusetts Institute of Technology | Mechanical translation has had a long history at M.I.T. Shortly after the Warren Weaver memorandum of 1949, Yehoshua Bar-Hillel became the first full-time worker in the field. He contributed many of the early ideas and will be well remembered for this. He organized the first conference on mechanical translation, held a... | {
"name": [
"Yngve, Victor H."
],
"affiliation": [
null
]
} | null | null | Proceedings of the National Symposium on Machine Translation | 1960-02-01 | 0 | 0 | null | The reports or proceedings of both these conferences were published in the journal Mechanical Translation.This journal was founded at M.I.T. in 1954 when it became obvious that there was a need for better communication between those interested in MT and to prevent needless duplication of effort. The journal has continu... | null | null | null | null | Main paper:
:
The reports or proceedings of both these conferences were published in the journal Mechanical Translation.This journal was founded at M.I.T. in 1954 when it became obvious that there was a need for better communication between those interested in MT and to prevent needless duplication of effort. The j... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 780 | 0 | null | null | null | null | null | null | null | null |
695dd7dea2c37118c3e65bee2d9196de51d38dc7 | 244077688 | null | Nestings Within the Prepositional Structure | This paper presents a preliminary description of an algorithmic operation to handle nested strings within the prepositional structure in Russian. The prepositional structure is defined as consisting of a preposition with its case-determining requirement at the permitted point of entry, and of a noun or its substitute a... | {
"name": [
"Zarechnak, Michael"
],
"affiliation": [
null
]
} | null | null | Proceedings of the National Symposium on Machine Translation | 1960-02-01 | 0 | 0 | null | null | null | The prepositional structure is defined as consisting of a preposition with its case-determining requirement at the permitted point of entry, and of a noun or its substitute at the permitted point of exit which satisfies the requirement incurred by the preposition.на мосту "on the bridge"The flow chart shown in Appendix... | null | null | Main paper:
:
The prepositional structure is defined as consisting of a preposition with its case-determining requirement at the permitted point of entry, and of a noun or its substitute at the permitted point of exit which satisfies the requirement incurred by the preposition.на мосту "on the bridge"The flow chart... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 780 | 0 | null | null | null | null | null | null | null | null |
0fad3801ac2c71f12e68eb3b26da82c7235d944f | 243739969 | null | Conclusion | CONCLUSION H.P.Edmundson Planning Research Corporation On behalf of my colleagues, I thank you for the kind remarks. None of this, of course, is possible without such scholars as Professor Yngve. | {
"name": [
"Edmundson, H. P."
],
"affiliation": [
null
]
} | null | null | Proceedings of the National Symposium on Machine Translation | 1960-02-01 | 0 | 0 | null | null | null | null | null | We are on the frontier of a very exciting interdisciplinary endeavor, and we will see a very steady acceleration in MT efforts in this country. While the past 10 years have gone rather slowly for MT, I predict that the next 10 years will yield significant results in all linguistic data processing. | Main paper:
:
We are on the frontier of a very exciting interdisciplinary endeavor, and we will see a very steady acceleration in MT efforts in this country. While the past 10 years have gone rather slowly for MT, I predict that the next 10 years will yield significant results in all linguistic data processing.
... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 780 | 0 | null | null | null | null | null | null | null | null |
b8721413dafd14c991cf4e32e08faf32c2d701eb | 244077649 | null | {C}ambridge Language Research Unit Presentation | After he offered a definition of a lexeme as "the basic unit of the dictionary or lexicon", Professor Lamb made some observations on lexemes in general, and then, turning back to the handout, shifted the discussion to nonce forms (forms coined as combinations of items), and related material on segmentation. | {
"name": [
"Masterman, Margaret and",
"Needham, Roger"
],
"affiliation": [
null,
null
]
} | null | null | Proceedings of the Wayne State University Conference of Federally Sponsored Machine Translation Workers | 1960-07-01 | 0 | 0 | null | null | null | null | He added that with the blocking routine, titivation (homograph resolution)is carried on alternatively with bracketing, rather than doing everything in two separate stages.Mr. Needham also described Parker-Rhodes' Rule for Bracketing, and thereafter, proceeded to offer a graphic example of how a dictionary entry is made... | null | Main paper:
:
He added that with the blocking routine, titivation (homograph resolution)is carried on alternatively with bracketing, rather than doing everything in two separate stages.Mr. Needham also described Parker-Rhodes' Rule for Bracketing, and thereafter, proceeded to offer a graphic example of how a dictio... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 775 | 0 | null | null | null | null | null | null | null | null |
c40cc26b91d594dcace63c2985421c721be954c7 | 244077678 | null | Centro di Cibernetica di {M}ilano Presentation | WAYNE STATE UNIVERSITY PRESENTATION JANIOTIS Miss Janiotis briefly discussed a 709 interpretive subroutine for machine translation problems (a description and flowcharts appear in the Wayne handout). She answered several questions and then proceeded to discuss nominal, prepositional, and governing modifier blocking rou... | {
"name": [
"Ceccato, Silvio"
],
"affiliation": [
null
]
} | null | null | Proceedings of the Wayne State University Conference of Federally Sponsored Machine Translation Workers | 1960-07-01 | 0 | 0 | null | as they appear in the Wayne handout.She noted that the blocking routines were similar to that which was offered earlier by Mr. Needham of CLRU, under the title of Bracketing.Miss Janiotis elaborated on the Nominal Blocking Routine and the remaining time was spent in open discussion of both Dr. Josselson's and Miss Jani... | null | null | null | null | Main paper:
:
as they appear in the Wayne handout.She noted that the blocking routines were similar to that which was offered earlier by Mr. Needham of CLRU, under the title of Bracketing.Miss Janiotis elaborated on the Nominal Blocking Routine and the remaining time was spent in open discussion of both Dr. Jossels... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 775 | 0 | null | null | null | null | null | null | null | null |
3e74f048b6aa5a0b778eee9d00b76231bcc2e20d | 244077627 | null | Wayne State University Presentation | Two questions receiving primary attention in the following open discussion period were concerned with scanning technique and the order of precedence to be taken regarding volume of data and awkward cases. | {
"name": [
"Josselson, Harry H. and",
"Janiotis, Amelia"
],
"affiliation": [
null,
null
]
} | null | null | Proceedings of the Wayne State University Conference of Federally Sponsored Machine Translation Workers | 1960-07-01 | 0 | 0 | null | It was generally agreed that scanning should be done back and forth, and there remained some mixed feeling about whether or not volumes of data should be taken first, as opposed to the immediate analysis of awkward examples.Wednesday, 20 July, 9:00-10:15 a.m.Dr. Josselson's presentation consisted of a detailed descript... | null | null | null | null | Main paper:
:
It was generally agreed that scanning should be done back and forth, and there remained some mixed feeling about whether or not volumes of data should be taken first, as opposed to the immediate analysis of awkward examples.Wednesday, 20 July, 9:00-10:15 a.m.Dr. Josselson's presentation consisted of a... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 775 | 0 | null | null | null | null | null | null | null | null |
0619ea61b6c3173470d53e18c1b3cae6325a1d57 | 244077683 | null | {M}assachusetts Institute of Technology Presentation | Brown had nothing he felt he might offer in the way of linguistic information, in view of the fact that he has spent the past fourteen months concentrating on questions of programming only. A significant product of this fourteen month period is Dr. Brown's "Simulated Linguistic Computer". Dr. Brown presented his handou... | {
"name": [
"Lieberman, David and",
"Yngve, Victor H."
],
"affiliation": [
null,
null
]
} | null | null | Proceedings of the Wayne State University Conference of Federally Sponsored Machine Translation Workers | 1960-07-01 | 0 | 4 | null | the Simulated Linguistic Computer, and taking the word 'haut' as an example (Dr. Brown's work has dealt exclusively with French), he discussed and graphically demonstrated an 'up-dating' procedure.A brief question-answer discussion period followed. A question of major concern involved the quantity of text that should b... | null | null | null | null | Main paper:
:
the Simulated Linguistic Computer, and taking the word 'haut' as an example (Dr. Brown's work has dealt exclusively with French), he discussed and graphically demonstrated an 'up-dating' procedure.A brief question-answer discussion period followed. A question of major concern involved the quantity of ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 775 | 0.005161 | null | null | null | null | null | null | null | null |
4b89f0a2b1404e3257a1301b66ebea61240d9c9d | 913028 | null | Random generation of {E}nglish sentences | THIS paper reports the results of writing and running a program which constructs English sentences. The sentences are chosen at random by the program from among those English sentences that conform to certain rules of sentence structure. This work is a continuation of a line of research begun several years ago. | {
"name": [
"Yngve, Victor H."
],
"affiliation": [
null
]
} | null | null | Proceedings of the International Conference on Machine Translation and Applied Language Analysis | 1961-09-01 | 5 | 21 | null | IN the paper "A Framework for Syntactic Translation", 1 it was proposed that a translation routine could be divided into six logically separate parts. There was a horizontal division into three steps: sentence analysis, transfer of structure, and sentence synthesis; and there was a vertical division into the operationa... | null | null | null | null | Main paper:
:
IN the paper "A Framework for Syntactic Translation", 1 it was proposed that a translation routine could be divided into six logically separate parts. There was a horizontal division into three steps: sentence analysis, transfer of structure, and sentence synthesis; and there was a vertical division i... | null | null | null | null | {
"paperhash": [
"yngve|a_model_and_an_hypothesis_for_language_structure",
"yngve|a_programming_language_for_mechanical_translation",
"yngve|a_framework_for_syntactic_translation"
],
"title": [
"A model and an hypothesis for language structure",
"A programming language for mechanical translati... | null | 761 | 0.027595 | null | null | null | null | null | null | null | null |
d14608edd72ec74c2bb2469a014db032d46183ce | 6621683 | null | On the value of dependency connections | VALUES are tentatively defined as numbers assigned to types of syntactic relations such that connections of higher value are established in preference to connections of lower value during sentence-structure determination. Given a text in which sentence structures are known, the values of some syntactic relations can be... | {
"name": [
"Hays, David G."
],
"affiliation": [
null
]
} | null | null | Proceedings of the International Conference on Machine Translation and Applied Language Analysis | 1961-09-01 | 5 | 0 | null | VALUES are tentatively defined as numbers assigned to types of syntactic relations such that connections of higher value are established in preference to connections of lower value during sentence-structure determination. Given a text in which sentence structures are known, the values of some syntactic relations can be... | null | null | Values are to be assigned in such a way that establishing high-value dependency connections in preference to low-value improves the average accuracy of an SSD programme. In this section, a plan is given for the use of value numbers during SSD. This plan is not the only conceivable plan, and it is not necessarily useful... | Automatic aids to linguistic analysis and lexicographic research are essential because the volumes of data that must be processed are too large for systematic, thorough study by manual techniques. Even relatively unsophisticated lexicography has consumed whole lifetimes of talented effort. In this paper, one computatio... | Main paper:
explication:
Values are to be assigned in such a way that establishing high-value dependency connections in preference to low-value improves the average accuracy of an SSD programme. In this section, a plan is given for the use of value numbers during SSD. This plan is not the only conceivable plan, and... | null | null | null | null | {
"paperhash": [
"stoakes|introduction_to_linguistic_structures"
],
"title": [
"Introduction to Linguistic Structures"
],
"abstract": [
"Chapter headings include : What is Language t; Stress, Juncture, Pitch; Consonants; Phoneme and Allophone; Vowels and Vowel Nuclei; Phonotactios; Morphemics; Mor... | null | 761 | 0 | null | null | null | null | null | null | null | null |
ae2a2e33d367d9344e75715d3e66d07ee32ba689 | 244077639 | null | Human translation and translation by machine | THE COMPREHENSION OF A TEXT, BY THE HUMAN TRANSLATOR AND BY THE MACHINE 1. THE SUBJECT OF THE CONTRIBUTION TIME, at congresses, is always too short, and the contribution of a team, even if split up into several papers, cannot possibly cover the entire ground of a subject as large and as complex as Mechanical Translatio... | {
"name": [
"Ceccato, Silvio and",
"Zonta, Bruna"
],
"affiliation": [
null,
null
]
} | null | null | Proceedings of the International Conference on Machine Translation and Applied Language Analysis | 1961-09-01 | 0 | 5 | null | rather more towards thought than towards language (at least with regard to those aspects of language that usually are considered formal).The results of this research, therefore, also belong to a general linguistics of which MT is an application and a test. As you will soon notice, ours is a novel kind of linguistics co... | null | null | An analysis of thought and its contents that accounts for every different word and every different expression by isolating as corresponding to each a different operation or combination of operations, shows that four kinds of operation are required: Differentiation, Figuration, Categorisation, and Correlation.Differenti... | A dynamic conception of this kind made it necessary to overcome some difficulties inherent in the way in which thought and language have been considered in traditional philosophy and in the psychoology deriving from this. According to this tradition we see in the brain, not operations, but a passive mirror which reflec... | Main paper:
the types of study:
Our approach to MT, as we nave said, is but one of the possible applications of a series of studies aimed at an analysis of thought and its contents on the one hand and of language on the other.The purpose of these studies is primarily that of constituting a psychology and a linguist... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 761 | 0.00657 | null | null | null | null | null | null | null | null |
71162db89ed8003dc810bb644a13084a1affc02b | 244077634 | null | A fourth level of linguistic analysis | Note the article: it is 'a', not 'the'. | {
"name": [
"Zarechnak, Michael"
],
"affiliation": [
null
]
} | null | null | Proceedings of the International Conference on Machine Translation and Applied Language Analysis | 1961-09-01 | 0 | 0 | null | THE GAT (Georgetown Automatic Translation) programs for Russian/English Machine Translation have, up to the present time, provided for three levels of linguistic analysis (morphological, syntagmatic, syntactic) .# The machine translation output produced by these programmes has been subjected to further structural analy... | null | null | null | null | Main paper:
introduction:
THE GAT (Georgetown Automatic Translation) programs for Russian/English Machine Translation have, up to the present time, provided for three levels of linguistic analysis (morphological, syntagmatic, syntactic) .# The machine translation output produced by these programmes has been subject... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 761 | 0 | null | null | null | null | null | null | null | null |
da3ae9324b6e630f02bcf2c0952c19eb8d2e0b8d | 44955190 | null | Structure at the lexical level and its implication for transfer grammar | 1. The girl was dead. 2. He became president. 3. He worked all day. 4. The time elapsed quickly. 5. Solving the problem fatigued him. 6. He polishes the arrow. 7. He shot a hole in the wall. 8. Both of the brothers built a house. 9. He shook his finger. 10. He knows the answer. 11. He knows that you were there. | {
"name": [
"Klima, Edward S."
],
"affiliation": [
null
]
} | null | null | Proceedings of the International Conference on Machine Translation and Applied Language Analysis | 1961-09-01 | 4 | 9 | null | IN the following discussion I shall present preliminary results from an investigation of structuring within the lexicon of a language. These results suggest that in certain areas of the lexicon lexical items must be characterized in terms of the presence or absence of specific recurring lexico-semantic components. Furt... | null | null | null | null | Main paper:
introduction:
IN the following discussion I shall present preliminary results from an investigation of structuring within the lexicon of a language. These results suggest that in certain areas of the lexicon lexical items must be characterized in terms of the presence or absence of specific recurring le... | null | null | null | null | {
"paperhash": [
"harris|transfer_grammar"
],
"title": [
"Transfer Grammar"
],
"abstract": [
"0. Introduction 1. Defining difference between languages 2. Structural transfer 2.1. Corresponding morpheme classes 2.2. Corresponding morphological structures 3. Phonetic and phonemic similarity 3.1. Pho... | null | 761 | 0.011827 | null | null | null | null | null | null | null | null |
38453aafce51385b4cebfad13a4cf5e8db95faff | 244077665 | null | Mechanised semantic classification | Replacement" is used rather than "substitution" to emphasise the fact that although the element is changed, the ploy is preserved. (98026) 421 * or groups of similar references. # I am excluding the case here of genuinely fortuitous homonyms between wordsigns in the language. | {
"name": [
"Sparck-Jones, Karen"
],
"affiliation": [
null
]
} | null | null | Proceedings of the International Conference on Machine Translation and Applied Language Analysis | 1961-09-01 | 0 | 0 | null | IT is now widely admitted (see, for instance, de Grolier (1)) that a semantic classification will be required for machine translation and information retrieval; and that as mechanised procedures will be carried out on it, it must be detailed, precise, and explicit. This paper is primarily concerned with the constructio... | null | null | null | The experiments were carried out on EDSAC II, the Cambridge University Mathematical Laboratory Computer, as part of the research into the theory of clumps. It is expected that with present techniques experiments can be carried out on up to 1000 rows; work, is in progress on more powerful methods for handling larger qua... | Main paper:
primary classification:
The first object of this investigation is to find a way of defining* a word-use which is both semantically adequate and a suitable basis for further classification; i.e. we are looking for an appropriate form of mechanisable dictionary entry.The simplest approach, i.e. that of go... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 761 | 0 | null | null | null | null | null | null | null | null |
988e42e833cc53b78b1839a7a310c36140b97a0d | 244077656 | null | A new model of syntactic description | PREFACE THIS paper expounds the lattice theory of syntax developed by the Cambridge Language Research Unit during the last five years. The idea, that the conceptual apparatus of lattice theory could be put to use in the description of linguistic phenomena originated with M. Masterman in 1956, and was first put before t... | {
"name": [
"Parker-Rhodes, A. F."
],
"affiliation": [
null
]
} | null | null | Proceedings of the International Conference on Machine Translation and Applied Language Analysis | 1961-09-01 | 0 | 5 | null | This paper describes briefly a new model of grammatical description, devised originally with the purpose of providing a better tool for the machine processing of language material. Particular attention has been given to the advantages likely to accrue, for this purpose, from exploiting to the full whatever features cou... | null | null | null | In the system, represented in a simplified form in figure 6, we can interpret certain of the lattice relations in more detail than has been shown above. One additional descriptive contrast which the theory thus gives us is that between the governor and the dependent of any compound substituent. One finds, in any such g... | Main paper:
introduction:
This paper describes briefly a new model of grammatical description, devised originally with the purpose of providing a better tool for the machine processing of language material. Particular attention has been given to the advantages likely to accrue, for this purpose, from exploiting to ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 761 | 0.00657 | null | null | null | null | null | null | null | null |
eada962e0f5af8cff3d8c5690c47b932208f39d9 | 51860864 | null | An Introduction to Computational Procedures in Linguistic Research | PREFATORY REMARKS EVEN at the 1962 Institute where these lectures were presented, it was hard to find much interest in linguistic research of the empirical sort. Two areas were far more attractive: the design and refinement of translation algorithms, and the establishment of mathematical theory for linguistics. Yet eac... | {
"name": [
"Hays, David G."
],
"affiliation": [
null
]
} | null | null | Automatic Translation of Languages NATO Summer School | 1962-07-01 | 13 | 0 | null | EVEN at the 1962 Institute where these lectures were presented, it was hard to find much interest in linguistic research of the empirical sort. Two areas were far more attractive: the design and refinement of translation algorithms, and the establishment of mathematical theory for linguistics. Yet each algorithm either... | null | null | The posteditor is a linguistic technician, a subprofessional aide to the linguist. He knows the languages that are being studied and he also knows, to a limited extent, the theoretical bases of the research. The tasks that are assigned to him are exacting, but they must be adapted to his special abilities and never all... | null | Main paper:
methodology and research design:
The courses taught in American high schools include English, History, Geography, and Mathematics. Until courses in 'Human Relations' were introduced, English and Mathematics had the special distinction of being the only courses intended to influence behavior outside the ... | null | null | null | null | {
"paperhash": [
"miller|decision_units_in_the_perception_of_speech",
"harper|studies_in_machine_translation-8:_manual_for_postediting_russian_text.",
"harris|from_phoneme_to_morpheme",
"borko|the_construction_of_an_empirically_based_mathematically_derived_classification_system"
],
"title": [
... | null | 751 | 0 | null | null | null | null | null | null | null | null |
2378d5f0faa16c3cecc4e113e7328f073d0f3781 | 39628235 | null | Un Syst{\`e}me morphologique, compromis entre les Facilit{\'e}s de la Compilation, les Recherches Syntaxiques et l{'}Adaptation a de futurs Programmes de {T}.{A} | Examen de certains problèmes généraux relatifs à l'organisation d'un dictionnaire pour la traduction automatique. Définition formelle élémentaire. Recherche d'une forme dans un dictionnaire. Structure des informations linguistiques enregistrées dans le dictionnaire, structures morphologiques et sémantiques. Principes d... | {
"name": [
"Dupuis, L."
],
"affiliation": [
null
]
} | null | null | Automatic Translation of Languages NATO Summer School | 1962-07-01 | 4 | 0 | null | Etant donné l'importance et les difficultés des problèmes syntaxiques et sémantiques dans la T.A., le titre de cet exposé risque de paraître trivial. Il est bien connu, depuis les premières recherches faites dans les années 1954, que le traitement automatique de la morphologie d'une langue naturelle ne présente pas de ... | null | null | null | null | Main paper:
définition formelle élémentaire d'un dictionnaire:
Un dictionnaire est une suite finie de couples:(F 1 S 1 )...(F i .S i )...(F n S n ). Chaque F i est une forme graphique ou assemblage linéaire de symboles élémentaires appartenant à un alphabet donné. Cet assemblage de symboles est construit suivant de... | null | null | null | null | {
"paperhash": [
"kelly|glossary_lookup_made_easy",
"lamb|a_high-speed_large-capacity_dictionary_system"
],
"title": [
"Glossary Lookup Made Easy",
"A high-speed large-capacity dictionary system"
],
"abstract": [
"Abstract : Most of the work on the dictionary problem for machine translatio... | Problem: The paper addresses the general issues related to organizing a dictionary for automatic translation, focusing on the formal definition, search for forms in a dictionary, and the structure of linguistic information recorded in the dictionary, including morphological and semantic structures.
Solution: The hypot... | 751 | 0 | null | null | null | null | null | null | null | null |
0fa11ffbdc32460d48c4101c2ecff8e7ce3a735b | 207974610 | null | Four Lectures on Algebraic Linguistics and Machine Translation | THE ROLE OF GRAMMATICAL MODELS IN MACHINE TRANSLATION LINGUISTICS, as every other empirical science, is a complex mixture of theory and observation. The precise nature of this mixture is still not too well understood, and in this respect the difference between linguistics and, say, physics is probably at most one of de... | {
"name": [
"Bar-Hillel, Yehoshua"
],
"affiliation": [
null
]
} | null | null | Automatic Translation of Languages NATO Summer School | 1962-07-01 | 26 | 9 | null | , while Curry [9] became more and more aware of the implications of combinatorial logic to theoretical linguistics. It is, though, perhaps not too surprising that the ideas of Post and Curry should be no better known to professional linguists than those of Carnap and Ajdukiewicz.It seems that a major change in the peac... | null | null | null | null | Main paper:
syntactic complexity:
Extremely little is known about syntactic complexity, though this notion has come up in many discussions of style, readability, and, more recently, of mechanization of syntactic analysis. Its explication has been universally regarded as a matter of great difficulty, this probably b... | null | null | null | null | {
"paperhash": [
"ginsburg|two_families_of_languages_related_to_algol",
"rabin|finite_automata_and_their_decision_problems",
"martin|from_a_logical_point_of_view",
"post|a_variant_of_a_recursively_unsolvable_problem",
"carnap|logical_syntax_of_language",
"ginsburg|some_recursively_unsolvable_p... | null | 751 | 0.011984 | null | null | null | null | null | null | null | null |
d49ef005fd6fe2e2684c1552cc894eed459df4fd | 27354720 | null | On the Equivalence of Models of Language used in the Fields of Mechanical Translation and Information Retrieval | The purpose of this paper is to compare a certain number of well known models used in the fields of Mechanical Translation (M.T.) and Information Retrieval (I.R.). Different surveys of this type exist , Hays [2], Lecerf [3], Sestier and Dupuis [4]), where models have been compared from the point of view of practical an... | {
"name": [
"Gross, Maurice"
],
"affiliation": [
null
]
} | null | null | Automatic Translation of Languages NATO Summer School | 1962-07-01 | 13 | 31 | null | THE majority of MT and IR projects have been primarily concerned with the construction of grammars and computer programs aiming to produce syntactic analyses for the sentences of a given natural language.In certain cases, the grammar and the recognition routine are completely amalgamated into a single program and the g... | The grammars of the most general type we have described in the previous section can be viewed as arbitrary Turing Machines or equivalently [32] as combinatorial systems (Semi-Thue Systems) where the sentences are derived from an axiom S by the means of a finite set of rewriting rules (productions): .The sentences ar... | (1) The equivalence of context-free languages and immediate constituent languages has been proven by Chomsky [8] . He proved that for any context-free grammar there exists a grammar whose rules are all of the form A BC or A a where the capital letters (members of the nonterminal vocabulary) represent structures and... | null | null | Main paper:
chomsky's context-free languages*:
The grammars of the most general type we have described in the previous section can be viewed as arbitrary Turing Machines or equivalently [32] as combinatorial systems (Semi-Thue Systems) where the sentences are derived from an axiom S by the means of a finite set of ... | null | null | null | null | {
"paperhash": [
"davis|computability_and_unsolvability",
"chomsky|three_models_for_the_description_of_language",
"ginsburg|some_recursively_unsolvable_problems_in_algol-like_languages"
],
"title": [
"Computability and Unsolvability",
"Three models for the description of language",
"Some R... | null | 751 | 0.041278 | null | null | null | null | null | null | null | null |
58922a4e16d29b5b65b93890414c3159a21af180 | 45287348 | null | Grammaire {I} Description Transformationnelle D{'}un Sous-Ensemble Du {F}rancais | DESCRIPTION TRANSFORMATIONNELLE D'UN SOUS-ENSE)~LE DU FRANCAIS I. COMPOSITION DE LA GRAMMAIRE Nous supDosons une certaine familiarisation avec le module transformationnel de descriptions linguistiques expos~ par Chomsky dans Aspects of the theor~of syntax (1965). Ainsi nous insisterons surtout sur ce en quoi GRAMMAIRE-... | {
"name": [
"Querido, Antonio A.M."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 43 | 1969-09-01 | 0 | 0 | null | La sous-cat~gorlsation des categories ~l~mentaires de syntagmes ("pre-terminal Symbols") et l'at-tachement des unit~s lexicales se font manue~ement.A mesure que nous assignions des sous~cat~@oties ou traits aux syntagmes ~l~mentaires pour en marquer les propri~t~s syntactico-s~mantiques, nous avons progressivement asse... | null | null | null | null | Main paper:
:
La sous-cat~gorlsation des categories ~l~mentaires de syntagmes ("pre-terminal Symbols") et l'at-tachement des unit~s lexicales se font manue~ement.A mesure que nous assignions des sous~cat~@oties ou traits aux syntagmes ~l~mentaires pour en marquer les propri~t~s syntactico-s~mantiques, nous avons pr... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
81002f27ae9136a2c72948632529ca3e6ee7286d | 14176415 | null | Automatic error-correction in natural languages | Automatic error-correction in natural language processing is based on the principle of 'elastic matching'. Text words are segmented into 'lines' with letters arranged according to a pre-determined sequence, and then matched line-by-line, shifts being applied if the numbers of lines are unequal. | {
"name": [
"Szanser, A.J."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 7 | 1969-09-01 | 2 | 13 | null | In order to resolve the possible multiple choices produced, the method may be supplemented by another one, based on the observed repetition of words in natural texts, and also by syntactic analysis.This paper describes the above methods and gives an account of an experiment now in progress at the National Physical Labo... | null | null | One possibility of choosing between the multiple equivalents produced by dictionary look-up is to select those which are repeated throughout the article or speech in question.For this purpose a procedure called 'general-content check' has been devised.~s the text is processed, each different word satisfying certain con... | null | Main paper:
the ~eneral-content check:
One possibility of choosing between the multiple equivalents produced by dictionary look-up is to select those which are repeated throughout the article or speech in question.For this purpose a procedure called 'general-content check' has been devised.~s the text is processed,... | null | null | null | null | {
"paperhash": [
"damerau|a_technique_for_computer_detection_and_correction_of_spelling_errors"
],
"title": [
"A technique for computer detection and correction of spelling errors"
],
"abstract": [
"The method described assumes that a word which cannot be found in a dictionary has at most one erro... | null | 665 | 0.019549 | null | null | null | null | null | null | null | null |
2f6bd8eaad5de8b869302566d97a7adf35df68fd | 152179197 | null | On the Problems of Co-Textual Analysis of Texts | MY paper will deal with the theoretical and practical questions of the co-textual analysis of texts. The theoretical frame is contained by the chapters /bird/ DEF ST ISF FIELD BT-LOG -WH NT-LOG -PT -CON COL-LOG EC ASCR ASCT ASCF tenger /sea/ DEF ST ISF FIELD BT-LOG -WH NT-LOG -PT -CON COL-LOG -PT ASCR ASCT ASCF /We sha... | {
"name": [
"Petofi, Janos S."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 50 | 1969-09-01 | 0 | 4 | null | In my opinion, the following means are necessary for the co-textual analysis of texts: I. a thesaurus including different sectors;2. a rule-system working on sentences: a/phonological, morphonological rules, ~ b/ syntactic rules, c/ semantic rules to the linguistic semantic interpretation to the logical semantic interp... | null | null | titled Introduction and Conclusion. MY aim here is to show that the automatization of the text analysis expects the accumulated experiences of the general linguistics and the documentation-theory to be summed up in one coherent theo~z. The linguistics has to examine the problems of documentational thesauri, abstracting... | null | Main paper:
on the means of the co-textual analysis of texts:
In my opinion, the following means are necessary for the co-textual analysis of texts: I. a thesaurus including different sectors;2. a rule-system working on sentences: a/phonological, morphonological rules, ~ b/ syntactic rules, c/ semantic rules to the... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.006015 | null | null | null | null | null | null | null | null |
2031b19437187acf9a5efee57b359b363dd3727a | 13510585 | null | Structure, Effectiveness, and Uses of the Citation Identifier | A computer program for automatic identification of "fullform" case citations in legal literature (e.g., Rutherford v. Geddes, 4 Wall. 220, 18 L. Ed. 343; Southland Industries, Incorporated v. | {
"name": [
"Borkowski, Casimir"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 46 | 1969-09-01 | 22 | 3 | null | null | null | null | null | The Citation Identifier operates rather rapidly.In a recent test run, the total time required to process some 400, 000 running words of t~xt was approximately fifteen and a half minutes. This speed could be further increased by suitable changes in the cc~uter program.An extension of the Citation Identifier to reduced-f... | Main paper:
:
The Citation Identifier operates rather rapidly.In a recent test run, the total time required to process some 400, 000 running words of t~xt was approximately fifteen and a half minutes. This speed could be further increased by suitable changes in the cc~uter program.An extension of the Citation Ident... | null | null | null | null | {
"paperhash": [
"borkowski|an_experimental_system_for_automatic_recognition_of_personal_titles_and_personal_names_in_newspaper_texts",
"borkowski|an_experimental_system_for_automatic_identification_of_personal_names_and_personal_titles_in_newspaper_texts"
],
"title": [
"An Experimental System for Aut... | - Problem: The inefficiency and slowness of traditional methods of legal information handling hinder efficient administration of justice, as access to necessary legal data is often slow and ineffective, impacting the speed and effectiveness of legal actions, defense and offense preparation, law creation, and overall le... | 665 | 0.004511 | null | null | null | null | null | null | null | null |
f4c7c2e487347dc20351d6e8cc8578d2c8e368ef | 2788301 | null | Stylistic Analysis of Poetry | The Trlcon program has been adapted as an aid to the analysis of syntax in poetry with the hope of identifying the dominant patterns that characterize a poet's style. The Trlcon program (described in Concordances from Com-~ , S.M.Lamb and L.Gould, University of Callf0~nia, ey,1964)has three active lines which this rese... | {
"name": [
"Fairley, Irene R."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 62: Collection of Abstracts of Papers | 1969-09-01 | 0 | 1 | null | The Trlcon program has been adapted as an aid to the analysis of syntax in poetry with the hope of identifying the dominant patterns that characterize a poet's style. The Trlcon program (described in Concordances from Com-~ , S.M. Lamb and L.Gould, University of Callf0~nia, ey,1964) has three active lines which this re... | null | null | null | null | Main paper:
• stylistic analysis of poetry:
The Trlcon program has been adapted as an aid to the analysis of syntax in poetry with the hope of identifying the dominant patterns that characterize a poet's style. The Trlcon program (described in Concordances from Com-~ , S.M. Lamb and L.Gould, University of Callf0~ni... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.001504 | null | null | null | null | null | null | null | null |
46823f209ef3833ab79bb8286b4181499117aa6d | 174383 | null | The Measurement of Phonetic Similarity | There are many reasc~s for wanting to measure the degree of phoaetic similarity between members of a group of languages or dialects. The present study grew out of a research project which was designed to get data that might have a bearing on some of the practical problems which exist in Uganda. In the Southern part of ... | {
"name": [
"Ladefoged, Peter"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 57 | 1969-09-01 | 19 | 9 | null | before we could quauti~j, in practical terms, the overall degree of phonetic similarity between a pair of languages, the phonological descripticas would have to be supported by counts of the frequency of occurrence of each rule. A difference between two languages due to, s~, the addition of a rule in one but not the ot... | null | null | null | null | Main paper:
:
before we could quauti~j, in practical terms, the overall degree of phonetic similarity between a pair of languages, the phonological descripticas would have to be supported by counts of the frequency of occurrence of each rule. A difference between two languages due to, s~, the addition of a rule in ... | null | null | null | null | {
"paperhash": [
"klatt|structure_of_confusions_in_short-term_memory_between_english_consonants.",
"wickelgren|distinctive_features_and_errors_in_short-term_memory_for_english_consonants.",
"wickelgren|distinctive_features_and_errors_in_short-term_memory_for_english_vowels.",
"peters|dimensions_of_per... | null | 665 | 0.013534 | null | null | null | null | null | null | null | null |
ba528fcdd157e7c1aa41bd9504038fc0ec0a4269 | 28708574 | null | A Rapidly Extensible Language System (The {REL} Language Processor) | REL, Rapidly Extenslble Language System, permits a variety of languages to coexist within a single computer system. Here the term "language" is understood to include a particular data base. New languages may be defined by constructing a new base language with its syntax and semantics, by extending the terminology from ... | {
"name": [
"Lockemann, Peter C. and",
"Thompson, Frederick B."
],
"affiliation": [
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 34 | 1969-09-01 | 8 | 3 | null | Language plays a twofold role. For an individual, or a group of individuals with some common interest, it establishes a framework within which to express the structuration of their experience and conceptualization of their environment.In a social organization it provides the conventions through which these individuals ... | null | null | Indeed, each rule has its syntax completion part to determine the syntactic portion of the result, possibly on the basis of its arguments.A node in the phrase marker denotes either a "phrase" or a funetlon A language may also employ the extension mechanism if it wishes to avoid the use of a lexicon, and instead enter t... | We notice that general rewrite rules and definition expansion have a property in common. In each case a llst of functions is given. Each function is exercised in turn, and the result of each step is utilized in a manner which depends only on the criterion governing the list. In Among the temporary configurations guidin... | Main paper:
languages and language processor:
We shall base our structural description of a language on the formalism presented earlier by F. B. Thompson [2, 3] . It postulates a one-to-one correspondence between the syntactic and semantic aspects.A language refers to some domain of discourse consisting of objects ... | null | null | null | null | {
"paperhash": [
"thompson|english_for_the_computer"
],
"title": [
"English for the computer"
],
"abstract": [
"What about English as a programming language? Few would question that this is a desirable goal. On the other hand, I dare say every one of us has rather deep reservations both about its ... | null | 665 | 0.004511 | null | null | null | null | null | null | null | null |
ec05ef0cbfa893b6d3c81df0beac2402cc3f7a5a | 12758647 | null | Linguistics and Automated Language Processing | This paper is concerned with natural language, computers, and two groups of people interested in natural language: ]inguists, and persons engaged in computer processing of natural language data. | {
"name": [
"Montgomery, Christine A."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 41 | 1969-09-01 | 42 | 3 | null | There is some intersection of the latter sets, but the intersection is quite small relative to the size of the sets themselves and is thus inadequate to provide linguists with a proper perspective on automated language processing, or computer scientists with a proper perspective on linguistics.Although both groups of p... | null | null | null | null | Main paper:
1:
It is appropriate to begin this discussion with a brief inquiry A further--and not unrelated--reason for non-participalion linguists in automated language processing is a basic lack of knowledge about computers~ in the sense of realizing when a computer is a handy tool~ and when it isn't so handy. By... | null | null | null | null | {
"paperhash": [
"kay|the_computer_system_to_aid_the_linguistic_field_worker",
"bobrow|a_phonological_rule_tester",
"friedman|a_computer_system_for_writing_and_testing_transformational_grammars:_final_report",
"londe|tgt:_transformational_grammar_tester",
"chapin|on_the_syntax_of_word-derivation_i... | Problem: The paper addresses the inadequate intersection between linguists and computer scientists engaged in natural language processing, highlighting their differing perspectives on language nature and data processing approaches.
Solution: The hypothesis explores whether the contrasting perspectives of linguists and... | 665 | 0.004511 | null | null | null | null | null | null | null | null |
8444ce1af42bd88e2c4c581f67f20efc65b3a1bf | 33302434 | null | A Rapidly Extensible Language System ({REL} {E}nglish) | REL English in Terms of Modern Linguistics REL, a Rapidly Extensible Language System, is an integrated information system operating in conversational interaction with the computer. It is intended for work with large or small data bases by means of highly individualized languages. The architecture of REL is based on the... | {
"name": [
"Dostert, Bozena and",
"Thompson, Frederick B."
],
"affiliation": [
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 35 | 1969-09-01 | 5 | 3 | null | The result of these assumptions is a system which allows the construction of highly individualized languages which are closely knit with the structure of the data and which can be rapidly extended and augmented with new concepts and structures through a facile definitional capability. The REL language processor is desi... | Each of the four following sentences contains, in surface structure, a different verb.(1) John arrived in Boston.(ii) John left Boston.(iii) John lived in Boston.(iv) John is residing in Boston.The underlying structure of these sentences is identical: 'location (John, Boston)', except for the temporal aspect of this re... | The elements of a verb table correspond to the elements of a kernel clause (i. e. one with a single deep structure Phrase-marker). The function of inflectional morphemes and auxiliary verbs is twofold: modification of the original time in the verb table and setting of syntactic features. For example, the past tense mor... | null | null | Main paper:
relation verbs:
Each of the four following sentences contains, in surface structure, a different verb.(1) John arrived in Boston.(ii) John left Boston.(iii) John lived in Boston.(iv) John is residing in Boston.The underlying structure of these sentences is identical: 'location (John, Boston)', except fo... | null | null | null | null | {
"paperhash": [
"thompson|rel:_a_rapidly_extensible_language_system",
"craig|deacon:_direct_english_access_and_control",
"thompson|english_for_the_computer"
],
"title": [
"REL: A Rapidly Extensible Language system",
"DEACON: direct English access and control",
"English for the computer"
... | null | 665 | 0.004511 | null | null | null | null | null | null | null | null |
0bff540652f64548639586ec848f5dccb0f8e846 | 8874769 | null | Sur quelques preprietes communes des catagories semantiques et des procedures generatrices de trois modeles de synthese dans le processus de la {TA} (resume) | Ro~ioS 8~mantiouis et den urea&duma g£~£. ~~.de._'k~J.fi_mod~les (-le swnth68e dan~ Is nroossaU8 ds.~s TA (r6oum6) A.Ludokanov (Sofia) Carte communication a pour but:I.do pr6eenter le msdale do g6n6ratton du groups do Sofia(MS)iIlods oO mparsr los oat6go~is8 s6mantieques(CS)et les proo6dures g6nera- | {
"name": [
"Ludskanov, A."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 62: Collection of Abstracts of Papers | 1969-09-01 | 0 | 0 | null | null | null | null | deles de la synth~se ~d6mantiquo de Mosoou(~) at du CETA (EG),d'en d6dutre lee tnvarlants e6mantiquee(IS)et d'analyaor la nattu~e logique des l~;III.do proposer une am6lioration de prtnoipe du MS. l.Le but du HS eat de g6n6rer des 6qutvalances bulgares 8ynth6tiquo8 et analytique8 au n~v~au des formes dee mote at dos 8y... | null | Main paper:
:
deles de la synth~se ~d6mantiquo de Mosoou(~) at du CETA (EG),d'en d6dutre lee tnvarlants e6mantiquee(IS)et d'analyaor la nattu~e logique des l~;III.do proposer une am6lioration de prtnoipe du MS. l.Le but du HS eat de g6n6rer des 6qutvalances bulgares 8ynth6tiquo8 et analytique8 au n~v~au des formes ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
d6dab3c7f80fd14e0b38adadc69b9338f58443bd | 29195329 | null | An Application of an Extended Generative Semantic Model of Language to Man-machine Interaction | This paper discusses the feasibility of applying a model of language use based on a modification and extension (to be discussed below) of the generative semantic (transformational) theory of language competence recently developed by Paul Postal, George Lakoff, John Robert Ross, ~ames D. McCawley, and others, to problem... | {
"name": [
"Binnick, Robert I."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 18 | 1969-09-01 | 23 | 4 | null | The theory of generative semantics, to be discussed in section II, is an outgrowth of, and reaction to, Chomsky's 1965 theory of transformational linguistics. It is a radical theory which deals with a very great range of problems with very abstract methods.Trose working in this paradigm hold that there is a linguistic ... | null | null | null | null | Main paper:
constants denoting individuals.:
3. predicates, denoting properties and relationships. If the negation applies to John beats his wife, the se'~tence means 'the reason ~at John doesn't beat his wi~e is that he loves her', whereas if it applies to the John heats his wife because he loves her., the mg. is ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.006015 | null | null | null | null | null | null | null | null |
36cf376b0d032cd770124faa34485e93bf160d17 | 12163907 | null | Computer-Produced Representation of Dialectal Variation: Initial Fricatives in {S}outhern {B}ritish {E}nglish | It has become apparent to some dialectolo6ists that di~lectology, particularly in its interpretive phase, is a branch of linguistics particularly adapted to the use of computers. The dialectol0gist typically deals with large bodies of data, usually in the form of single words and short phrases, and he is interested in ... | {
"name": [
"Francis, W. Nelson and",
"Svartvik, Jan and",
"Rubin, Gerald M."
],
"affiliation": [
null,
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 52 | 1969-09-01 | 10 | 3 | null | time involving a body of data small enough %0 be quickly prepared.Since two of the three,authors are specialists in English (the third is a computer specialist), we ~tural/y ~urned to the published volumes of the 5'u~e~ d of ~dZ'~h D~a/~c~, 2 which embody carefully controlled data, collected with professional skill, an... | null | null | null | null | Main paper:
:
time involving a body of data small enough %0 be quickly prepared.Since two of the three,authors are specialists in English (the third is a computer specialist), we ~tural/y ~urned to the published volumes of the 5'u~e~ d of ~dZ'~h D~a/~c~, 2 which embody carefully controlled data, collected with prof... | null | null | null | null | {
"paperhash": [
"kurath|the_loss_of_long_consonants_and_the_rise_of_voiced_fricatives_in_middle_english",
"mossé|a_handbook_of_middle_english"
],
"title": [
"The Loss of Long Consonants and the Rise of Voiced Fricatives in Middle English",
"A handbook of Middle English"
],
"abstract": [
"... | null | 665 | 0.004511 | null | null | null | null | null | null | null | null |
d5bb72f21a25bcfbeb0dbff30a55aab9eca5f74a | 18306263 | null | Applications of a Computer System for Transformational Grammar | Writing a transformational grammar for even a fragment of a natural language is a task of a high order of complexity. Not only must the individual rules of the grammar perform as intended in isolation, but the rules must work correctly together in order to pro~nce the desired results. The details of grammar-writing are... | {
"name": [
"Friedman, Joyce"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 14 | 1969-09-01 | 0 | 6 | null | null | null | The technical details of the particular model of transformational grammar have been described elsewhere [3] . This presentation will emphasize the ways in which the programs can be used, and will describe experiences in using them both in grammar writing and inteaching.The notation for grammars and the use of the progr... | null | null | Main paper:
:
The technical details of the particular model of transformational grammar have been described elsewhere [3] . This presentation will emphasize the ways in which the programs can be used, and will describe experiences in using them both in grammar writing and inteaching.The notation for grammars and th... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.009023 | null | null | null | null | null | null | null | null |
eacbf6d36a4246966e873c525acac8298e3d15a6 | 5249899 | null | Semantics of Prepositional Constructs in {R}ussian: Tentative Approach | The primary objective of this paper is to describe an experiment designed to investigate the semantic relationships between the three basis components of a prepositional construct: the governor, preposition and the complement. Because of the preliminary nature of the experiment, only simple data processing equipment, s... | {
"name": [
"Woyna, Adam G."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 32 | 1969-09-01 | 3 | 1 | null | null | These relationships can be diagrarmned as follows:~ (C)sn blwhere sn=sematic property of any value.If either of the semantic components is found to exclusively govern the combination of the two remaining semantic components then it can be said that Since, in an initial study of this type, a large number of semantic cla... | null | prepositions not listed as such in the previously named sources were included in the experiment. The next logical step, using the arrangement of the data as shown below, should be the culling out of additional data in the case of Russian, and complete data in the case of other languages~ from dictionaries, concordances... | null | Main paper:
given governor and its l>reposition's g~----~c complement:
These relationships can be diagrarmned as follows:~ (C)sn blwhere sn=sematic property of any value.If either of the semantic components is found to exclusively govern the combination of the two remaining semantic components then it can be said t... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.001504 | null | null | null | null | null | null | null | null |
2251f33152d5f80b92441d20c3228987d5135fea | 62131524 | null | A Progress Report on the Use of {E}nglish in Information Retrieval | Progress is reported in the further development of an already working model for communicating in English with a computer about the contents of a library. The revised grammar of this model combines the phrase structure and transformational rules of the underlying grammar into a single efficient component. Problems of im... | {
"name": [
"Moyne, J. A."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 40 | 1969-09-01 | 7 | 14 | null | developed for computer application two stand out for their historical impact on this approach: The Mitre (1964) granxnar developed by a number of M.I.T. scholars, and the so-called IBM Core Grammar 3. A lucid and informative discussion of the implications of the use of natura] languages in computers is given in Kuno (1... | null | null | null | null | Main paper:
:
developed for computer application two stand out for their historical impact on this approach: The Mitre (1964) granxnar developed by a number of M.I.T. scholars, and the so-called IBM Core Grammar 3. A lucid and informative discussion of the implications of the use of natura] languages in computers i... | null | null | null | null | {
"paperhash": [
"salton|a_comparison_between_manual_and_automatic_indexing_methods",
"salton|the_smart_automatic_document_retrieval_systems—an_illustration",
"salton|automatic_information_organization_and_retrieval",
"salton|computer_evaluation_of_indexing_and_text_processing",
"williams|computer... | null | 665 | 0.021053 | null | null | null | null | null | null | null | null |
21e6ba6c442402c8d98ec244e2977ac33d14144f | 21946555 | null | Organization and Programming of the {M}ultistore Parser | The Multistore system was developed in order to recoge nize and explain structural patterns in natural-language sentences (specifically English) and eventually yield an output in which the relations between the various items of the sentence are hierarchically displayed. The recognition of these structural patterns is m... | {
"name": [
"Pisani, Pier Paolo"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 25 | 1969-09-01 | 2 | 1 | null | null | null | Each Ic represents a possible syntactic connection between two items and is identified by:i) the code number of the relation it establishes between two items;2) the 'type' of correlation. There are six different types of correlation which split into two groups:'explicit' correlators and 'implicit' correlators.By 'expli... | null | null | Main paper:
:
Each Ic represents a possible syntactic connection between two items and is identified by:i) the code number of the relation it establishes between two items;2) the 'type' of correlation. There are six different types of correlation which split into two groups:'explicit' correlators and 'implicit' cor... | null | null | null | null | {
"paperhash": [
"glasersfeld|the_multistore_parser_for_hierarchical_syntactic_structures"
],
"title": [
"The multistore parser for hierarchical syntactic structures"
],
"abstract": [
"A syntactic parser is described for hierarchical concatenation patterns that are presented to the analyzer in the... | null | 665 | 0.001504 | null | null | null | null | null | null | null | null |
e1e56a08f88c83f43978402f18855db6f589a13b | 26396685 | null | Mathematical Models for {B}alkan Phonological Convergence | The high structuring of phonology, the obvious classes of sounds, and the classes of their classes, have made phonological typologies a not too rare proposal. And even where typologies were not claimed as such, they were often implicit in the statements made. | {
"name": [
"Afendras, Evangelos A."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 56 | 1969-09-01 | 18 | 1 | null | More complicated yet much more adequate measures of distinctive feature distributions were proposed by the Soviet linguist Postovalova.Although they were first used for the study of Just one systems typological applications were also suggested by the author. (Havr~nek, 1933 ) which actually drew heavy criticism (Ma~eck... | null | null | null | It is obvious after inspection of the indices, that the two systems are not distinguls~ed. Such aloss of information is characteristic of averaging. | Main paper:
postovalova's valence and probability indices:
More complicated yet much more adequate measures of distinctive feature distributions were proposed by the Soviet linguist Postovalova.Although they were first used for the study of Just one systems typological applications were also suggested by the author... | null | null | null | null | {
"paperhash": [
"voegelin|obtaining_an_index_of_phonological_differentiation_from_the_construction_of_non-existent_minimax_systems",
"pierce|possible_electronic_computation_of_typological_indices_for_linguistic_structures",
"lyons|phonemic_and_non-phonemic_phonology:_some_typological_reflections",
"k... | null | 665 | 0.001504 | null | null | null | null | null | null | null | null |
d9cc9533341737a886d3b30f9d16736fe649f749 | 28848363 | null | Towards an automatic morphological segmentation | Towards an automatic morphological segmentation. Ottr intention is to obtain a morphological segmentation of French acceptable to a present-day speaker or listener~ for a corpus provided without any previous ir~exlng~ by means of electronic calculation. Experience tends to prove that it is possible to achieve such a se... | {
"name": [
"De Kock, Josse and",
"Bossaert, Walter"
],
"affiliation": [
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 62: Collection of Abstracts of Papers | 1969-09-01 | 0 | 2 | null | null | null | null | null | establishing and grading these criteria and formulating them mathematicall~ The use of the computer guarantees objectiveness up to a significant linguistic level; the computer is an instrument of research for new rules; it guarantees the control of established rules.The method followed by us is based on the hypothesis ... | Main paper:
:
establishing and grading these criteria and formulating them mathematicall~ The use of the computer guarantees objectiveness up to a significant linguistic level; the computer is an instrument of research for new rules; it guarantees the control of established rules.The method followed by us is based ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.003008 | null | null | null | null | null | null | null | null |
e9b9cb7d9ed387ddda17d3939e7a1e7bf3016a52 | 16195304 | null | Automatic Simulation of Historical Change | One of the principal reasons for studying the history of a language has been to explain the system of its modern reflex, the contemporary language. This has been especially true in attempting to deal with certain anomalies in the modern language. But the role, if appropriate, of utilizing information concerning diaehro... | {
"name": [
"Smith, Raoul N."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 9 | 1969-09-01 | 6 | 2 | null | purely on synchronically motivated grounds, suggest a much more intimate relation between a synchronic grammar and what has been 2 previously posited as a dlachronic description of that language.The two major problems involved in historical studies have been the statement of the sound change (or, as this has been reint... | null | null | null | null | Main paper:
:
purely on synchronically motivated grounds, suggest a much more intimate relation between a synchronic grammar and what has been 2 previously posited as a dlachronic description of that language.The two major problems involved in historical studies have been the statement of the sound change (or, as t... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.003008 | null | null | null | null | null | null | null | null |
71a69e392d0cff0b4ba094b3b287fcf27222a487 | 8507267 | null | Disambiguating Verbs with Multiple Meaning in the {MT}-System of {IBM} {G}ermany | TheSystem iln glen eral Since The MT-System of IBM Germany has already been described elsewhere [5] [63, we shall confine us to the aspects of the system which are substantial to our problem. | {
"name": [
"Batori, I."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 31 | 1969-09-01 | 7 | 2 | null | TheSystem iln glen eral Since The MT-System of IBM Germany has already been described elsewhere [5] [63, we shall confine us to the aspects of the system which are substantial to our problem.The system consists of two linguistically significant parts: a machine lexicon residing on a direct access device and a program p... | null | null | Consider the following sentence pairs:lie) The company has increased the production. (Ib) The production has increased rapidly.The access arm returned to its original position.It is clear that the (a) and (b) sentences have to be translated in a different way:(la") Dig Gesgllschaft hat dig Prod~ktion grhoeht Q (Ib") Di... | null | Main paper:
the problem:
Consider the following sentence pairs:lie) The company has increased the production. (Ib) The production has increased rapidly.The access arm returned to its original position.It is clear that the (a) and (b) sentences have to be translated in a different way:(la") Dig Gesgllschaft hat dig ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.003008 | null | null | null | null | null | null | null | null |
aae8936e2bbed5542724ce64b2a7fffb5fe5e015 | 17320298 | null | Computer Aided Research on Synonymy and Antonymy | This research is a continuation of that reported in Axiomatic Characterization of Synonymy and Antonymy, which was presented at the 1967 International Conference on Computational Linguistics [3]. In that paper on mathematical linguistics the relations of synonymy and antonymy were regarded as ternary relations and thei... | {
"name": [
"Edmundson, H. P. and",
"Epstein, Martin N."
],
"affiliation": [
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 58 | 1969-09-01 | 13 | 2 | null | null | Before investigating axioms for synonymy and antonymy, we will recapitulate some notions and notations for the calculus of binary relations.Consider a set V of arbitrary elements, which will be called the universal set. A binary relation on V is defined as a set Under the assumption that synonymy and antonymy are terna... | A -Antonymy M -word used in the description of another word but not itself a main entry.5. <word>,...,<word> is the set of words standing in the given relation to the main entry in the given sense.Thus, each input item consists of a main-entry word followed by a comma, a one-character grammar code, a one-digit sense nu... | The synonymy and antonymy relations possess interesting proper ~ ties, which can be treated mathematically to provide insight about semantic relations and connectivity among words in a natural language.One such model is the axiom system just stated. The immediate goal of the current research is to compile, in computer-... | It was noted that since the first book on English synonyms, which appeared in the second half of the 18th century, dictionaries of synonyms and antonyms have varied according to the particular explicit or implicit definitions of "synonym" and "antonym" that were used. The roles of grammatical class, word context, and s... | Main paper:
axioms:
Before investigating axioms for synonymy and antonymy, we will recapitulate some notions and notations for the calculus of binary relations.Consider a set V of arbitrary elements, which will be called the universal set. A binary relation on V is defined as a set Under the assumption that synonym... | null | null | null | null | {
"paperhash": [
"knuth|the_art_of_computer_programming,_volume_i:_fundamental_algorithms,_2nd_edition",
"edmundson|1967_international_conference_on_computational_linguistics_axiomatic_characterization_of_synonymy_and_antonymy",
"knuth|the_art_of_computer_programming",
"|axiomatic_characterization_of_... | Problem: The paper aims to investigate the extent to which a set of eight axioms model an existing dictionary of synonyms and antonyms.
Solution: The hypothesis is that the axioms proposed in the paper accurately represent the relationships of synonymy and antonymy in the existing dictionary, as demonstrated through t... | 665 | 0.003008 | null | null | null | null | null | null | null | null |
b222746e6ccf8ebb07f2c5f9a70b635bb8db0fb8 | 18533917 | null | Uber Zeitkeferenz Und Tempus | On time reference and tense. | {
"name": [
"Wunderlich, Dieter"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 23 | 1969-09-01 | 5 | 0 | null | The problems of time reference and tense in natural languages are discussed in their syntactic and ee::antic aspects. The syntactic description is based on the principles of the generative transformational grammar. Since tense is a deictic category, the semantics language must be a pragmatically extended system. Furthe... | null | null | null | null | Main paper:
das s~ntaktische ~stem.:
In der syntaktischen Kompomente einer Sprachbeschreibung werden die kombinatorischen Eigenschaften und Relationen der AusdrGcke der Sprache beschrieben. Es handelt sich dabel erstens darum, den Segmentationszusammenhang und die Distributlonselgenschaften der Satzkonstituenten au... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
16a29a1194dc67c25e4983a73dfbcf66336eea9e | 7129409 | null | Network of Binary Relations in Natural Language | It is an esmontl~, cha~acteristic of nat~al languages that one uox~l oan be concatenated mt~h certain others to form a et~Ing tha~ enters in correct phrases of the language, whale it cannot be eo~atamated ui~h othe~s. The same holds true for e~rlng~ of words. Such eoncatenable elements axe also "mutually eompatible ele... | {
"name": [
"Birbanescu, Adrian"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 54 | 1969-09-01 | 8 | 0 | null | null | null | null | null | shall call string also a sequence oontainlng one sln~le word.The empty word ~ is cbsx~ote~tsed b~ ail = ~ a i = a i fox' ovory ai~ Ve ~me B1;r~lJ U ~33 be oa33edrBontoD~0BeThe set of all sentences generated on V is t~ 7 definition the ~ Lo By ~ax~ar G we shall undez~tand a set of rules by which it is possible' to gener... | Main paper:
:
shall call string also a sequence oontainlng one sln~le word.The empty word ~ is cbsx~ote~tsed b~ ail = ~ a i = a i fox' ovory ai~ Ve ~me B1;r~lJ U ~33 be oa33edrBontoD~0BeThe set of all sentences generated on V is t~ 7 definition the ~ Lo By ~ax~ar G we shall undez~tand a set of rules by which it is ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
0adb9eb9fa4e990a8be2adbf15ba226ab1f83f38 | 18605821 | null | Computational Analysis of Interference Phenomena on the Lexical Level | This contribution presents the results of comparison of Dutch texts written by bilinguals I) (speaking French and Dutch), with Dutch texts regarded as STANDARD WRITTEN DUTCH. The attention was focussed on French loan-words appearing in both types of texts and the differences in their use. Certain generalizations as to ... | {
"name": [
"Skalmowski, W. and",
"Van Overbeke, M."
],
"affiliation": [
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 16 | 1969-09-01 | 4 | 0 | null | The materials used for the present contribution belong to (~ We are greatly indebted for the assistance of oul colleages Mr.L.DE BUSSCHERE, who prepared all computer programs needed in this investigatfon, Mr.R.EECKHOUT, who helped us with many suggestions as to the possibilities of information processing techniques and... | null | null | As a first approximation test the percentage of foreign words in the vocabulary in both FWD-and SWD-texts was established. In other words, the "conceptual symbols" do not represent separate pieces of the univers de disoour8 taken at random, but are probably ordered by some classificational system, resembling the biolog... | To test this hypothesis we divided the FWD material into | Main paper:
lexical mter~renceand word-~ngth:
As a first approximation test the percentage of foreign words in the vocabulary in both FWD-and SWD-texts was established. In other words, the "conceptual symbols" do not represent separate pieces of the univers de disoour8 taken at random, but are probably ordered by s... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
b85bb7066877714774e53a9562eb32d9ad490320 | 20631784 | null | On Saturated Partitions | Stephan-Yl ~n Solomon Let L be a lan~'uage over m vocmb~Ja~y V ~nd let de~ot~. by E (V) the s,t of ml! enuSv~lence relmtlon~ (partitions) on V. If ~ ~ E (V) and x ~ V then we sb~ll denote by ~(v) the cell of ~ containing the elmment 7. Defini%ion I. A p~rtition ~GE(V) is s~id to be smturated ev~-VY i (I ~imn) there exl... | {
"name": [
"Solomon, Stephan-Ylan"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 62: Collection of Abstracts of Papers | 1969-09-01 | 0 | 0 | null | null | null | null | null | The connection between the ~sterisk ~nd the ~erivative of ~ pm~t~t~on is given by:In orQer that #'=~,~ it is necessary ~nd sufficient thmt 2 be saturated.o.By u~ing the no%~tlon:~ -J, and . we hav.e : ~Theorem E. Thmrm mxlsts ? nmtur~ number n so that Z--~ (where ~ im the improper p~rt~tion of V). | Main paper:
:
The connection between the ~sterisk ~nd the ~erivative of ~ pm~t~t~on is given by:In orQer that #'=~,~ it is necessary ~nd sufficient thmt 2 be saturated.o.By u~ing the no%~tlon:~ -J, and . we hav.e : ~Theorem E. Thmrm mxlsts ? nmtur~ number n so that Z--~ (where ~ im the improper p~rt~tion of V).
... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
b7b5a183bdb8caab50012cdb433d3f3d8bca6ee8 | 28847083 | null | Le Projet De Traduction Automatique a L{'}universite De {M}ontreal | I -HISTORIQUE DU PROJET Nos recherches ont d6but6 il y a bientOt quatre ans. Ce projet fut d'abord int6gr6 aux activit6s g6n6rales de la Facult6 des Lettres de l'Universit6 de Montr6al; maintenant, il d6pend directement du vice-recteur ~ la recherche de la mSme universit6. | {
"name": [
"Dugas, Andre and",
"Gopnik, Myrna and",
"Harris, Brian and",
"Paillet, Jean-Pierre"
],
"affiliation": [
null,
null,
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 55 | 1969-09-01 | 11 | 0 | null | En ce qui concerne ces recherches, des rapports p~riodiques continuent de para~tre et le dernier d'entre eux ajoute consid~rablement aux notes trop succintes qui vont suivre.Nous ne donnerons ni une histoire ni une description formelle du syst~me-W; nos coll~gues informaticiens le font dans une communication au Congr~s... | null | null | null | null | Main paper:
la facult~ de langage:
I1 est utile dVimaginer les structures s~mantiques comme des graphes (qui nVont a priori aueune raison dV~tre des arborescenees) dont les noeuds -ou les ar~tes -sont ~tiquet~s par des indices de raf~rence et des noms de relations existant entre certains de ees indices. Le "probl~m... | null | null | null | null | {
"paperhash": [
"chastellier|w-grammar",
"jones|experiments_in_semantic_classification"
],
"title": [
"W-grammar",
"Experiments in semantic classification"
],
"abstract": [
"A new type of grammars is presented here, called W-grammars. It is shown how they can be used in translation proces... | null | 665 | 0 | null | null | null | null | null | null | null | null |
bc500000253584c7bc503401da2952d832cb1fc4 | 6251721 | null | Automatic Processing of Foreign Language Documents | Experiments conducted over the last few years with the SMART document retrieval system have shown that fully automatic text processing methods using relatively simple linguistic tools are as effective for purposes of document indexing, classification, search, and retrieval as the more elaborate manual methods normally ... | {
"name": [
"Salton, G."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 4 | 1969-09-01 | 0 | 88 | null | null | null | SMART is a fully-automatic document retrieval system operating on the IBM 7094 and 360 model 65. Unlike other computer-based retrieval systems, SMART is thus designed as an experimental automatic retrieval system of the kind that may become current in operational environments some years hence.The following facilities, ... | One of the major objections to the praetical utilization of the automatic text processing methods has been the inability automatically to handle foreign language texts of the kind normally stored in documentation and library systems. Recent experiments performed with document abstracts and search requests in French and... | Since the query processing operates equally well in both languages, while the German document collection produces a degraded performance, it becomes worthwhile to examine the principal differences between the two document collections. These are summarized in Table 4 The other thesaurus characteristic -that is its compl... | Main paper:
the smart system:
SMART is a fully-automatic document retrieval system operating on the IBM 7094 and 360 model 65. Unlike other computer-based retrieval systems, SMART is thus designed as an experimental automatic retrieval system of the kind that may become current in operational environments some year... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.132331 | null | null | null | null | null | null | null | null |
11a30e659eccbb1ab41b879cf9eadf81bf3f7355 | 1645754 | null | Automated Processing of Medical {E}nglish | The present interest of the scientific community in automated language processing has been awakened by the enormous capabilities of the high speed digltal computer. It was recognized that the computer which has the capacity to handle symbols effectively can also treat words as symbols and language as a string of symbol... | {
"name": [
"Pratt, Arnold W. and",
"Pacak, Milos G."
],
"affiliation": [
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 11 | 1969-09-01 | 17 | 21 | null | Approaches to automatic information retrieval, quantitative studies of generic relations between languages and style analysis~ have been based to a great extent on statistical considerations~ such as frequency counts of linguistic units (phomemes, morphemes~ words, fixed phrases). In each of these approaches linguistic... | null | null | null | null | Main paper:
:
Approaches to automatic information retrieval, quantitative studies of generic relations between languages and style analysis~ have been based to a great extent on statistical considerations~ such as frequency counts of linguistic units (phomemes, morphemes~ words, fixed phrases). In each of these app... | null | null | null | null | {
"paperhash": [
"garvin|the_georgetown-ibm_experiment_of_1954:_an_evaluation_in_retrospect",
"slagle|experiments_with_a_deductive_question-answering_program",
"pratt|identification_and_transformation_of_terminal_morphemes_in_medical_englishi)"
],
"title": [
"The Georgetown-IBM Experiment of 1954:... | null | 665 | 0.031579 | null | null | null | null | null | null | null | null |
3f309c24cc21887aa3ed2ab6b739ff0ff7212ebb | 31206583 | null | The Lexicon: A System of Matrices of Lexical Units and Their Properties | Uriel Weinreich /I/~ in discussing the fact that at one time many American scholars relied on either the discipline of psychology or sociology for the resolution of semantic problems~ comments: In Soviet lexicology, it seems, neither the tra-ditionalists~ who have been content to work with the categories of classical r... | {
"name": [
"Josselson, Harry H."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 36 | 1969-09-01 | null | null | null | The research in automatic translation brought about by the introduction of computers into the technology has ~The research described herein has b&en supported by the Information Systems Branch of the Office of Naval Research. The present work is an amplification of a paper~ "The Lexicon: A Matri~ of Le~emes and Their P... | null | null | null | Lexical information is the consummation and thereby also | Main paper:
conclusion:
Lexical information is the consummation and thereby also
introduction:
The research in automatic translation brought about by the introduction of computers into the technology has ~The research described herein has b&en supported by the Information Systems Branch of the Office of Naval R... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | null | null | null | null | null | null | null | null | null |
7b24f68d5399872d9529fd60b614ae1f2d02cf1d | 14918516 | null | SOME REMARKS ON {J}. {L}. {M}EY{'}s PAPER (Preprint No. 20) | Mey's criticism of the functional approac~ to generative description concerns (1) the formal properties of the system proposed by Sgall et el. (its weak generative power, recursivit$~), and (2) some itl~or!~al questions connected with the mentioned approach. (1) From the formal point of view, Mey's paper contains many ... | {
"name": [
"Sgall, P. and",
"Hajicova, E."
],
"affiliation": [
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969 | 1969-09-01 | 6 | 0 | null | null | null | null | null | of the system proposed by Sgall et el. (its weak generative power, recursivit$~), and (2) some itl~or!~al questions connected with the mentioned approach.(1) From the formal point of view, Mey's paper contains many quite unclear points and errors, which make his cl~Jms unfounded. Some of those may be due to a mere unpr... | Main paper:
:
of the system proposed by Sgall et el. (its weak generative power, recursivit$~), and (2) some itl~or!~al questions connected with the mentioned approach.(1) From the formal point of view, Mey's paper contains many quite unclear points and errors, which make his cl~Jms unfounded. Some of those may be ... | null | null | null | null | {
"paperhash": [
"mey|on_the_preservation_of_context-free_languages_in_a_level-based_system"
],
"title": [
"On the Preservation of Context-Free Languages in a Level-Based System"
],
"abstract": [
"In this paper, a recently proposed level-oriented model for machine analysis and synthesis of natural... | null | 665 | 0 | null | null | null | null | null | null | null | null |
b13669371b48f7e5ca84d5f67476f57789cbf4c5 | 6314592 | null | Nexus a Linguistic Technique for Precoordination | A method for automatically precoordinating index terms was devised to form combinations of terms which are stored as subject headings. A computer program accepts lists of auto-indexed terms and by applying linguistic and sequence rules combines appropriate terms, thereby effecting improved searchability of an informati... | {
"name": [
"Benson, R. A."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 3 | 1969-09-01 | 7 | 2 | null | null | null | null | determination, a sequence rule goes into effect which combines terms based on their syntax.A variety of corpora was used to test and develop the NEXUS precoordinatot. Data bases consisting of legal information, computer program descriptions and NASA linear tape system documentation were used. More variety was present i... | null | Main paper:
:
determination, a sequence rule goes into effect which combines terms based on their syntax.A variety of corpora was used to test and develop the NEXUS precoordinatot. Data bases consisting of legal information, computer program descriptions and NASA linear tape system documentation were used. More var... | null | null | null | null | {
"paperhash": [
"macdonald|conversion_of_large-scale_is/r_systems_for_general-purpose_operation",
"newcomb|technique_for_the_automatic_generation_of_bibliographies_(a_biomedical_information_application)",
"sanford|problems_in_the_application_of_uniterm_coordinate_indexing"
],
"title": [
"CONVERSI... | null | 665 | 0.003008 | null | null | null | null | null | null | null | null |
abdf687e38b748cda3bc401beded64d9203747c7 | 42477596 | null | On Semantics of Some Verbal Categories in {E}nglish | An attempt is made at such a description of the semantics of some verbal categories that would fit in the functional type of generative description of language as proposed by Sgall. In most analyses of the. relationship | {
"name": [
"Hajicova, Eva"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 62: Collection of Abstracts of Papers | 1969-09-01 | 0 | 0 | null | null | null | null | null | between the morphemic verbal forms and their temporal meanings that have been made in this sphere up to now, the schemas employed proceed in two directions, that of temp- The status of these categories will be discussed and illustrated on English examples, as we~l as some remarks will be added concerning the possible a... | Main paper:
:
between the morphemic verbal forms and their temporal meanings that have been made in this sphere up to now, the schemas employed proceed in two directions, that of temp- The status of these categories will be discussed and illustrated on English examples, as we~l as some remarks will be added concern... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
17132198bf336988fd434103bcb2418b5d25445c | 14417375 | null | Syntactic Patterns in a Sample of Technical {E}nglish | Importance of the Concept of Homogeneity A fundamental assumption of statistical linguistics is that there are differences worthy of note in the frequency of various units in certain texts. At the same Time, there are differences in frequencies which would not be considered important. | {
"name": [
"Streeter, Victor J."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 44 | 1969-09-01 | 17 | 0 | null | In examining the raw results it may be clear at once that there is a meaningful difference among the counts or scopes.If samples of 100 sentences were taken at random from each of two texts, and the mean lengths for the two samples were 20 words and W0 words, no one would hesitate to conclude that one text revealed a r... | null | null | null | null | Main paper:
:
In examining the raw results it may be clear at once that there is a meaningful difference among the counts or scopes.If samples of 100 sentences were taken at random from each of two texts, and the mean lengths for the two samples were 20 words and W0 words, no one would hesitate to conclude that one... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
745adb4e0d451a8de7e4b282fbef3c1164b0bb90 | 62354584 | null | Discourse Referents | Consider a device designed to read a text in some r~tural language~ interpret it, and store the content in some manner~ say, fop the purpose of being able to answer questions about it. To accomplish this task~ the machine will have to fulfil[ at [east the following baste requirement. It has to be ab|e to build a file t... | {
"name": [
"Karttunen, Lauri"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 70 | 1969-09-01 | 2 | 3 | null | In this paper I intend to discuss one particular feature a text interpreter must have: that it must be able to recognize when a novel individual is mentioned in the input text and to store it atong with its characterization fop future reference. Of course~ in some P_~ses the problem is trivial. Suppose there appears in... | null | null | null | It is time to review the situation. We started by asking the seemingly na|be question: "When is there supposed to be an individual associated with an indefinite noun phrase?" Na|k/e as it may be, it must be answered in case there is ever going to be a device for inter-preting written texts or everyday conversation with... | Main paper:
factive verbs:
There is a group o£ verbs, called facttve verbs (Kiparsky 1968 ), that presuppose the truth of the proposition represented by the cornplement. For" example, know, realty_e, and regret are factive. It is not surpr-istng to find out that an indefinite NP does establish a refer'ent in a comp... | null | null | null | null | {
"paperhash": [
"damerau|a_technique_for_computer_detection_and_correction_of_spelling_errors"
],
"title": [
"A technique for computer detection and correction of spelling errors"
],
"abstract": [
"The method described assumes that a word which cannot be found in a dictionary has at most one erro... | null | 665 | 0.004511 | null | null | null | null | null | null | null | null |
d8f7cc78f56db48fb55161ffbd6e5b329d707812 | 9094008 | null | A New Approach to Syntax | This paper describes a new method for syntactic analysis of English. Instead of the conventional subject-predicate structure as a basis for analysis, elementary sentence patterns are used. It is observed that there are two basic sentence formats in English. One, using a transitive verb, consists of the sequence noun, v... | {
"name": [
"Dasher, B. J."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 62: Collection of Abstracts of Papers | 1969-09-01 | 0 | 0 | null | In order to show how any sentence can be reduced to its basic format, certain essentially algebraic operations are proposed, together with certain rules for transforming one structure into another. Conversely, the same rules may be used to construct a generative grammar that permits a cannonical sentence to be expanded... | null | null | null | null | Main paper:
:
In order to show how any sentence can be reduced to its basic format, certain essentially algebraic operations are proposed, together with certain rules for transforming one structure into another. Conversely, the same rules may be used to construct a generative grammar that permits a cannonical sente... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
ebf65f81d3c200dac2f11dc57216973240bdbca4 | 9797304 | null | The machine realization of the periphrasing system and the results of the experiment | The paper is devoted to the machine realization of the periphrasing system devised by I.A. Mel'chuk and A.K. Geolcovsky According to the idea of the semantic nature of a synthesis a deep sentence structure is used am input data for the periphrasing sjstem. By the given rules which are mashing up as a matter of fact the... | {
"name": [
"Arsentyeva, N. G."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 62: Collection of Abstracts of Papers | 1969-09-01 | 0 | 0 | null | null | null | null | of fact the periphrasing ~ystem the other sentence deep structures are obtained from the given deep structure, being equivalent by meaning. Both the machine realization of the periphrasin ~ystem and the experiment carried out wre~ intended to verify and to check out both the periphrasing system and the realization prog... | null | Main paper:
:
of fact the periphrasing ~ystem the other sentence deep structures are obtained from the given deep structure, being equivalent by meaning. Both the machine realization of the periphrasin ~ystem and the experiment carried out wre~ intended to verify and to check out both the periphrasing system and th... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
2d542af98e877589ad3809fe47cb036fe0644e39 | 12783059 | null | Statistical Methods in Lexicological Research in the {B}altic States | In this study"lexicology" refers to the dictionary form of a text, a vocabulary, without consideration of the lexical structure of an individual word and the system of its meaning: The first attempts to apply statistical methods in lexicological research are connected with the computation of "frequency dictionaries", p... | {
"name": [
"Radzin, Hilda"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Post-Print {I} | 1969-09-01 | 0 | 0 | null | The first attempts to apply statistical methods in lexicological research are connected with the computation of "frequency dictionaries", particularly various specialized lexica aimed at mechanical exploitation, A "frequency dictionary" is a list of words in which every word carries an indicator or its occurence freque... | null | null | null | null | Main paper:
:
The first attempts to apply statistical methods in lexicological research are connected with the computation of "frequency dictionaries", particularly various specialized lexica aimed at mechanical exploitation, A "frequency dictionary" is a list of words in which every word carries an indicator or it... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
5cbcc02dda8457ca2e4aeab03a6ed4c22a5eaa31 | 26299274 | null | Project {DOC} | Project DOC Dictionary On Computer, hereafter DOC, is part of an overall effort to harness an on-line computer for phonological research. For certain problems the linguist finds it necessary to organize large amounts of data or to perform rather involved logical tasks --such as checking out a body of rules with intrica... | {
"name": [
"Wang, William S-Y."
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 69: Collection of Abstracts of Papers | 1969-09-01 | 0 | 1 | null | The overt aim of DOC is the reconstruction of the phonological histories of the major Chinese dialects. ~ a deeper level, our interest is to learn more about how phonological structures change in general and about the relation between these changes and the synchronic systems they lead to. The achievement of this unders... | null | null | null | null | Main paper:
:
The overt aim of DOC is the reconstruction of the phonological histories of the major Chinese dialects. ~ a deeper level, our interest is to learn more about how phonological structures change in general and about the relation between these changes and the synchronic systems they lead to. The achievem... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.001504 | null | null | null | null | null | null | null | null |
49e40cc3c03f7f255327394ac953dcd5d35b4282 | 28804243 | null | An Application of Computer Programming to the Reconstruction of a Proto-Language | This paper illustrates the use of a computer program as a tool in linguistic research. The program under consideration produces a concordance on words according to phonological segments and environments. Phonological segments are defined as a predetermined aet of consonants and vowels. An environment is defined as the ... | {
"name": [
"Durham, Stanton P. and",
"Rogers, David Ellis"
],
"affiliation": [
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 5 | 1969-09-01 | 0 | 6 | null | null | null | The concordance facilitates the recognition of sound correspondances that lead to the reconstruction of a protolanguage.The program for production of the concordance was written in the SNOBOL4 programming language, which was selected because of its pattern match-1 ing capabilities.The summary Flow Chart of the program,... | null | null | Main paper:
:
The concordance facilitates the recognition of sound correspondances that lead to the reconstruction of a protolanguage.The program for production of the concordance was written in the SNOBOL4 programming language, which was selected because of its pattern match-1 ing capabilities.The summary Flow Cha... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0.009023 | null | null | null | null | null | null | null | null |
fbff1afb0deac3705cf4d89a1f08ca9cc3c00638 | 28508921 | null | Machine Transcoding | ~4achine Transcoding" There are grounds for questioning whether translation done by computer should resemble closely, either in process or in product, translation done manually. Several workers in machine translation have proposed radical departures from the naively adopted goal of simulating manual translation mechani... | {
"name": [
"Hofmann, T. R. and",
"Harris, Brian"
],
"affiliation": [
null,
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 62: Collection of Abstracts of Papers | 1969-09-01 | 0 | 0 | null | This paper explores a more rigorous approach, which may be described as follows: texts in one language are encoded into words and other morphs taken from a second language, but this is done without disturbing the syntax of the source language. The term 'transcoding' is coined to denote that process. Transcoding results... | null | null | null | null | Main paper:
:
This paper explores a more rigorous approach, which may be described as follows: texts in one language are encoded into words and other morphs taken from a second language, but this is done without disturbing the syntax of the source language. The term 'transcoding' is coined to denote that process. T... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
2a7cfab7184affce6bd8c7726ff75c0a9c4d6abd | 15417147 | null | Computers in the {Y}ugoslav {S}erbo-{C}roat/{E}nglish {C}ontrastive {A}nalysis {P}roject | As far as the present writer is aware, the Yu~os-~av Serbo-Croat/English Contrastive Analysis Project'is the first contrastlve analysis effort to use a large corpus of parallel texts. The corpus is made up of the Brown Corpus (reduced by 50%) with its Serbo-Croat translation, and a smaller Control Corpus (Serbo-Croat o... | {
"name": [
"Bujas, Zeljko"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 26 | 1969-09-01 | 4 | 0 | null | null | null | null | The Project, let us make it clear, is not exclusively based on this corpus. Compilation and confrontation of grammatical statements by various authors, plus plain old intuition, figure prominently in the methodology. The insistence on a large corpus, however, is due to the conviction, prevailing among the Project worke... | null | Main paper:
0.2.:
The Project, let us make it clear, is not exclusively based on this corpus. Compilation and confrontation of grammatical statements by various authors, plus plain old intuition, figure prominently in the methodology. The insistence on a large corpus, however, is due to the conviction, prevailing a... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 665 | 0 | null | null | null | null | null | null | null | null |
164d5336f1128c60a2db16f7385a36e807bfda18 | 29849726 | null | A Search Algorithm and Data Structure for an Efficient Information System | This paper describes a system for information storage, retrieval, and updating, with special attention to the search algorithm and data structure demanded for maximum program efficiency. The program efficiency is especially warrantedwhen a natural language or a symbolic language is involved in the searching process. Th... | {
"name": [
"Yang, Shou-chuan"
],
"affiliation": [
null
]
} | null | null | {I}nternational {C}onference on {C}omputational {L}inguistics {COLING} 1969: Preprint No. 51 | 1969-09-01 | 26 | 5 | null | Best of all, since the program can use the same technique for storing and updating informations, the maximum efficiency is also applicable to them wlth the same ease. Thus, it eliminates all the problems of inefficiency caused in establishing a file, and in updating a file.In our daily life, there are too many instance... | This attractive method as suggested by Lamb and Jacobsen in 1961 for the dictionary lookup in a machine translation system did not receive good attention for its possible applications in general information systems. The reasons could be the immediate response to the numerous letter tables after the second level which i... | null | This is also called block search. With the aid of a directory which contains the addresses of every Bth entry of the ordered file, a better result can be achieved because the average number of searches is greatly reduced. For the best result, choosing the blocking factor B = 220 in the example above, the answer is 223.... | This algorithm is used when an additlonal or new entry is put into the already established HAICS file. It is an operation of "adding" an entry to the end of a chain of its hashed address, rather than breaking up the chain and "inserting" the entry according to some order or hierarchy. This is so because each chain in t... | Main paper:
directory search:
This is also called block search. With the aid of a directory which contains the addresses of every Bth entry of the ordered file, a better result can be achieved because the average number of searches is greatly reduced. For the best result, choosing the blocking factor B = 220 in the... | null | null | null | null | {
"paperhash": [
"harvey|stylistic_analysis",
"lee|linguistic_studies_for_chinese_to_english_machine_translation.",
"i.b.|an_indirect_chaining_method_for_addressing_on_secondary_keys",
"peterson|addressing_for_random-access_storage",
"salton|automatic_information_organization_and_retrieval",
"... | null | 665 | 0.007519 | null | null | null | null | null | null | null | null |
8e2de0876fa7d354ec6bdf04e60db7facb7ff9e3 | 245118093 | null | Syntactic analysis requirements of machine translation | In this note I will confine my attention to machine translation (MT) systems which are based upon an underlying formal generative grammar. This is not to deny the potential importance of various computational aids to human translation, nor to deny the possibility of machine translation not based on a formal grammar. ... | {
"name": [
"Petrick, S. R."
],
"affiliation": [
null
]
} | null | null | Feasibility Study on Fully Automatic High Quality Translation | 1971-12-01 | 10 | 0 | null | The importance of the syntactic component has been recognized for some time. For the purposes of MT it has two distinct ends to achieve: on the one hand it must specify a large enough subset of the source language to meet the operational requirements of the MT application in question.(The related function of ruling out... | null | null | null | null | Main paper:
:
The importance of the syntactic component has been recognized for some time. For the purposes of MT it has two distinct ends to achieve: on the one hand it must specify a large enough subset of the source language to meet the operational requirements of the MT application in question.(The related func... | null | null | null | null | {
"paperhash": [
"kellogg|the_converse_natural_language_data_management_system:_current_status_and_plans",
"petrick|on_the_use_of_syntax-based_translators_for_symbolic_and_algebraic_manipulation",
"winograd|procedures_as_a_representation_for_data_in_a_computer_program_for_understanding_natural_language",
... | - Problem: The paper discusses the limitations of grammar-based machine translation systems in fully automated translation due to the challenge of relating syntactic structures to underlying meaning, especially in the context of semantic interpretation.
- Solution: The paper proposes that for successful machine transl... | 638 | 0 | null | null | null | null | null | null | null | null |
6f7b062db306c4aad4adaffe65279d06013b7acd | 245118118 | null | Operational problems of machine translation: a position paper | referred to machine translation as "linguistics' most conspicuous and expensive failure." 1 Two years later the Automatic Language Processing Advisory Committee of the National Academy of Sciences, National Research Council in what has since become known as the ALPAC Report (1966: 24) stated that "No one can guarant... | {
"name": [
"Garvin, Paul L."
],
"affiliation": [
null
]
} | null | null | Feasibility Study on Fully Automatic High Quality Translation | 1971-12-01 | 10 | 0 | null | It is a commonly held view among linguists, both the few who are interested in machine translation and the many who are not, that any application of linguistics-and in the linguist's view this certainly includes machine translation research-must be based primarily on a strong linguistic theory.(For a recent statement o... | null | null | null | null | Main paper:
linguistic problems the role of linguistics theory in machine translation:
It is a commonly held view among linguists, both the few who are interested in machine translation and the many who are not, that any application of linguistics-and in the linguist's view this certainly includes machine translati... | null | null | null | null | {
"paperhash": [
"|some_comments_on_algorithm_and_grammar_in_the_automatic_parsing_of_natural_languages"
],
"title": [
"Some Comments on Algorithm and Grammar in the Automatic Parsing of Natural Languages"
],
"abstract": [
"The purpose of this paper is to examine the oft-repeated assertion regardi... | Problem: The paper discusses the operational problems of machine translation research in light of authoritative statements questioning the feasibility of achieving machine translation.
Solution: The hypothesis of the paper is that operational problems in machine translation research can be addressed effectively with a... | 638 | 0 | null | null | null | null | null | null | null | null |
0bc5b1ac05e0487de33ceda528054d7d62a81489 | 46532082 | null | Toward a theory of computational linguistics | To begin with, I would like to assert that computational linguistics (henceforth: CL), despite its qualifying adjective, has to do with human behavior, and, in particular, with that subset of human behavioral patterns that we study in linguistics. In other words, the aim of CL as a science is to explain human behavior ... | {
"name": [
"Mey, Jacob"
],
"affiliation": [
null
]
} | null | null | Feasibility Study on Fully Automatic High Quality Translation | 1971-12-01 | 8 | 1 | null | activities that we want to describe. Of course, the simulative model, in order to be scientifically interesting, must attempt to explain; a machina loquax, to use Ceccato's expression (1967) is no good if there is a deus in machina. Although the idea of building homunculi, robots and what else they are called is not ex... | null | null | null | null | Main paper:
competence and performance in cl:
The next question to be answered is: how do these theoretical considerations reflect on past and current work in CL? Until recently, very little attention has been paid to the performance aspect of CL. The only really large-scale computeraided research in performance ha... | null | null | null | null | {
"paperhash": [
"bobrow|a_phonological_rule_tester"
],
"title": [
"A phonological rule tester"
],
"abstract": [
"Theoretical and practical values of error coefficients useful in bounding the error in integrating periodic analytic functions with the trapezoidal rule are tabulated for various range... | Problem: The paper discusses the relationship between computational linguistics (CL) and human behavior, specifically focusing on the distinction between descriptive and simulative models in behavioral sciences.
Solution: The hypothesis of the paper is that in computational linguistics, the development of simulative m... | 638 | 0.001567 | null | null | null | null | null | null | null | null |
254cb5591e4ca173195d17217f1a525e41e8303a | 245118156 | null | The logic of {E}nglish predicate complement constructions | The Logic of English Predicate Complement Constructions 1 Lauri Karttunen 0. INTRODUCTION. The title of my paper is an intentional variation on the name of Peter Rosenbaum's (1965) well-known MIT dissertation 'The Grammar of English Predicate Complement Constructions'. It is intended to be suggestive of a difference in... | {
"name": [
"Karttunen, Lauri"
],
"affiliation": [
null
]
} | null | null | Feasibility Study on Fully Automatic High Quality Translation | 1971-12-01 | 10 | 24 | null | well-known MIT dissertation 'The Grammar of English Predicate Complement Constructions'. It is intended to be suggestive of a difference in emphasis between the early work on complement constructions by Rosenbaum and others, and the more recent studies by Paul & Carol Kiparsky, George Lakoff, Jerry Morgan, and myself -... | null | null | null | The set of if-verbs includes those in (32). In all of the a-sentences, the speaker is committed to the belief that Mary stayed home. It would not be honest to assert any of the sentences in (33a) if one thought otherwise. This fact distinguishes the verbs in (33a) from such syntactically very similar verbs as those in ... | Main paper:
if-verbs.:
The set of if-verbs includes those in (32). In all of the a-sentences, the speaker is committed to the belief that Mary stayed home. It would not be honest to assert any of the sentences in (33a) if one thought otherwise. This fact distinguishes the verbs in (33a) from such syntactically very... | null | null | null | null | {
"paperhash": [
"stockwell|integration_of_transformational_theories_on_english_syntax",
"rosenbaum|the_grammar_of_english_predicate_complement_constructions"
],
"title": [
"Integration of transformational theories on English syntax",
"The grammar of English predicate complement constructions"
]... | - Problem: To extract the research hypothesis from the paper "The Logic of English Predicate Complement Constructions" by Lauri Karttunen.
- Solution: The hypothesis of the paper is to propose a classification of English verbs based on their complement structures, distinguishing between factive verbs, implicative verbs... | 638 | 0.037618 | null | null | null | null | null | null | null | null |
09d1b93152faa4e42fc51fdd4a19267ca54b28fc | 42802688 | null | Feasibility study on fully automatic high quality translation | As the appendices indicate, the study brought together specialists in the areas involved in machine translation. The report summarizes their findings. Participants in the study were provided with a preliminary statement of the initial part of this report, except for the conclusions and recommendations, and were asked t... | {
"name": [
"Lehmann, Winfred P. and",
"Stachowitz, Rolf"
],
"affiliation": [
null,
null
]
} | null | null | Feasibility Study on Fully Automatic High Quality Translation | 1971-12-01 | 7 | 7 | null | As the appendices indicate, the study brought together specialists in the areas involved in machine translation. The report summarizes their findings. Participants in the study were provided with a preliminary statement of the initial part of this report, except for the conclusions and recommendations, and were asked t... | null | null | The topic of machine translation is rarely discussed without reference to translation by man. In the comparison, several stereotypes have evolved.For clarity in dealing with the issue of machine translation these may be briefly noted.The human translator is generally assumed to be highly skilled, both in the subject ma... | One of the primary problems in presenting the views of specialists in machine translation results from the low level of research during the past five years. Few groups received any kind of support. The greater part of them could only update their previous systems, not introduce major innovations.In view of the low fund... | Main paper:
translation: human and machine:
The topic of machine translation is rarely discussed without reference to translation by man. In the comparison, several stereotypes have evolved.For clarity in dealing with the issue of machine translation these may be briefly noted.The human translator is generally assu... | null | null | null | null | {
"paperhash": [
"gingold|a_guide_to_better_translations_for_industry",
"ray|a_philosophy_of_translation"
],
"title": [
"A Guide to Better Translations for Industry",
"A Philosophy of Translation"
],
"abstract": [
"Summary To sum up my advice to those persons charged with procuring transla... | null | 638 | 0.010972 | null | null | null | null | null | null | null | null |
83fdffa472054cba43f1e2387a4e3df1dd84e47e | 245118159 | null | Meaning revisited | A summary like this one can do no more than lay out the bare bones of choicemaking activities which in each human organism are vastly convoluted and subtle. However, it is part of my purpose to spotlight the very hazard of abandoning oneself prematurely to mere facts so as to find solace in work of exceptional professi... | {
"name": [
"Pendergraft, Eugene D."
],
"affiliation": [
null
]
} | null | null | Feasibility Study on Fully Automatic High Quality Translation | 1971-12-01 | 2 | 78 | null | selection processes.It can be shown, for example, that the entire translation process can be generalized through use of metalanguages capable of conveying interlingual relations of various kinds. However, this merely extends the idea of enlarging the machine's store of knowledge about language, an idea which by itself ... | null | null | null | null | Main paper:
pragmatic method:
Christopher Alexander, in his notes on the synthesis of form, cites a common engineering practice for making a metal face perfectly smooth and level. One inks the surface of a standard steel block, which is level within finer limits than those desired, and then one rubs the face to be ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 638 | 0.122257 | null | null | null | null | null | null | null | null |
bbe145f17bbc1104bf5f9f606bb423886c8c62c2 | 219308541 | null | A Few Steps Towards Computer Lexicometry | Appendix I1 Some ideas for the program to investigate the relatianship c o v e r i n g set size versus maximum definition length . | {
"name": [
"Findler, Nicholas V. and",
"Viil, Heino"
],
"affiliation": [
null,
null
]
} | null | null | null | 1974-09-01 | 0 | 0 | null | null | Lexicoqraphical meaning is t h a t of "words, " and the In the framework .of o u r particular topic w e shall be mainly concerned w i t h categories 4 and 7 .(1 966 ) , u n i l i n g u a l d e f l n i n g d i c t i o n a r i e s appear t o be based on a model that assumes a d i s t i n c t i o n between meaning p r o p... | null | F ' i r s t , we review c r i t i c a l l y t h e problems o f meaning and i t s r e p r e s e n t a t i o n , t h e q u e s t i o n s r e l a t i n g t o l e x i c a l d e f i n i t i o n s . . Logical meaning applies to such attempts to deal with meaning as symbolic l o g i c and mathematics. The meanings with which ... | null | Main paper:
.:
Lexicoqraphical meaning is t h a t of "words, " and the In the framework .of o u r particular topic w e shall be mainly concerned w i t h categories 4 and 7 .(1 966 ) , u n i l i n g u a l d e f l n i n g d i c t i o n a r i e s appear t o be based on a model that assumes a d i s t i n c t i o n betw... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 605 | 0 | null | null | null | null | null | null | null | null |
dac8d37e05fdc30baab1e66753f470102c2e346b | 219307744 | null | Natural Semantics in Artificial Intelligence | This papar d i s c u ~s e e human semantic knowledge and proceesing i n terms of the SCHOLAR system. In one major s e c t i o n we d i s c u s s the imprecision, the incompleteness, the open-endedness, and the uncertainty of psopl,eqs knowledge. In the other major s e c t i o n we diecuss strategies people use to make ... | {
"name": [
"Carbonell, Jaime R. and",
"Collins, Allan M."
],
"affiliation": [
null,
null
]
} | null | null | null | 1974-09-01 | 0 | 9 | null | null | null | null | null | we are o n l y t r y i n g to develop some i n s i g h t s , without attempting to be exhaustive. More questions w i l . 1 be raised than qnewersprovided. There are many observable t h i n g s people do t h a t we do i a a modified and extended nemork a la Q u i l l i n and has a r i c h i n t e r n a l s t r u c t u r... | Main paper:
, f:
Imprecise language is an essential characteristic of human PO Is t h e C h a c~ t h e cattle c a u n t q ? I know the c a t t l e c o u n t r y is down there, I t h i n k it's mre sheep country. I t @ , e l i k e w e s t e r n Texas 80 i n same sense 1 guess i t u s c a t t l e country.&nd t h e n ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 605 | 0.014876 | null | null | null | null | null | null | null | null |
f2426925cdb5d7017c618a7feddd762ce9241dd3 | 219301108 | null | The Lexical Subclasses of the Linguistic String Parser | DPWN 30 DP 3-Pm '~fi addition to the Noun, Adjective and Verb classes, the other major classes are Adverb, Pronoun, Quantifier, Article, Subordinate Conjunction and Preposition. Coordinate Conjunctions and comparative connectives are treated individually. | {
"name": [
"Fitzpatrick, Eileen and",
"Sager, Naomi"
],
"affiliation": [
null,
null
]
} | null | null | null | 1974-09-01 | 0 | 0 | null | null | null | Object A t t r i b u t e s of t h e V e r b ( C o n t i n u e d ) This paper defines the 109 adjective, noun and verb subclasses of the NYU Ling~~istic String Parser (LSP) The su~classes have bee11 treated here in such a way that they can be used as a guide for classifying new words for the lexicon ahd as a lineistic r... | I am certain that John will come.They were eager for the speaker to address the crowd.I am insistent that you go alone.I am certain that John will come.I'M grateful 'that the stuff arrived on time.We r e happy that you can come.He is doubtful whether the plans Mil come off.I'm not sure whether they \\ill come.We a r e ... | null | Main paper:
) asent3: (athat):
I am certain that John will come.They were eager for the speaker to address the crowd.I am insistent that you go alone.I am certain that John will come.I'M grateful 'that the stuff arrived on time.We r e happy that you can come.He is doubtful whether the plans Mil come off.I'm not sur... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 605 | 0 | null | null | null | null | null | null | null | null |
3c240ba09e53b1df87a1fdb171a6f9c1c6c3ebf5 | 219302766 | null | Pattern-Matching Rules for the Recognition of Natural Language Dialogue Expressions | Nan-mach i m d i a I c ~g i ~e e ue i ng everday convarsat 1 ona I Eng I | {
"name": [
"Colby, Kenneth Mark and",
"Parkison, Roger C. and",
"Faught, Bill"
],
"affiliation": [
null,
null,
null
]
} | null | null | null | 1974-09-01 | 0 | 11 | null | null | null | null | null | B r a c k e t i n g the p a t t e r n i n t o ,shorter segrncnts.A " s i m p l e " 'Negations and anaphora. Hatching tha p a t t e r n w i t h B t o r e d p a t t c r n e having p o i n t e r s t o response f u n c t i o n s i n memory. I f a complete match i s n o t found, a fuzzy match i s a t t e m p t e d by d e l ... | Main paper:
segment i ng 13:
B r a c k e t i n g the p a t t e r n i n t o ,shorter segrncnts.A " s i m p l e " 'Negations and anaphora. Hatching tha p a t t e r n w i t h B t o r e d p a t t c r n e having p o i n t e r s t o response f u n c t i o n s i n memory. I f a complete match i s n o t found, a fuzzy matc... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 605 | 0.018182 | null | null | null | null | null | null | null | null |
c52a941af78a81a2e1d147ef3848c22cf4a34ecd | 219303879 | null | Technique: Letters with Variable Values and the Mechanical Inflection of {R}umanian Words | numerous to be considered irreqular. The method of storinq the several al,lomqrphs of the stem fortautomatic i n f l e c t i o n misses t h e n a t u r a l uriity of, the word. We* have Constructed a mechanical Morphol o g i cal D i o t i o n a r y / , containing 2 0 5 8 written Rumanian words with a synthetic repres e... | {
"name": [
"Bocsa, Minerva"
],
"affiliation": [
null
]
} | null | null | null | 1974-12-01 | 0 | 0 | null | null | null | null | spelling. N e v e r t h e l e s s , the words w i t h nonc'onstant stem are too numerous to be considered irreqular. The method of storinq the several al,lomqrphs of the stem fortautomatic i n f l e c t i o n misses t h e n a t u r a l uriity of, the word. The algorithm whose logic was given in [ 3 ] is t h e backgroun... | null | Main paper:
rumanian infle~tion:
spelling. N e v e r t h e l e s s , the words w i t h nonc'onstant stem are too numerous to be considered irreqular. The method of storinq the several al,lomqrphs of the stem fortautomatic i n f l e c t i o n misses t h e n a t u r a l uriity of, the word. The algorithm whose logic ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 602 | 0 | null | null | null | null | null | null | null | null |
de6cd50742fe3728ea6a041869a9f1dcc2493c19 | 59849058 | null | Understanding by Conceptual Inference | CAUSE C0055 C0059) C0066: (CAUSE ,CBBSS C08G1) C08G5: (CAUSE C91055 C0063) CBGJG4: (TS CBBr33 C0016) C0063: (aMFEELs #B ILL^ #NEGEflOT I ON #JOHN1 1 C00G2: (TIME C0961 C0016) C006 1 : . (POSCHANGE #MARY 1 #JOY CB062: (TS' C0059 C0016) C8059: (WANT #B I LL1 %0058). | {
"name": [
"Rieger, Chuck"
],
"affiliation": [
null
]
} | null | null | null | 1974-12-01 | 0 | 2 | null | Ally theory o t l a n g u a y a m u s t a l s o be a t h e o r y o f i n f e r e n c e a n d memory. I t d o e s n o t a p p e a r t o be p o s s i b l e t o " u n d e r s t a n d " e v e n t~l e s i m p l e s t o f u t t e r a n c e s i n a c o n t e x t u a l l y m e a n i n g f u l way i n a s y s t e m i n which l ... | Central to this theory are sixteen classes of spontaneous conceptual inferences. These classes are abstract enough to be divorced from any particular meaning representation formalism. However, since they were developed concurrently with a larger moiiel of conceptual memory (R1) which is functionally a part of a languag... | null | F I G U R E 1 1 \ ' r MARY < = = = > DOC o n c e p t u a l dep,endency r e p r e s e n t a t i o n o f t n e s e n t T e n c e ":dary . k i s s e d J o h n because he hit B i l l . II second and thiqrd s t a g e s are ( 2 ) t h e i s o l a t i o n o f s u b g r a p h s which w i l l form t h e b e g i n n i n gi n f e ... | null | Main paper:
john <===> propel e---x?:
F I G U R E 1 1 \ ' r MARY < = = = > DOC o n c e p t u a l dep,endency r e p r e s e n t a t i o n o f t n e s e n t T e n c e ":dary . k i s s e d J o h n because he hit B i l l . II second and thiqrd s t a g e s are ( 2 ) t h e i s o l a t i o n o f s u b g r a p h s which w ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 602 | 0.003322 | null | null | null | null | null | null | null | null |
bc3ec542651a8246e1f8ee4052dd137c744ba128 | 219303034 | null | String Transformations in the {R}equest System | The REQUEST System is an experimental n a t u r a l language query system based on r. large transfo~ational grammar of English. In the original implementation of the system the process of computing the underlying sLructures of input queries involved a sequence of three steps: (1) preprocessing (including dictionary loo... | {
"name": [
"Plath, Warren J."
],
"affiliation": [
null
]
} | null | null | null | 1974-12-01 | 2 | 0 | null | null | null | null | null | Since they must be defined in the absence of such structural markers as the location of clause boundaries, string transformations aye necessarily relatively local in scope. Despite t h i s inherent limitation, they have so far proved to be an extremely useful and surprisingly versatile addition t o the REQUEST System. ... | Main paper:
. 2 e a r l y experience with the parser:
Starting i n l a t e 1971, t e s t s began on a n i n v e r s e t r a n s f o r n l a t~o n a l g r a m m a r whose g e n e r a t i v e c o u n t e r p a r t had b e e n developed with the aid of Thus, the s t r u c t u r a l p a t t e r n in F i g u r e 2 i n d... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 602 | 0 | null | null | null | null | null | null | null | null |
47c464c7d589680bdd4cd0cdf6a3ab28b15b8cbe | 219307922 | null | Verbalization and Translation by Machine | A l s o active d u r i n g more t h a n half of this period were Masayoshi S h i b ~t n n i aqd L i n d a oobek. Associated d u r i n g s h o r t e r p e r i o d s of time were | {
"name": [
"Chafe, Wallace L."
],
"affiliation": [
null
]
} | null | null | null | 1974-12-01 | 0 | 0 | null | null | null | null | gram=* 01 t i~c t:)rIyet L a n r r 1~~3 f r e . J e r b g l l i z~t i o n :i:ld t r a n s l a t i j n I n an e a r l i e r r e p o r t t h a t t h e r e are two c h r n e n s l~n s of high q u a l l t y t r a n s l s t l q n , whnch we termed naturalnes-s and fldelltg, N a t u r a l n e s s 1 s achleved when t h e t u ... | null | Main paper:
v: is the wpsu~e explicit?:
The next two questions are:19. V: WIIAT IS THZ A G~T ? 21. V: WIIAT 'IS T33 Z'ATIENlaVAT now has t h e . following represe~tation (cf. 36) above:VB-" UR-' 1 / l l~~~~l f PI-2001t1GT PI-2003'l PAT CJ-". It cc-2002 c g ~~K:~IIAII t I -I tVAT next asks-:whereupon f o r Japanese.... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 602 | 0 | null | null | null | null | null | null | null | null |
aa454e8cea7ebc71ddc083d0097fd12626853e37 | 219301246 | null | The {ATEF} and {CETA} Systems | ATEF converts an input string into a labeled tree; t h e label evolves under the c o n t r o l of a grammar. A s e t of labels is associated with each segment of the string, and several functions permit control of the number of alternative labels. CETA simulates a transformatianal grammar. It uses a set o f grammars wi... | {
"name": [
"Chauche, J."
],
"affiliation": [
null
]
} | null | null | null | 1975-07-01 | 0 | 4 | null | of applications in several domains and notably in that of the automatic processing of natural languages. The ATEF system has the purpose of transformFng a string of words into a tree which is manipulable by the CETA system. The definition of labeled trees determines what objects CETA can manipulate and the objecti'ves ... | null | null | null | null | Main paper:
:
of applications in several domains and notably in that of the automatic processing of natural languages. The ATEF system has the purpose of transformFng a string of words into a tree which is manipulable by the CETA system. The definition of labeled trees determines what objects CETA can manipulate an... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 595 | 0.006723 | null | null | null | null | null | null | null | null |
0ccf7d5d193bf9ca224ebac0e5af44d69e1670c8 | 219300604 | null | Semantically Analyzing an {E}nglish Subset for the Clowns Microworld | A m i c r o w o r l d system i s d e s c r i b e d for d i s p l a y i n g visual r e p r e s e n t a t i o n s of t h e meaning of a subset of E n g , l i s h t h a k . c o nc e r n s a clown t h a t can balance objecbs and can p a r t i c i p a t e i n m o t i o n s c e n a r i o s . Nouns s u c h a s " c l o w n " ,... | {
"name": [
"Simmons, Robert F. and",
"Bennett-Novak, Gordon"
],
"affiliation": [
null,
null
]
} | null | null | null | 1975-07-01 | 2 | 10 | null | null | dynamic process model t h a t can be operated t o produce successive s t a t e s deecribed by t h e E n g l i s h . The p r i n c i p l e s used i n t h e system are.a c o n c i s e representation of my g l e a n i n g s from r e c e n t l i t e r a t u r e dnd of c o u r s e from work of my own and my students.In t h ... | null | null | ) 1 +PROCESS, MQDEI. R SET^ LFV 0)( ( S E W F O C ( G F T 4 = q U P J ) 1 ( S F T Q vw a ) ) ( ( S E T 0 F,OC(GET @ = O P J ) ) ( s E T Q V R * ) ) 1 U N l V O O P ICSCC * T R A~E * M A S~$ C L 1 ( L T N T T ) (MAXWLOQP) 1 ) ) 4(PRIIC; 1 W"wT EER N X L ) CSETQ ITADDER 2048) 1 ) ) J1 E IS A SHQRT k OF E R M E T O E R A ... | Main paper:
(setg v e h i c ( v a k e t o n $ ) ) ( c o n e ( ( a h 0 v e h i c (null m f d i l i m ) ( $ e t q j ( b e t o k ' v e h t c e d m e d i u m ) ) (setc 4 e d t u m (,pahftr)w j):
) 1 +PROCESS, MQDEI. R SET^ LFV 0)( ( S E W F O C ( G F T 4 = q U P J ) 1 ( S F T Q vw a ) ) ( ( S E T 0 F,OC(GET @ = O P J )... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 595 | 0.016807 | null | null | null | null | null | null | null | null |
db91c730625a35c942f872b4d658489877cfb96b | 219303905 | null | Conceptual Analysis: Inventory and Analysis of Terminology in Political Science | This committee (which includes political scient ists, sociologists, anthropologists, linguists, and philosophers) has been moving toward several objectives of concept clarification in political and social analysis. COCTA has organized panels at many polirical science and socialogy associations, including its formal, as... | {
"name": [
"Graham, Jr., George J."
],
"affiliation": [
null
]
} | null | null | null | 1975-07-01 | 0 | 0 | null | null | null | null | (IE t h e term is not English, it shauld be followed b y a coma and the closest English translation 2If the term and definition a r e in a language other than English, the definition should be followed by an EXACT 3~h e UPSIS is a special abstracting and retrieval system of political science articles, books, papers, et... | moving toward several objectives of concept clarification in political and social analysis. COCTA has organized panels at many polirical science and socialogy associations, including its formal, association with the C mparative Interdisciplinary Studies Section of the International Studies Association as the Internet o... | Main paper:
the term used by the authqr t o reference a c o n c e p t , e . g consensus':
(IE t h e term is not English, it shauld be followed b y a coma and the closest English translation 2If the term and definition a r e in a language other than English, the definition should be followed by an EXACT 3~h e UPSIS ... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 595 | 0 | null | null | null | null | null | null | null | null |
3f5095fd9dddc7a3d9576d99504fc3b8cffdace6 | 219302551 | null | A Report on the Tutorial on Computational Semantics, Institute for Semantics and Cognitive Studies, {V}illa {H}eleneum, {L}ugano-{C}astagnola | The Institute, a branch of the Fondaeione dalle Molle, is carrying on research on a r t t f i a i a l intelligence (AI); about ten scholars devote themselves to the study of comhunication between man and machine, under the direction of Manfred Wettler. The tutorial was a week of lectures, seminars, and discuss i w s co... | {
"name": [
"Hanon, Suzanne and",
"Koch, Gregers and",
"S{\\o}ndergaard, Georg"
],
"affiliation": [
null,
null,
null
]
} | null | null | null | 1975-07-01 | 10 | 0 | null | Top-down parsing is the reverse procedure starting with the generations and continuing from left to right until the last word is reached. Another important pair of teahnical terms is BREADTH-FIRST and DEPTH-FIRST.B r e a d t h -f i r s t is t h e p a r a l l e l treatment of all possible alternative structures at a giv... | null | null | null | null | Main paper:
t u t o r i a l on computational s e m a n t i c s .:
Top-down parsing is the reverse procedure starting with the generations and continuing from left to right until the last word is reached. Another important pair of teahnical terms is BREADTH-FIRST and DEPTH-FIRST.B r e a d t h -f i r s t is t h e p a... | null | null | null | null | {
"paperhash": [
"charniak|toward_a_model_of_children's_story_comprehension",
"hewitt|planner:_a_language_for_proving_theorems_in_robots",
"raphael|sir:_a_computer_program_for_semantic_information_retrieval",
"katz|the_structure_of_a_semantic_theory"
],
"title": [
"Toward a model of children's... | null | 595 | 0 | null | null | null | null | null | null | null | null |
69165058b3ae794aa3e258d31161a3b086dcb7d5 | 219304199 | null | A Case History in Computer Exploration of Fast Speech Rules | In c o n v e r s a t i o n a l s p e e c h , words r u n t o q 6 t her a n d i n t e r a c t c a u s i n g t h e i p h o n o l o g i c a l f ~r m s t o d i f f e r from t h e i r c i t a t i o n forms. F a s t s p e e c h r u l e s a t t e m p t t3 q e s c r i b e these c h a n g e s as s p e e c h becomes f a s t e r ... | {
"name": [
"Moran, Douglas B."
],
"affiliation": [
null
]
} | null | null | null | 1975-07-01 | 2 | 1 | null | null | null | null | null | We had few t r a n s c r i p t i o n s of f a s t speech forms, so i nG R A P H O F P A R T I A L O R D E R I N G - - L I N E A R I Z E D -....-----A SSI 31 LA TZO N[ RJ-FLAPPING----------VOWEL R E D U C T I O N SCHWA O E L F T I O N < I k G > R E D U C T I O NA LVEOLAP FLAPPX N ! : GLOTTAL STOP F O R M A T I O NEQUATI... | Main paper:
:
We had few t r a n s c r i p t i o n s of f a s t speech forms, so i nG R A P H O F P A R T I A L O R D E R I N G - - L I N E A R I Z E D -....-----A SSI 31 LA TZO N[ RJ-FLAPPING----------VOWEL R E D U C T I O N SCHWA O E L F T I O N < I k G > R E D U C T I O NA LVEOLAP FLAPPX N ! : GLOTTAL STOP F O R... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 595 | 0.001681 | null | null | null | null | null | null | null | null |
df78e32399133ca696bec85787300049d704c47e | 219310187 | null | {``}Formulae{''} in Coherent Text: Linguistic Relevance of Symbolic Insertions | Some difficulties in automatic analysis ~n d translat i o n bound to symbolic insertions in mathematical t e x t s a r e discussed. Rules dealins with these d i f f i c u l t i e s a r e proposed, These r u l e s are based on the use of the whole t e x t of the a ~C i c l e incorporating a formula. For satisfactory aut... | {
"name": [
"Dreizin, Felix"
],
"affiliation": [
null
]
} | null | null | null | 1975-07-01 | 0 | 0 | null | null | null | null | null | L e t US try to translate from, Engllcsh-to 'Russian the sentence n \ y n -- Similar examples a r e provicted by other languages:.: In jeder Umgebung V von o X * .'Let R be a ring with a unity I*.( 2 We deflne 3 and k by j = m + n; k = mno. 5The "direct* translation of ( 5 ) t o Russian: ' | Main paper:
:
L e t US try to translate from, Engllcsh-to 'Russian the sentence n \ y n -- Similar examples a r e provicted by other languages:.: In jeder Umgebung V von o X * .'Let R be a ring with a unity I*.( 2 We deflne 3 and k by j = m + n; k = mno. 5The "direct* translation of ( 5 ) t o Russian: '
Appendi... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 595 | 0 | null | null | null | null | null | null | null | null |
39279898ecd83f9502e994f4d694bea48db70413 | 219305258 | null | Recent Computer Science Research in Natural Language Processing | Ihe maohine translation problem has recently been replaced by much narrower goals and computer processing of language has become part df artificial intelligence (AI), speech recognition, and structural pattern recognition. These are each specialized computer science research fields with distinct objectives and assumpti... | {
"name": [
"Klinger, Allen"
],
"affiliation": [
null
]
} | null | null | null | 1975-07-01 | 1 | 1 | null | A program to detect "meaning" (logical consequences of word interpretations) must also perform grammatical operations for certain words to determine a part of speech (noun, verb, adjective, etc.)One method makes a tentative assigrlment, parses, then tests for plausibility via consistency with known facts.To reduce the ... | A large body of research in computer science is devoted to language processing. | null | null | The computer literature discussed in this paper uses several linguistic terms in special ways, when there is a possibility sf congusion, quotation marks will be used to identify technical terms in computer science. The term "understanding" is frequently used as a synonym for "the addition of logical relationships or se... | Main paper:
. do specialized vocabularies have sufficient complexity to warrant comparison with true natural language?:
2 . Are current "understanding" programs, organized by level and using domain reatrictidn, extendable to true natural language?The realities are severe. Syntactic processing is interdependent with... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 595 | 0.001681 | null | null | null | null | null | null | null | null |
4350fd940840986cbd46624dfde0f3d718448ca2 | 219310301 | null | A Formal Psycholinguistic Model of Sentence Comprehension | c l a u s e , w i t h o n l y the semantic content regularly retained after the clause boundary is passed. The surface words (and g fortiori the syntactic s t r u c t u r e ) of the clause would tend t o be erased after each clause boundary. 1 *Thie paper i s based on chapter VII o f my doctoral dissertation ( ~e i m o... | {
"name": [
"Reimold, Peter"
],
"affiliation": [
null
]
} | null | null | null | 1975-09-01 | 6 | 2 | null | null | ( 4 )~q i r l { w i t h a green hat who wore a green hat g r e e t e d John. | null | J o h n ate t h e cake C afterwards .aster the guests left.Z v l d e n t l y , w i t h a green h a t in ( 4 ) is r e l a t e d to who wore a meen hat, and t h e adverb afterwards in ( 5 ) can be replaced by f i l l 1 adverbial clauses like after t h e m 1 e s . t~ l e f t . (1) it should be a clause-by-clause processo2... | null | Main paper:
):
J o h n ate t h e cake C afterwards .aster the guests left.Z v l d e n t l y , w i t h a green h a t in ( 4 ) is r e l a t e d to who wore a meen hat, and t h e adverb afterwards in ( 5 ) can be replaced by f i l l 1 adverbial clauses like after t h e m 1 e s . t~ l e f t . (1) it should be a clause-... | null | null | null | null | {
"paperhash": [
"nash-webber|semantics_and_speech_understanding",
"kuno|the_predictive_analyzer_and_a_path_elimination_technique"
],
"title": [
"Semantics and Speech Understanding",
"The predictive analyzer and a path elimination technique"
],
"abstract": [
"Abstract : Syntactic constrain... | null | 593 | 0.003373 | null | null | null | null | null | null | null | null |
7bb56e990a610940a53e4713deeed2140acb3b0c | 219303156 | null | {AUTONOTE}2: Network Mediated Natural Language Communication in a Personal Information Retrieval System | T h i s paper is based on a doctoral disserfiation by the first author. Support from the iUationai Science Foundation under ~r m t ' No. DCR71-02038 is gratefully acknowle8ged. Those wishing more mmplete details about s y s t e m c a d s and imp.tomentatioa should,write the s-d author for a User's Manual. 2 lVow a t t ... | {
"name": [
"Linn, Jr., William E. and",
"Reitman, Walter"
],
"affiliation": [
null,
null
]
} | null | null | null | 1975-09-01 | 6 | 0 | null | The system described here uses t h e AUTONOTE information storage and r e t r i e v a l system (Reibnane t -. Text e n t r y , To e n t e r a new text i t e m , t h e u s e r f i r s t types t h e command ENTER and t h e eystem responds with a numerical t a g f o r the new i t e m . The system then e n t e r s a "lext ... | null | null | null | human cormrmnicat%~e efficiency. The l i s t e n e r ' s r e p r e s e n t a t i o n of t h e t o p i c s alteacly discussed f a c i l i t a t e s communication i n t h a t t h e speaker i s spared the trouble of describing i n complete d e t a i l those t h b g s t o which he r e f e r s .Furthermore, the speaker can ... | Main paper:
the awonote system:
The system described here uses t h e AUTONOTE information storage and r e t r i e v a l system (Reibnane t -. Text e n t r y , To e n t e r a new text i t e m , t h e u s e r f i r s t types t h e command ENTER and t h e eystem responds with a numerical t a g f o r the new i t e m . ... | null | null | null | null | {
"paperhash": [
"henisz-dostert|how_features_resolve_syntactic_ambiguity",
"reitman|autonote:_a_personal_information_storage_and_retrieval_system"
],
"title": [
"How features resolve syntactic ambiguity",
"AUTONOTE: A personal information storage and retrieval system"
],
"abstract": [
"Am... | null | 593 | 0 | null | null | null | null | null | null | null | null |
382275589b87306e54e8f94c1357911282026005 | 219306857 | null | Review: \textit{ {W}ord {O}rder and {W}ord {O}rder {C}hange}, by {C}harles {N}. {L}i, Editor | r sign language, languages o f the Niger-Congo group, Chinese, Indo-European, drift, d i s c o u r s e grammar, rnetatheory, the e v a l u a t i o n me-tric, and, of c o u r s e , language typology. Obviously, t h e i r common purpose i s t o move t o w a r d a c l e a r e r exp l a n a t i o n o f the causal relations... | {
"name": [
"Dunn, James M."
],
"affiliation": [
null
]
} | null | null | null | 1975-09-01 | 0 | 0 | null | null | null | null | But many o f the papers actually share more than t h e commom denomi n a t o r of interest i n here may be instances when the preposed formis found] i n which t h e r e i s nothing t o show that it was ever otherwise* (38).The autherb proceeds n e x t t o considering . the factors i n - v o l v' S e r i a l . verbs and... | null | Main paper:
:
But many o f the papers actually share more than t h e commom denomi n a t o r of interest i n here may be instances when the preposed formis found] i n which t h e r e i s nothing t o show that it was ever otherwise* (38).The autherb proceeds n e x t t o considering . the factors i n - v o l v' S e r... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 593 | 0 | null | null | null | null | null | null | null | null |
15593cbf354a496706f0cff0aabf55e74f411ea7 | 56548665 | null | {J}unction {G}rammar as a Base for Natural Language Processing | Melby, Alan. Forming and T e s t i n g S y n t a c t i c Transfers. Brigham Young University, M.A. Thesis, 1974. L y t l e , Eldon Brigham 1973. | {
"name": [
"Lytel, Eldon G. and",
"Packard, Dennis and",
"Gibb, Daryl and",
"Melby, Alan K. and",
"Billings, Jr., Floyd H."
],
"affiliation": [
null,
null,
null,
null,
null
]
} | null | null | null | 1975-09-01 | 8 | 5 | null | null | null | null | Dennis Packard Assuming t h a t s e m a n t i c s must be t a k e n i n t o a c c o u n t i n a t r a n s - Given t h e E n g l i s h s u r f a c e s t r i n g , "He needs i t " , E n g l i s h a n a l y s i s would produce t h e j u n c t i o n t r e e : Consider t h e following sentence :(1) Every monkey t h a t swal... | null | Main paper:
introduction t o junction grammar--by e l d o n lytle:
Dennis Packard Assuming t h a t s e m a n t i c s must be t a k e n i n t o a c c o u n t i n a t r a n s - Given t h e E n g l i s h s u r f a c e s t r i n g , "He needs i t " , E n g l i s h a n a l y s i s would produce t h e j u n c t i o n t r... | null | null | null | null | {
"paperhash": [
"lytle|a_grammar_of_subordinate_structures_in_english"
],
"title": [
"A Grammar of Subordinate Structures in English"
],
"abstract": [
"SENTENTIAL CONSTITUENTS That a sentence may function as an NP is evidenced by abstract sentential subjects and objects. Such constituents are NP'... | null | 593 | 0.008432 | null | null | null | null | null | null | null | null |
461ee4c15a9e69fe0bb7ebb32808d861840f5d58 | 219306561 | null | The {SQAP} Data Base for Natural Language Information | The Swedish Question Answering Pro j ect (SQAP) aims at handli~g many digferent kinds of facts, and nat only facts in a small dpecial application area. The SQAP data base consists of a network of nodes correspdnding to objects, properties, and events in the real.world. Deduction can be performed, and deduction rules ca... | {
"name": [
"Palme, Jacob"
],
"affiliation": [
null
]
} | null | null | null | 1975-09-01 | 0 | 3 | null | This paper describes t h e n a t u r a l language d a t a base s t r u c t u r e used i n t h e SQ,AP system we dish Question Answering system).Much o f t h a t system i s already working, but t h e paper does not only describe t h e s o l u t i o n s t o solved problems. D i f f i c u l t i e s and unsolved problems a... | Sometimes t h e deduction requires a p a t t e r n o f more than one node, Such patterns a r e c a For this merging we create temporary variables and keys during input translation. The sentence "The m a n always with the gun is in the forestw is thus t r a n s l a t e d i n t o figure 9: nThe man | null | Noun phrases i n natural language u s u a l l y r e f e r t o one o r a s e t o f objects i n t h e r e a l world, l i k e f~Stockholmll o r " h r e r y house lin Swedent1 o r "The nice m a n with a bicycle1v. In our system each such concept i s represented by a node i n t h e d a t a b a s e , which could be c a l l e... | The gener@ rule i s t h a t when two conjuncted nouns have been t r a n s l a t e d i n t o a composite o b j e c t , then i t ))The hurnldit~ on rajny daysin the tropics is high))COME-P PARENT-P 3 STUDENT-P PRED rparents of)) ))the three students)) (VARIABLE) | Main paper:
introduction:
This paper describes t h e n a t u r a l language d a t a base s t r u c t u r e used i n t h e SQ,AP system we dish Question Answering system).Much o f t h a t system i s already working, but t h e paper does not only describe t h e s o l u t i o n s t o solved problems. D i f f i c u l t... | null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 593 | 0.005059 | null | null | null | null | null | null | null | null |
13ec1418261019b4ad77996b9d247262a028f9b5 | 219302977 | null | Natural Language as a Special Case of Programming Languages | I o f f e r a tentative answer t o a quesCion poaed by Leo $poetel: 'what t y p e of automata would produce and use structures such 88 natural languages rpossess3 ' ? loam ChowIcy hae pointed o u t that natural languages share certain common structural caaracteriatics, and he argues t h a t these 1ing~ierkl.c universal... | {
"name": [
"Sampson, Geoffrey"
],
"affiliation": [
null
]
} | null | null | null | 1975-09-01 | 2 | 0 | null | about the ~sychological machinery involved in the comprehension of natnrgl language, based on comparihg the structure of natural language with that of actual computer programming langu-3 ages in practical use.ently. By comparison with Winograd I am less interested in the practical problems of cormaunicating with an aut... | null | null | null | null | Main paper:
.:
It may seem.contradictory to say that a real d i g i t a l computer, which will have only f i n i t e l y many s t a t e s and possi b l e programs, can be made t o simulate an automaton such as which has i n f i n i t e l y m a n y s t a t e s and programs. And, of oouree, in practice the simulation... | null | null | null | null | {
"paperhash": [
"fillmore|verbs_of_judging:_an_exercise_in_semantic_description"
],
"title": [
"Verbs of judging: An exercise in semantic description"
],
"abstract": [
"(1969). Verbs of judging: An exercise in semantic description. Paper in Linguistics: Vol. 1, No. 1, pp. 91-117."
],
"authors... | null | 593 | 0 | null | null | null | null | null | null | null | null |
02219d7b599b738e3659e22fe499e619934bea0b | 64541562 | null | Speech Generation from Semantic Nets | 8atur.l languag8 o u t p u t can b* generatrd fram remantic nets by ptoc*rsing ternplats8 asroeiated with concept# in the n e t r A # q t a t verb teaplater i s belng derived from a Study of t h e surfrc9 syntax o f ran@ 3000 Englirh Verb88 f h e actlve forms of t h e verb$ have been t Z ~r r i f l s d rtcorb&n$ t o su... | {
"name": [
"Slocum, Jonathan"
],
"affiliation": [
null
]
} | null | null | null | 1975-11-01 | 0 | 5 | null | null | t h e y nust spark, or a t irart w r i t e , t h e urcr*r nrtur61 Language, mafor @rgumentr. F t r~t t h e l u b j r e t auat b e p a n e r r f a d ro | null | null | null | Main paper:
it computer6 r t r t o canmonicrtr e f t r e t l v c l y with p e o p l e ,:
t h e y nust spark, or a t irart w r i t e , t h e urcr*r nrtur61 Language, mafor @rgumentr. F t r~t t h e l u b j r e t auat b e p a n e r r f a d ro
Appendix:
| null | null | null | null | {
"paperhash": [],
"title": [],
"abstract": [],
"authors": [],
"arxiv_id": [],
"s2_corpus_id": [],
"intents": [],
"isInfluential": []
} | null | 591 | 0.00846 | null | null | null | null | null | null | null | null |
96661895ad291325ce8bd651e46bced265d78d89 | 219304841 | null | Contextual Reference Resolution | With the exception of pranomial reference, little, has been written (in the field of computational linguistics) about the phenomenon of reference i n natural language. This paper investigates the power and use of reference in natural language. and the problems involved in its resolution. An algorithm is sketched for ac... | {
"name": [
"Klappholz, David and",
"Lockman, Abe"
],
"affiliation": [
null,
null
]
} | null | null | null | 1975-11-01 | 3 | 13 | null | The reference resolution problem The present work began as an attempt to develop a set of algorithms and/or heurietics to enable a primitive-based, inferencedriven model of a natural language user (Schank 1972 Rieger 1974 to properly resolve pronomial references acmee eentence bmndaries. The authors quickly realized, h... | null | null | null | null | Main paper:
:
The reference resolution problem The present work began as an attempt to develop a set of algorithms and/or heurietics to enable a primitive-based, inferencedriven model of a natural language user (Schank 1972 Rieger 1974 to properly resolve pronomial references acmee eentence bmndaries. The authors q... | null | null | null | null | {
"paperhash": [
"rieger|conceptual_memory:_a_theory_and_computer_program_for_processing_the_meaning_content_of_natural_langu"
],
"title": [
"Conceptual memory: a theory and computer program for processing the meaning content of natural langu"
],
"abstract": [
"Abstract : Humans perform vast quant... | null | 591 | 0.021997 | null | null | null | null | null | null | null | null |
e60284e4331d89ebf669d2d6a5cc53b77037612f | 219304927 | null | {PHLIQA} 1: Multilevel Semantics in Question Answering | This paper outlinee a recently implemented que~tion answering system , called PHLIQA 1 , which answers English questions about a data base . Unlike other existing aysteme , that directly tramlate a syntactic deep structure into a program to be executed, PHLIQA 1 leads a question through several intermediate etages of s... | {
"name": [
"Medema, P. and",
"Bronnenberg, W. J. and",
"Bunt, H. C. and",
"Landsbergen, S. P. J. and",
"Scha, R. J. H. and",
"Schoenmakers, W. J. and",
"van Utteren, E. P. C."
],
"affiliation": [
null,
null,
null,
null,
null,
null,
null
]
} | null | null | null | 1975-11-01 | 3 | 8 | null | PHLIQA 1 is an experimental ~y e t e m for answering isolated English questions about a data base . We have singled this out as the central problem of queation anawerlng , and therefore postponed the treatment of declaratives and imperrt tives , as well aa the analyak of discourse untll a later vereion of the system .T... | The value of a Data Base Language expression is completely defined by the sernaxltic rules of the Data Base Language ( see section 3 . 2 . ) , and one could cohceive of an algorithm that corresponds exactly to these rules . For reasons of efficiency, the actual algorithm differs from such an qlgorithm in some major res... | null | null | null | Main paper:
introduction:
PHLIQA 1 is an experimental ~y e t e m for answering isolated English questions about a data base . We have singled this out as the central problem of queation anawerlng , and therefore postponed the treatment of declaratives and imperrt tives , as well aa the analyak of discourse untll a ... | null | null | null | null | {
"paperhash": [
"madama|a_control_structure_for_a_question-answering_system"
],
"title": [
"A Control Structure For A Question-Answering System"
],
"abstract": [
"The c o n t r o l s t r u c t u r e o f a q u e s t i o n a n s w e r i n g s y s t e m i s d e r i v e d f r o m a s e t o f b a s i ... | null | 591 | 0.013536 | null | null | null | null | null | null | null | null |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.