polygraf-ai/ACL-abstracts · Datasets at Hugging Face

inproceedings

mitamura-etal-1991-efficient

An Efficient Interlingua Translation System for Multi-lingual Document Production

null

jul # " 1-4"

1991

Washington DC, USA

null

https://aclanthology.org/1991.mtsummit-papers.9/

Mitamura, Teruko and Nyberg, Eric H. and Carbonell, Jaime G.

Proceedings of Machine Translation Summit III: Papers

55--61

Knowledge-based interlingual machine translation systems produce semantically accurate translations, but typically require massive knowledge acquisition. This paper describes KANT, a system that reduces this requirement to produce practical, scalable, and accurate KBMT applications. First, the set of requirements is discussed, then the full KANT architecture is illustrated, and finally results from a fully implemented prototype are presented.

null

101,877

inproceedings

okumura-etal-1991-multi

Multi-lingual Sentence Generation from the {PIVOT} interlingua

null

jul # " 1-4"

1991

Washington DC, USA

null

https://aclanthology.org/1991.mtsummit-papers.11/

Okumura, Akitoshi and Muraki, Kazunori and Akamine, Susumu

Proceedings of Machine Translation Summit III: Papers

63--65

We wrote this report in Japanese and translated it by NEC`s machine translation system PIVOT/JE.) IBS (International Business Service) is the company which does the documentation service which contains translation business. We introduced a machine translation system into translation business in earnest last year. The introduction of a machine translation system changed the form of our translation work. The translation work was divided into some steps and the person who isn`t experienced became able to take it of the work of each of translation steps. As a result, a total translation cost reduced. In this paper, first, we report on the usage of our machine translation system. Next, we report on translation quality and the translation cost with a machine translation system. Lastly, we report on the merit which was gotten by introducing machine translation.

null

101,879

inproceedings

hirakawa-etal-1991-ej

{EJ}/{JE} Machine Translation System {ASTRANSAC} {---} Extensions toward Personalization

null

jul # " 1-4"

1991

Washington DC, USA

null

https://aclanthology.org/1991.mtsummit-papers.12/

Hirakawa, Hideki and Nogami, Hiroyasu and Amano, Shin-ya

Proceedings of Machine Translation Summit III: Papers

73--80

The demand for personal use of a translation system seems to be increasing in accordance with the improvement in MT quality. A recent portable and powerful engineering workstation, such as AS1000 (SPARC LT), enables us to develop a personal-use oriented MT system This paper describes the outline of ASTRANSAC (an English-Japanese/Japanese- English bi-directional MT system) and the extensions related to the personalization of ASTRANSAC, which have been newly made since the MT Summit II.

null

101,880

inproceedings

kugler-etal-1991-translators

The Translator`s Workbench: An Environment for Multi-Lingual Text Processing and Translation

null

jul # " 1-4"

1991

Washington DC, USA

null

https://aclanthology.org/1991.mtsummit-papers.13/

Kugler, Marianne and Heyer, Gerd and Kese, Ralf and von Kleist-Retzow, Beate and Winkelmann, G{\"unter

Proceedings of Machine Translation Summit III: Papers

81--83

The Translator`s Workbench provides the user with a set of computer-based tools for speeding up the translation process and facilitate multilingual text processing and technical writing. The tools include dictionaries, spelling, gram- mar, punctuation and style checkers, text pro- cessing utilities, remote access to a fully auto- matic machine translation system and to termi- nological data bases, an on-line termbank, and a translation memory in an integrated framework covering several European languages.

null

101,881

inproceedings

jin-1991-translation

Translation Accuracy and Translation Efficiency

null

jul # " 1-4"

1991

Washington DC, USA

null

https://aclanthology.org/1991.mtsummit-papers.14/

Jin, Wanying

Proceedings of Machine Translation Summit III: Papers

85--92

ULTRA (Universal Language Translator) is a multi-lingua] bidirectional translation system between English, Spanish, German, Japanese and Chinese. It employs an interlingua] structure to translate among these five languages. An interlingual representation is used as a deep structure through which any pair of these languages can be translated in either direction. This paper describes some techniques used in the Chinese system to solve problems in word ordering, language equivalency, Chinese verb constituent and prepositional phrase attachment. By means of these techniques translation quality has been significantly improved. Heuristic search, which results in translation efficiency, is also discussed.

null

101,882

inproceedings

kitano-etal-1991-toward

Toward High Performance Machine Translation: Preliminary Results from Massively Parallel Memory-Based Translation on {SNAP}

null

jul # " 1-4"

1991

Washington DC, USA

null

https://aclanthology.org/1991.mtsummit-papers.15/

Kitano, Hiroaki and Moldovan, Dan and Cha, Seungho

Proceedings of Machine Translation Summit III: Papers

93--100

This paper describes a memory-based machine translation system developed for the Semantic Net- work Array Processor (SNAP). The goal of our work is to develop a scalable and high-performance memory-based machine translation system which utilizes the high degree of parallelism provided by the SNAP machine. We have implemented an experimental machine translation system DMSNAP as a central part of a real-time speech-to-speech dia- logue translation system. It is a SNAP version of the {\ensuremath{\Phi}}DMDIALOG speech-to-speech translation system. Memory-based natural language processing and syntactic constraint network model has been incorporated using parallel marker-passing which is directly supported from hardware level. Experimental results demonstrate that the parsing of a sentence is done in the order of milliseconds.

null

101,883

inproceedings

ikehara-etal-1991-toward

Toward an {MT} System without Pre-Editing: Effects of a New Method in {ALT}-{J}/{E}

null

jul # " 1-4"

1991

Washington DC, USA

null

https://aclanthology.org/1991.mtsummit-papers.16/

Ikehara, Satoru and Shirai, Satoshi and Yokoo, Akio and Nakaiwa, Hiromi

Proceedings of Machine Translation Summit III: Papers

101--106

Recently, several types of Japanese to English MT (machine translation) systems have been developed, but prior to using such systems, they have required a pre-editing process of re-writing the original text into Japanese that could be easily translated. For communication of translated information requiring speed in dissemination, application of these systems would necessarily pose problems. To overcome such problems, a Multi-Level Translation Method based on Constructive Process Theory had been proposed. In this paper, the benefits of this method in ALT-J/E will be described. In comparison with the conventional elementary composition method, the Multi-Level Translation Method, emphasizing the importance of the meaning contained in expression structures, has been ascertained to be capable of conducting translation according to meaning and context processing with comparative ease. We are now hopeful of realizing machine translation omitting the process of pre-editing.

null

101,884

inproceedings

jappinen-etal-1991-kielikone

{KIELIKONE} Machine Translation Workstation

null

jul # " 1-4"

1991

Washington DC, USA

null

https://aclanthology.org/1991.mtsummit-papers.17/

J{\"appinen, Harri and Kulikov, L. and Yl{\"a-Rotiala, A.

Proceedings of Machine Translation Summit III: Papers

107--111

All human languages are open and complex communication systems. No machine translation system will ever be able to automatically translate all possible sentences from one language to another in high quality. One way to combat complexity and openness of language translation is to decompose the task into well-defined sequential subtasks and solve each using declarative, modular rules. This paper describes such an MT system. A language-independent MT Machine has been designed for the transformation of linguistic trees in a general fashion. A full MT system is composed of a sequence of instances of that machine. Finnish-English implementation is discussed.

null

101,885

inproceedings

jain-etal-1991-connectionist

Connectionist and Symbolic Processing in Speech-to-Speech Translation: The {JANUS} System

null

jul # " 1-4"

1991

Washington DC, USA

null

https://aclanthology.org/1991.mtsummit-papers.18/

Jain, A. N. and McNair, A. E. and Waibel, A. and Saito, H. and Hauptmann, A.G. and Tebelskis, J.

Proceedings of Machine Translation Summit III: Papers

113--117

We present JANUS, a speech-to-speech translation system that utilizes diverse processing strategies including connectionist learning, traditional AI knowledge representation approaches, dynamic programming, and stochastic techniques. JANUS translates continuously spoken English utterances into Japanese and German speech utterances. The overall system performance on a corpus of conference registration conversations is 87{\%}. Two versions of JANUS are compared: one using an LR parser (JANUS-LR) and one using a neural-network based parser (JANUS-NN). Performance results are mixed, with JANUS-LR deriving benefit from a tighter language model and JANUS-NN benefiting from greater flexibility.

null

101,886

inproceedings

hasida-tsuda-1991-parsing

Parsing without Parser

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.2/

Hasida, Ko{\^i}ti and Tsuda, Hiroshi

Proceedings of the Second International Workshop on Parsing Technologies

1--10

In the domain of artificial intelligence, the pattern of information flow varies drastically from one context to another. To capture this diversity of information flow, a natural-language processing (NLP) system should consist of modules of constraints and one general constraint solver to process all of them; there should be no specialized procedure module such as a parser and a generator. This paper presents how to implement such a constraint-based approach to NLP. Dependency Propagation (DP) is a constraint solver which transforms the program (=constraint) represented in terms of logic programs. Constraint Unification (CU) is a unification method incorporating DP. cu-Prolog is an extended Prolog which employs CU instead of the standard unification. cu-Prolog can treat some lexical and grammatical knowledge as constraints on the structure of grammatical categories, enabling a very straightforward implementation of a parser using constraint-based grammars. By extending DP, one can deal efficiently with phrase structures in terms of constraints. Computation on category structures and phrase structures are naturally integrated in an extended DP. The computation strategies to do all this are totally attributed to a very abstract, task-independent principle: prefer computation using denser information. Efficient parsing is hence possible without any parser.

null

101,893

inproceedings

dasigi-1991-parsing

Parsing = Parsimonious Covering?

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.3/

Dasigi, Venu

Proceedings of the Second International Workshop on Parsing Technologies

11--20

Many researchers believe that certain aspects of natural language processing, such as word sense disambiguation and plan recognition in stories, constitute abductive inferences. We have been working with a specific model of abduction, called \textit{parsimonious covering}, applied in diagnostic problem solving, word sense disambiguation and logical form generation in some restricted settings. Diagnostic parsimonious covering has been extended into a dual-route model to account for syntactic and semantic aspects of natural language. The two routes of covering are integrated by defining {\textquotedblleft}open class{\textquotedblright} linguistic concepts, aiding each other. The diagnostic model has dealt with sets, while the extended version, where syntactic considerations dictate word order, deals with sequences of linguistic concepts. Here we briefly describe the original model and the extended version, and briefly characterize the notions of covering and different criteria of parsimony. Finally we examine the question of whether parsimonious covering can serve as a general framework for parsing.

null

101,894

inproceedings

schabes-1991-valid

The Valid Prefix Property and Left to Right Parsing of {T}ree-{A}djoining {G}rammar

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.4/

Schabes, Yves

Proceedings of the Second International Workshop on Parsing Technologies

21--30

The valid prefix property (VPP), the capability of a left to right parser to detect errors as soon as possible, often goes unnoticed in parsing CFGs. Earley`s parser for CFGs (Earley, 1968; Earley, 1970) maintains the valid prefix property and obtains an $O(n^3)$-time worst case complexity, as good as parsers that do not maintain such as the CKY parser (Younger, 1967; Kasami, 1965). Contrary to CFGs, maintaining the valid prefix property for TAGs is costly. In 1988, Schabes and Joshi proposed an Earley-type parser for TAGs. It maintains the valid prefix property at the expense of its worst case complexity ($O(n^9)$-time). To our knowledge, it is the only known polynomial time parser for TAGs that maintains the valid prefix property. In this paper, we explain why the valid prefix property is expensive to maintain for TAGs and we introduce a predictive left to right parser for TAGs that does not maintain the valid prefix property but that achieves an $O(n^6)$-time worst case behavior, $O(n^4)$-time for unambiguous grammars and linear time for a large class of grammars.

null

101,895

inproceedings

futrelle-etal-1991-preprocessing

Preprocessing and lexicon design for parsing technical text

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.5/

Futrelle, Robert P. and Dunn, Christopher E. and Ellis, Debra S. and Pescitelli, Jr., Maurice J.

Proceedings of the Second International Workshop on Parsing Technologies

31--40

Technical documents with complex structures and orthography present special difficulties for current parsing technology. These include technical notation such as subscripts, superscripts and numeric and algebraic expressions as well as Greek letters, italics, small capitals, brackets and punctuation marks. Structural elements such as references to figures, tables and bibliographic items also cause problems. We first hand-code documents in Standard Generalized Markup Language (SGML) to specify the document`s logical structure (paragraphs, sentences, etc.) and capture significant orthography. Next, a regular expression analyzer produced by LEX is used to tokenize the SGML text. Then a token-based phrasal lexicon is used to identify the longest token sequences in the input that represent single lexical items. This lookup is efficient because limits on lookahead are precomputed for every item. After this, the Alvey Tools parser with specialized subgrammars is used to discover items such as floating-point numbers. The product of these preprocessing stages is a text that is acceptable to a full natural language parser. This work is directed towards automating the building of knowledge bases from research articles in the field of bacterial chemotaxis, but the techniques should be of wide applicability.

null

101,896

inproceedings

shilling-1991-incremental

Incremental {LL}(1) Parsing in Language-Based Editors

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.6/

Shilling, John J.

Proceedings of the Second International Workshop on Parsing Technologies

41--51

This paper introduces an efficient incremental LL(1) parsing algorithm for use in language-based editors that use the structure recognition approach. It features very fine grained analysis and a unique approach to parse control and error recovery. It also presents incomplete LL(1) grammars as a way of dealing with the complexity of full language grammars and as a mechanism for providing structured editor support for task languages that are only partially structured. The semantics of incomplete grammars are presented and it is shown how incomplete LL(1) grammars can be transformed into complete LL(1) grammars. The algorithms presented have been implemented in the fred language-based editor

null

101,897

inproceedings

apollonskaya-etal-1991-linguistic

Linguistic Information in the Databases as a Basis for Linguistic Parsing Algorithms

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.7/

Apollonskaya, Tatiana A. and Beliaeva, Larissa N. and Piotrowski, Raimund G.

Proceedings of the Second International Workshop on Parsing Technologies

52--58

The focus of this paper is investigation of linguistic data base design in conjugation with parsing algorithms. The structure of linguistic data base in natural language processing systems, the structure of lexicon items and the structure and the volume of linguistic information in automatic dictionary is the base for linguistic parsing organization.

null

101,898

inproceedings

delmonte-bianchi-1991-binding

Binding Pronominals with an {LFG} Parser

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.8/

Delmonte, Radolfo and Bianchi, Dario

Proceedings of the Second International Workshop on Parsing Technologies

59--72

This paper describes an implemented algorithm for handling pronominal reference and anaphoric control within an LFG framework. At first there is a brief description of the grammar implemented in Prolog using XGs (extraposition grammars) introduced by Pereira (1981;1983). Then the algorithm mapping binding equations is discussed at length. In particular the algorithm makes use of f-command together with the obviation principle, rather than c-command which is shown to be insufficient to explain the facts of binding of both English and Italian. Previous work (Ingria,1989;Hobbs,1978) was based on English and the classes of pronominals to account for were two: personal and possessive pronouns and anaphors - reflexives and reciprocals. In Italian, and in other languages of the world, the classes are many more. We dealt with four: a.pronouns - personal and independent pronouns, epithets, possessive pronouns; b.clitic pronouns and Morphologically Unexpressed PRO/pros; c.long distance anaphors; short distance anaphors. Binding of anaphors and coreference of pronouns is extensively shown to depend on structural properties of f-structures, on thematic roles and grammatical functions associated with the antecedents or controller, on definiteness of NPs and mood of clausal f-structures. The algorithm uses feature matrixes to tell pronominal classes apart and scores to determine the ranking of candidates for antecedenthood, as well as for restricting the behaviour of proforms and anaphors.

null

101,899

inproceedings

vosse-kempen-1991-hybrid

A Hybrid Model of Human Sentence Processing: Parsing Right-Branching, Center-Embedded and Cross-Serial Dependencies

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.9/

Vosse, Theo and Kempen, Gerard

Proceedings of the Second International Workshop on Parsing Technologies

73--78

A new cognitive architecture for the syntactic aspects of human sentence processing (called Unification Space) is tested against experimental data from human subjects. The data, originally collected by Bach, Brown and Marslen-Wilson (1986), concern the comprehensibility of verb dependency constructions in Dutch and German: right-branching, center-embedded, and cross-serial dependencies of one to four levels deep. A satisfactory fit is obtained between comprehensibility data and parsability scores in the model.

null

101,900

inproceedings

habert-1991-using

Using Inheritance in {O}bject-{O}riented {P}rogramming to Combine Syntactic Rules and Lexical Idiosyncrasies

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.10/

Habert, Beno{\^i}t

Proceedings of the Second International Workshop on Parsing Technologies

79--88

In parsing idioms and frozen expressions in French, one needs to combine general syntactic rules and idiosyncratic constraints. The inheritance structure provided by Object-Oriented Programming languages, and more specifically the combination of methods present in CLOS, Common Lisp Object System, appears as an elegant and efficient approach to deal with such a complex interaction.

null

101,901

inproceedings

wright-etal-1991-adaptive

Adaptive Probabilistic Generalized {LR} Parsing

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.12/

Wright, Jerry and Wrigley, Ave and Sharman, Richard

Proceedings of the Second International Workshop on Parsing Technologies

100--109

Various issues in the implementation of generalized LR parsing with probability are discussed. A method for preventing the generation of infinite numbers of states is described and the space requirements of the parsing tables are assessed for a substantial natural-language grammar. Because of a high degree of ambiguity in the grammar, there are many multiple entries and the tables are rather large. A new method for grammar adaptation is introduced which may help to reduce this problem. A probabilistic version of the Tomita parse forest is also described.

null

101,903

inproceedings

maxwell-1991-phonological

Phonological Analysis and Opaque Rule Orders

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.13/

Maxwell, Michael

Proceedings of the Second International Workshop on Parsing Technologies

110--116

General morphological/phonological analysis using ordered phonological rules has appeared to be computationally expensive, because ambiguities in feature values arising when phonological rules are {\textquotedblleft}un-applied{\textquotedblright} multiply with additional rules. But in fact those ambiguities can be largely ignored until lexical lookup, since the underlying values of altered features are needed only in the case of rare opaque rule orderings, and not always then.

null

101,904

inproceedings

sikkel-nijholt-1991-efficient

An Efficient Connectionist Context-Free Parser

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.14/

Sikkel, Klaas and Nijholt, Anton

Proceedings of the Second International Workshop on Parsing Technologies

117--126

A connectionist network is defined that parses a grammar in Chomsky Normal Form in logarithmic time, based on a modification of Rytter`s recognition algorithm. A similar parsing network can be defined for an arbitrary context-free grammar. Such networks can be integrated into a connectionist parsing environment for interactive distributed processing of syntactic, semantic and pragmatic information.

null

101,905

inproceedings

de-vreught-honig-1991-slow

Slow and Fast Parallel Recognition

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.15/

de Vreught, Hans and Honig, Job

Proceedings of the Second International Workshop on Parsing Technologies

127--135

In the first part of this paper a slow parallel recognizer is described for general CFG`s. The recognizer runs in $\Theta(n^3/p(n))$ time with $p(n) = O(n^2)$ processors. It generalizes the items of the Earley algorithm to double dotted items, which are more suited to parallel parsing. In the second part a fast parallel recognizer is given for general CFG`s. The recognizer runs in $O(log n)$ time using $O(n^6)$ processors. It is a generalisation of the Gibbons and Rytter algorithm for grammars in CNF.

null

101,906

inproceedings

kita-etal-1991-processing

Processing Unknown Words in Continuous Speech Recognition

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.16/

Kita, Kenji and Ehara, Terumasa and Morimoto, Tsuyoshi

Proceedings of the Second International Workshop on Parsing Technologies

136--142

Current continuous speech recognition systems essentially ignore unknown words. Systems are designed to recognize words in the lexicon. However, for using speech recognition systems in real applications of spoken-language processing, it is very important to process unknown words. This paper proposes a continuous speech recognition method which accepts any utterance that might include unknown words. In this method, words not in the lexicon are transcribed as phone sequences, while words in the lexicon are recognized correctly. The HMM-LR speech recognition system, which is an integration of Hidden Markov Models and generalized LR parsing, is used as the baseline system, and enhanced with the trigram model of syllables to take into account the stochastic characteristics of a language. Preliminary results indicate that our approach is very promising.

null

101,907

inproceedings

carpenter-etal-1991-specification

The Specification and Implementation of Constraint-Based Unification Grammars

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.17/

Carpenter, Robert and Pollard, Carl and Franz, Alex

Proceedings of the Second International Workshop on Parsing Technologies

143--153

Our aim is to motivate and provide a specification for a unification-based natural language processing system where grammars are expressed in terms of principles which constrain linguistic representations. Using typed feature structures with multiple inheritance for our linguistic representations and definite attribute-value logic clauses to express constraints, we will develop the bare essentials required for an implementation of a parser and generator for the Head-driven Phrase Structure Grammar (HPSG) formalism of Pollard and Sag (1987).

null

101,908

inproceedings

ng-tomita-1991-probabilistic

Probabilistic {LR} Parsing for General Context-Free Grammars

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.18/

Ng, See-Kiong and Tomita, Masaru

Proceedings of the Second International Workshop on Parsing Technologies

154--163

To combine the advantages of probabilistic grammars and generalized LR parsing, an algorithm for constructing a probabilistic LR parser given a probabilistic context-free grammar is needed. In this paper, implementation issues in adapting Tomita`s generalized LR parser with graph-structured stack to perform probabilistic parsing are discussed. Wright and Wrigley (1989) has proposed a probabilistic LR-table construction algorithm for non-left-recursive context-free grammars. To account for left recursions, a method for computing item probabilities using the generation of systems of linear equations is presented. The notion of deferred probabilities is proposed as a means for dealing with similar item sets with differing probability assignments.

null

101,909

inproceedings

tomabechi-1991-quasi

Quasi-Destructive Graph Unification

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.19/

Tomabechi, Hideto

Proceedings of the Second International Workshop on Parsing Technologies

164--171

Graph unification is the most expensive part of unification-based grammar parsing. It often takes over 90{\%} of the total parsing time of a sentence. We focus on two speed-up elements in the design of unification algorithms: 1) elimination of excessive copying by only copying successful unifications, 2) Finding unification failures as soon as possible. We have developed a scheme to attain these two criteria without expensive overhead through temporarily modifying graphs during unification to eliminate copying during unification. The temporary modification is invalidated in constant time and therefore, unification can continue looking for a failure without the overhead associated with copying. After a successful unification because the nodes are temporarily prepared for copying, a fast copying can be performed without overhead for handling reentrancy, loops and variables. We found that parsing relatively long sentences (requiring about 500 unifications during a parse) using our algorithm is 100 to 200 percent faster than parsing the same sentences using Wroblewski`s algorithm.

null

101,910

inproceedings

kitano-1991-unification

Unification Algorithms for Massively Parallel Computers

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.20/

Kitano, Hiroaki

Proceedings of the Second International Workshop on Parsing Technologies

172--181

This paper describes unification algorithms for fine-grained massively parallel computers. The algorithms are based on a parallel marker-passing scheme. The marker-passing scheme in our algorithms carry only bit-vectors, address pointers and values. Because of their simplicity, our algorithms can be implemented on various architectures of massively parallel machines without loosing the inherent benefits of parallel computation. Also, we describe two augmentations of unification algorithms such as multiple unification and fuzzy unification. Experimental results indicate that our algorithm attaines more than 500 unification per seconds (for DAGs of average depth of 4) and has a linear time-complexity. This leads to possible implementations of massively parallel natural language parsing with full linguistic analysis.

null

101,911

inproceedings

kwon-yoon-1991-unification

Unification-Based Dependency Parsing of Governor-Final Languages

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.21/

Kwon, Hyuk-Chul and Yoon, Aesun

Proceedings of the Second International Workshop on Parsing Technologies

182--192

This paper describes a unification-based dependency parsing method for governor-final languages. Our method can parse not only projective sentences but also non-projective sentences. The feature structures in the tradition of the unification-based formalism are used for writing dependency relations. We use a structure sharing and a local ambiguity packing to save storage.

null

101,912

inproceedings

magerman-marcus-1991-pearl

{P}earl: A Probabilistic Chart Parser

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.22/

Magerman, David M. and Marcus, Mitchell P.

Proceedings of the Second International Workshop on Parsing Technologies

193--199

This paper describes a natural language parsing algorithm for unrestricted text which uses a probability-based scoring function to select the {\textquotedblleft}best{\textquotedblright} parse of a sentence. The parser, Pearl, is a time-asynchronous bottom-up chart parser with Earley-type top-down prediction which pursues the highest-scoring theory in the chart, where the score of a theory represents the extent to which the context of the sentence predicts that interpretation. This parser differs from previous attempts at stochastic parsers in that it uses a richer form of conditional probabilities based on context to predict likelihood. Pearl also provides a framework for incorporating the results of previous work in part-of-speech assignment, unknown word models, and other probabilistic models of linguistic features into one parsing tool, interleaving these techniques instead of using the traditional pipeline architecture. In preliminary tests, Pearl has been successful at resolving part-of-speech and word (in speech processing) ambiguity, determining categories for unknown words, and selecting correct parses first using a very loosely fitting covering grammar.

null

101,913

inproceedings

herz-rimon-1991-local

Local Syntactic Constraints

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.23/

Herz, Jacky and Rimon, Mori

Proceedings of the Second International Workshop on Parsing Technologies

200--209

A method to reduce ambiguity at the level of word tagging, on the basis of local syntactic constraints, is described. Such {\textquotedblleft}short context{\textquotedblright} constraints are easy to process and can remove most of the ambiguity at that level, which is otherwise a source of great difficulty for parsers and other applications in certain natural languages. The use of local constraints is also very effective for quick invalidation of a large set of ill-formed inputs. While in some approaches local constraints are defined manually or discovered by processing of large corpora, we extract them directly from a grammar (typically context free) of the given language. We focus on deterministic constraints, but later extend the method for a probabilistic language model.

null

101,914

inproceedings

corazza-etal-1991-stochastic

Stochastic Context-Free Grammars for Island-Driven Probabilistic Parsing

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.24/

Corazza, Anna and De Mori, Renato and Gretter, Roberto and Satta, Giorgio

Proceedings of the Second International Workshop on Parsing Technologies

210--217

In automatic speech recognition the use of language models improves performance. Stochastic language models fit rather well the uncertainty created by the acoustic pattern matching. These models are used to score \textit{theories} corresponding to partial interpretations of sentences. Algorithms have been developed to compute probabilities for theories that grow in a strictly left-to-right fashion. In this paper we consider new relations to compute probabilities of partial interpretations of sentences. We introduce theories containing a gap corresponding to an uninterpreted signal segment. Algorithms can be easily obtained from these relations. Computational complexity of these algorithms is also derived.

null

101,915

inproceedings

rekers-koorn-1991-substring

Substring Parsing for Arbitrary Context-Free Grammars

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.25/

Rekers, Jan and Koorn, Wilco

Proceedings of the Second International Workshop on Parsing Technologies

218--224

A substring recognizer for a language $L$ determines whether a string $s$ is a substring of a sentence in $L$, i.e., \textit{substring-recognize(s)} succeeds if and only if $\exists v,w: vsw \in L$. The algorithm for substring recognition presented here accepts general context-free grammars and uses the same parse tables as the parsing algorithm from which it was derived. Substring recognition is useful for \textit{non-correcting} syntax error recovery and for incremental parsing. By extending the substring \textit{recognizer} with the ability to generate trees for the possible contextual completions of the substring, we obtain a substring \textit{parser}, which can be used in a syntax-directed editor to complete fragments of sentences.

null

101,916

inproceedings

wittenburg-1991-parsing

Parsing with Relational Unification Grammars

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.26/

Wittenburg, Kent

Proceedings of the Second International Workshop on Parsing Technologies

225--234

In this paper we present a unification-based grammar formalism and parsing algorithm for the purposes of defining and processing non-concatenative languages. In order to encompass languages that are characterized by relations beyond simple string concatenation, we introduce relational constraints into a linguistically-based unification grammar formalism and extend bottom-up chart parsing methods. This work is currently being applied in the interpretation of hand-sketched mathematical expressions and structured flowcharts on notebook computers and interactive worksurfaces.

null

101,917

inproceedings

costagliola-chang-1991-parsing

Parsing 2-{D} Languages with Positional Grammars

Tomita, Masaru and Kay, Martin and Berwick, Robert and Hajicova, Eva and Joshi, Aravind and Kaplan, Ronald and Nagao, Makoto and Wilks, Yorick

feb # " 13-25"

1991

Cancun, Mexico

Association for Computational Linguistics

https://aclanthology.org/1991.iwpt-1.27/

Costagliola, Gennaro and Chang, Shi-Kuo

Proceedings of the Second International Workshop on Parsing Technologies

235--243

In this paper we will present a way to parse two-dimensional languages using LR parsing tables. To do this we describe two-dimensional (positional) grammars as a generalization of the context-free string grammars. The main idea behind this is to allow a traditional LR parser to choose the next symbol to parse from a two-dimensional space. Cases of ambiguity are analyzed and some ways to avoid them are presented. Finally, we construct a parser for the two-dimensional arithmetic expression language and implement it by using the tool Yacc.

null

101,918

inproceedings

kasper-1989-unification

Unification and Classification: An Experiment in Information-Based Parsing

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0201/

Kasper, Robert T.

Proceedings of the First International Workshop on Parsing Technologies

1--7

When dealing with a phenomenon as vast and com plex as natural language, an experimental approach is often the best way to discover new computational methods and determine their usefulness. The experimental process includes designing and selecting new experiments, carrying out the experiments, and evaluating the experiments. Most conference presentations are about finished experiments, completed theoretical results, or the evaluation of systems already in use. In this workshop setting, I would like to depart from this tendency to discuss some experiments that we are beginning to perform, and the reasons for investigating a particular approach to parsing. This approach builds on recent work in unification-based parsing and classification-based knowledge representation, developing an architecture that brings together the capabilities of these related frameworks.

null

102,435

inproceedings

fong-berwick-1989-computational

The Computational Implementation of Principle-Based Parsers

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0208/

Fong, Sandiway and Berwick, Robert C.

Proceedings of the First International Workshop on Parsing Technologies

75--84

This paper addresses the issue of how to organize linguistic principles for efficient processing. Based on the general characterization of principles in terms of purely computational properties, the effects of principle-ordering on parser performance are investigated. A novel parser that exploits the possible variation in principle-ordering to dynamically re-order principles is described. Heuristics for minimizing the amount of unnecessary work performed during the parsing process are also discussed.

null

102,442

inproceedings

su-etal-1989-sequential

A Sequential Truncation Parsing Algorithm Based on the Score Function

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0210/

Su, Keh-Yih and Wang, Jong-Nae and Su, Mei-Hui and Chang, Jing-Shin

Proceedings of the First International Workshop on Parsing Technologies

95--104

In a natural language processing system, a large amount of ambiguity and a large branching factor are hindering factors in obtaining the desired analysis for a given sentence in a short time. In this paper, we are proposing a sequential truncation parsing algorithm to reduce the searching space and thus lowering the parsing time. The algorithm is based on a score function which takes the advantages of probabilistic characteristics of syntactic information in the sentences. A preliminary test on this algorithm was conducted with a special version of our machine translation system, the ARCHTRAN, and an encouraging result was observed.

null

102,444

inproceedings

wright-wrigley-1989-probabilistic

Probabilistic {LR} Parsing for Speech Recognition

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0211/

Wright, J. H. and Wrigley, E. N.

Proceedings of the First International Workshop on Parsing Technologies

105--114

An LR parser for probabilistic context-free grammars is described. Each of the standard versions of parser generator (SLR, canonical and LALR) may be applied. A graph-structured stack permits action conflicts and allows the parser to be used with uncertain input, typical of speech recognition applications. The sentence uncertainty is measured using entropy and is significantly lower for the grammar than for a first-order Markov model.

null

102,445

inproceedings

kita-etal-1989-parsing

Parsing Continuous Speech by {HMM}-{LR} Method

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0213/

Kita, Kenji and Kawabata, Takeshi and Saito, Hiroaki

Proceedings of the First International Workshop on Parsing Technologies

126--131

This paper describes a speech parsing method called HMM-LR. In HMM-LR, an LR parsing table is used to predict phones in speech input, and the system drives an HMM-based speech recognizer directly without any intervening structures such as a phone lattice. Very accurate, efficient speech parsing is achieved through the integrated processes of speech recognition and language analysis. The HMM-LR m ethod is applied to large-vocabulary speaker-dependent Japanese phrase recognition. The recognition rate is 87.1{\%} for the top candidates and 97.7{\%} for the five best candidates.

null

102,447

inproceedings

kogure-1989-parsing

Parsing {J}apanese Spoken Sentences Based on {HPSG}

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0214/

Kogure, Kiyoshi

Proceedings of the First International Workshop on Parsing Technologies

132--141

An analysis method for Japanese spoken sentences based on HPSG has been developed. Any analysis module for the interpreting telephony task requires the following capabilities: (i) the module must be able to treat spoken-style sentences; and, (ii) the module must be able to take, as its input, lattice-like structures which include both correct and incorrect constituent candidates of a speech recognition module. To satisfy these requirements, an analysis method has been developed, which consists of a grammar designed for treating spoken-style Japanese sentences and a parser designed for taking as its input speech recognition output lattices. The analysis module based on this method is used as part of the NADINE (Natural Dialogue Interpretation Expert) system and the SL-TRANS (Spoken Language Translation) system.

null

102,448

inproceedings

van-zuijlen-1989-probabilistic

Probabilistic Methods in Dependency Grammar Parsing

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0215/

van Zuijlen, Job M.

Proceedings of the First International Workshop on Parsing Technologies

142--151

Authentic text as found in corpora cannot be described completely by a formal system, such as a set of grammar rules. As robust parsing is a prerequisite for any practical natural language processing system, there is certainly a need for techniques that go beyond merely formal approaches. Various possibilities, such as the use of simulated annealing, have been proposed recently and we have looked at their suitability for the parse process of the DLT machine translation system, which will use a large structured bilingual corpus as its main linguistic knowledge source. Our findings are that parsing is not the type of task that should be tackled solely through simulated annealing or similar stochastic optimization techniques but that a controlled application of probabilistic methods is essential for the performance of a corpus-based parser. On the basis of our explorative research we have planned a number of small-scale implementations in the near future.

null

102,449

inproceedings

wall-wittenburg-1989-predictive

Predictive Normal Forms for Composition in Categorical Grammars

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0216/

Wall, Robert E. and Wittenburg, Kent

Proceedings of the First International Workshop on Parsing Technologies

152--161

Extensions to Categorial Grammars proposed to account for nonconstitutent conjunction and long-distance dependencies introduce the problem of equivalent derivations, an issue we have characterized as spurious ambiguity from the parsing perspective. In Wittenburg (1987) a proposal was made for compiling Categorial Grammars into predictive forms in order to solve the spurious ambiguity problem. This paper investigates formal properties o f grammars that use predictive versions of function composition. Among our results are (1) that grammars with predictive composition are in general equivalent to the originals if and only if a restriction on predictive rules is applied, (2) that modulo this restriction, the predictive grammars have indeed eliminated the problem of spurious ambiguity, and (3) that the issue o f equivalence is decidable, i.e., for any particular grammar, whether one needs to apply the restriction or not to ensure equivalence is a decidable question.

null

102,450

inproceedings

kipps-1989-analysis

Analysis of Tomita`s Algorithm for General Context-Free Parsing

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0220/

Kipps, James R.

Proceedings of the First International Workshop on Parsing Technologies

193--202

A variation on Tomita`s algorithm is analyzed in regards to its time and space complexity. It is shown to have a general time bound of $0(n^{\tilde{\rho}+1})$, where $n$ is the length of the input string and $\rho$ is the length of the longest production. A modified algorithm is presented in which the time bound is reduced to $0(n^3)$. The space complexity of Tomita`s algorithm is shown to be proportional to $n^2$ in the worst case and is changed by at most a constant factor with the modification. Empirical results are used to illustrate the trade off between time and space on a simple example. A discussion of two subclasses of context-free grammars that can be recognized in $0(n^2)$ and $O(n)$ is also included.

null

102,454

inproceedings

seneff-1989-probabilistic

Probabilistic Parsing for Spoken Language Applications

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0222/

Seneff, Stephanie

Proceedings of the First International Workshop on Parsing Technologies

209--218

A new natural language system, TINA, has been developed for applications involving spoken language tasks, which integrate key ideas from context free grammars, Augmented Transition Networks (ATN`s) [6], and Lexical Functional Grammars (LFG`s) [1]. The parser uses a best-first strategy, with probability assignments on all arcs obtained automatically from a set of example sentences. An initial context-free grammar, derived from the example sentences, is first converted to a probabilistic network structure. Control includes both top-down and bottom-up cycles, and key parameters are passed among nodes to deal with long-distance movement, agreement, and semantic constraints. The probabilities provide a natural mechanism for exploring more common grammatical constructions first. One novel feature of TINA is that it provides an atuomatic sentence generation capability, which has been very effective for identifying overgeneration problems. A fully integrated spoken language system using this parser is under development.

null

102,456

inproceedings

jain-waibel-1989-connectionist

A Connectionist Parser Aimed at Spoken Language

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0224/

Jain, Ajay and Waibel, Alex

Proceedings of the First International Workshop on Parsing Technologies

221--229

We describe a connectionist model which learns to parse single sentences from sequential word input. A parse in the connectionist network contains information about role assignment, prepositional attachment, relative clause structure, and subordinate clause structure. The trained network displays several interesting types of behavior. These include predictive ability, tolerance to certain corruptions of input word sequences, and some generalization capability. We report on experiments in which a small number of sentence types have been successfully learned by a network. Work is in progress on a larger database. Application of this type of connectionist model to the area of spoken language processing is discussed.

null

102,458

inproceedings

kitano-etal-1989-massively

Massively Parallel Parsing in $\Phi${D}m{D}ialog: Integrated Architecture for Parsing Speech Inputs

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0225/

Kitano, Hiroaki and Mitamura, Teruko and Tomita, Masaru

Proceedings of the First International Workshop on Parsing Technologies

230--239

This paper describes the parsing scheme in the $\Phi$DmDialog speech-to-speech dialog translation system, with special emphasis on the integration of speech and natural language processing. We propose an integrated architecture for parsing speech inputs based on a parallel marker-passing scheme and attaining dynamic participation of knowledge from the phonological-level to the discourse-level. At the phonological level, we employ a stochastic model using a transition matrix and a confusion matrix and markers which carry a probability measure. At a higher level, syntactic/semantic and discourse processing, we integrate a case-based and constraint-based scheme in a consistent manner so that a priori probability and constraints, which reflect linguistic and discourse factors, are provided to the phonological level of processing. A probability/cost-based scheme in our model enables ambiguity resolution at various levels using one uniform principle.

null

102,459

inproceedings

nijholt-1989-parallel

Parallel Parsing Strategies in Natural Language Processing

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0226/

Nijholt, Anton

Proceedings of the First International Workshop on Parsing Technologies

240--253

We present a concise survey of approaches to the context-free parsing problem of natural languages in parallel environments. The discussion includes parsing schemes which use more than one traditional parser, schemes where separate processes are assigned to the {\textquoteleft}non-deterministic' choices during parsing, schemes where the number of processes depends on the length of the sentence being parsed, and schemes where the number of processes depends on the grammar size rather than on the input length. In addition we discuss a connectionist approach to the parsing problem.

null

102,460

inproceedings

black-1989-finite

Finite State Machines from Feature Grammars

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0229/

Black, Alan W

Proceedings of the First International Workshop on Parsing Technologies

277--285

This paper describes the conversion of a set of feature grammar rules into a deterministic finite state machine that accepts the same language (or at least a well-defined related language). First the reasoning behind why this is an interesting thing to do within the Edinburgh speech recogniser project, is discussed. Then details about the compilation algorithm are given. Finally, there is some discussion of the advantages and disadvantages of this method of implementing feature based grammar formalisms.

null

102,463

inproceedings

yamai-etal-1989-effective

An Effective Enumeration Algorithm of Parses for Ambiguous {CFL}

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0230/

Yamai, Nariyoshi and Seko, Tadashi and Kubo, Noboru and Kawata, Toru

Proceedings of the First International Workshop on Parsing Technologies

286--296

An efficient algorithm that enumerates parses of ambiguous context-free languages is described, and its time and space complexities are discussed. When context-free parsers are used for natural language parsing, pattern recognition, and so forth, there may be a great number of parses for a sentence. One common strategy for efficient enumeration of parses is to assign an appropriate weight to each production, and to enumerate parses in the order of the total weight of all applied production. However, the existing algorithms taking this strategy can be applied only to the problems of limited areas such as regular languages; in the other areas only inefficient exhaustive searches are known. In this paper, we first introduce a hierarchical graph suitable for enumeration. Using this graph, enumeration of parses in the order of acceptablity is equivalent to finding paths of this graph in the order of length. Then, we present an efficient enumeration algorithm with this graph, which can be applied to arbitrary context-free grammars. For enumeration of $k$ parses in the order of the total weight of all applied productions, the time and space complexities of our algorithm are $0(n^3 + kn^2)$ and $0(n^3 + kn)$, respectively.

null

102,464

inproceedings

adriaens-1989-parallel

The Parallel Expert Parser: A Meaning-Oriented, Lexically-Guided, Parallel-Interactive Model of Natural Language Understanding

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0232/

Adriaens, G.

Proceedings of the First International Workshop on Parsing Technologies

309--319

The Parallel Expert Parser (PEP) is a natural language analysis model belonging to the interactive model paradigm that stresses the parallel interaction of relatively small distributed knowledge components to arrive at the meaning of a fragment of text. It borrows the idea of words as basic dynamic entities triggering a set of interactive processes from the Word Expert Parser (Small 1980), but tries to improve on the clarity of interactive processes and on the organization of lexically-distributed knowledge. As of now, especially the procedural aspects have received attention: instead of having wild-running uncontrollable interactions, PEP restricts the interactions to explicit communications on a structured blackboard; the communication protocols are a compromise betwenn maximum parallelism and controllability. At the same time, it is no longer just words that trigger processes; words create larger units (constituents), that are in turn interacting entities on a higher level. Lexical experts contribute their associated knowledge, create higher-level experts, and die away. The linguists define the levels to be considered, and write expert processes in a language that tries to hide the procedural aspects of the parallel-interactive model from them. Problems include the possiblity of deadlock situations when processes wait infinitely for each other, the way to efficiently pursue different alternatives (as of now, the system just uses don`t-care determinism), and testing whether the protocols allow linguists to fully express their needs. PEP has been implemented in Flat Concurrent Prolog, using the Logix programming environment. Current research is oriented more towards the problem of distributed knowledge representation. Abstractions and generalizations across lexical experts could be made using principles from object-oriented programming (introducing generic, prototypical experts; cp. Hahn 1987). Thoughts also go in the direction of an integration of the coarse-grained parallelism with knowledge representation in a fine-grained parallel (connectionist) way.

null

102,466

inproceedings

tanaka-numazaki-1989-parallel

Parallel Generalized {LR} Parsing based on Logic Programming

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0234/

Tanaka, Hozumi and Numazaki, Hiroaki

Proceedings of the First International Workshop on Parsing Technologies

329--338

A generalized LR parsing algorithm, which has been developed by Tomita [Tomita 86], can treat a context free grammar. His algorithm makes use of breadth first strategy when a conflict occcurs in a LR parsing table. It is well known that the breadth first strategy is suitable for parallel processing. This paper presents an algorithm of a parallel parsing system (PLR) based on a generalized LR parsing. PLR is implemented in GHC [Ueda 85] that is a concurrent logic programming language developed by Japanese 5th generation computer project. The feature of PLR is as follows: Each entry of a LR parsing table is regarded as a process which handles shift and reduce operations. If a process discovers a conflict in a LR parsing table, it activates subprocesses which conduct shift and reduce operations. These subprocesses run in parallel and simulate breadth first strategy. There is no need to make some subprocesses synchronize during parsing. Stack information is sent to each subprocesses from their parent process. A simple experiment for parsing a sentence revealed the fact that PLR runs faster than PAX [Matsumoto 87][Matsumoto 89] that has been known as the best parallel parser.

null

102,468

inproceedings

marino-1989-framework

A Framework for the Development of Natural Language Grammars

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0236/

Marino, Massimo

Proceedings of the First International Workshop on Parsing Technologies

350--360

This paper describes a parsing system used in a framework for the development of Natural Language grammars. It is an interactive environment suitable for writing robust NL applications generally. Its heart is the SAIL parsing algorithm that uses a Phrase-Structure Grammar with extensive augmentations. Furthermore, some particular parsing tools are embedded in the system, and provide a powerful environment for developing grammars, even of large coverage.

null

102,470

inproceedings

yoon-kim-1989-analysis

Analysis Techniques for {K}orean Sentences Based on {L}exical {F}unctional {G}rammar

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0238/

Yoon, Deok Ho and Kim, Yung Taek

Proceedings of the First International Workshop on Parsing Technologies

369--378

The Unification-based Grammars seem to be adequate for the analysis of agglutinative languages such as Korean, etc. In this paper, the merits of Lexical Functional Grammar is analyzed and the structure of Korean Syntactic Analyzer is described. Verbal complex category is used for the analysis of several linguistic phenomena and a new attribute of UNKNOWN is defined for the analysis of grammatical relations.

null

102,472

inproceedings

matsumoto-etal-1989-learning

Learning Cooccurrences by using a Parser

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0239/

Matsumoto, Kazunori and Sakaki, Hiroshi and Kuroiwa, Shingo

Proceedings of the First International Workshop on Parsing Technologies

379--388

This paper describes two methods for the acquisition and utilization of lexical cooccurrence relationships. Under these method, cooccurrence relationships are obtained from two kinds of inputs: example sentences and the corresponding correct syntactic structure. The first of the two methods treats a set of governors each element of which is bound to a element of sister nodes set in a syntactic structure under consideration, as a cooccurrence relationship. In the second method, a cooccurrence relationship name and affiliated attribute names are manually given in the description of augmented rewriting rules. Both methods discriminate correctness of cooccurrence by the use of the correct syntactic structure mentioned above. Experiment is made for both methods to find if thus obtained cooccurrence relationship is useful for the correct analysis.

null

102,473

inproceedings

church-etal-1989-parsing-word

Parsing, Word Associations and Typical Predicate-Argument Relations

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0240/

Church, Kenneth and Gale, William and Hanks, Patrick and Hindle, Donald

Proceedings of the First International Workshop on Parsing Technologies

389--398

There are a number of collocational constraints in natural languages that ought to play a more important role in natural language parsers. Thus, for example, it is hard for most parsers to take advantage of the fact that wine is typically drunk, produced, and sold, but (probably) not pruned. So too, it is hard for a parser to know which verbs go with which prepositions (e.g., set up) and which nouns fit together to form compound noun phrases (e.g., computer programmer). This paper will attempt to show that many of these types of concerns can be addressed with syntactic methods (symbol pushing), and need not require explicit semantic interpretation. We have found that it is possible to identify many of these interesting co-occurrence relations by computing simple summary statistics over millions of words of text. This paper will summarize a number of experiments carried out by various subsets of the authors over the last few years. The term collocation will be used quite broadly to include constraints on SVO (subject verb object) triples, phrasal verbs, compound noun phrases, and psychoiinguistic notions of word association (e.g., doctor/nurse).

null

102,474

inproceedings

slator-wilks-1989-premo

{PREMO}: Parsing by Conspicuous Lexical Consumption

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0242/

Slator, Brian M. and Wilks, Yorick

Proceedings of the First International Workshop on Parsing Technologies

401--413

PREMO is a knowledge-based Preference Semantics parser with access to a large, lexical semantic knowledge base and organized along the lines of an operating system. The state of every partial parse is captured in a structure called a language object, and the control structure of the preference machine is a priority queue of these language objects. The language object at the front of the queue has the highest score as computed by a preference metric that weighs grammatical predictions, semantic type matching, and pragmatic coherence. The highest priority language object is the intermediate reading that is currently most preferred (the others are still {\textquotedblleft}alive,{\textquotedblright} but not actively pursued); in this way the preference machine avoids combinatorial explosion by following a {\textquotedblleft}best-first{\textquotedblright} strategy for parsing. The system has clear extensions into parallel processing.

null

102,476

inproceedings

tomita-1989-parsing

Parsing 2-Dimensional Language

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0243/

Tomita, Masaru

Proceedings of the First International Workshop on Parsing Technologies

414--424

2-Dimensional Context-Free Grammar (2D-CFG) for 2-dimensional input text is introduced and efficient parsing algorithms for 2D-CFG are presented. In 2D-CFG, a grammar rule`s right hand side symbols can be placed not only horizontally but also vertically. Terminal symbols in a 2-dimensional input text are combined to form a rectangular region, and regions are combined to form a larger region using a 2-dimensional phrase structure rule. The parsing algorithms presented in this paper are the 2D-Ear1ey algorithm and 2D-LR algorithm, which are 2-dimensionally extended versions of Earley`s algorithm and the LR(O) algorithm, respectively.

null

102,477

inproceedings

budhiraja-etal-1989-parsing

Parsing Generalized Phrase Structure Grammar with Dynamic Expansion

Tomita, Masaru

aug

1989

Pittsburgh, Pennsylvania, USA

Carnegy Mellon University

https://aclanthology.org/W89-0247/

Budhiraja, Navin and Mitra, Subrata and Karnick, Harish and Sangal, Rajeev

Proceedings of the First International Workshop on Parsing Technologies

458--467

A parser is described here based on the Cocke-Young-Kassami algorithm which uses immediate dominance and linear precedence rules together with various feature inheritance conventions. The meta rules in the grammar are not applied beforehand but only when needed. This ensures that the rule set is kept to a minimum. At the same time, determining what rule to expand by applying which meta-rule is done in an efficient manner using the meta-rule reference table. Since this table is generated during {\textquotedblleft}compilation{\textquotedblright} stage, its generation does not add to parsing time.

null

102,481

inproceedings

pigott-1984-difficulty

The difficulty of developing logical algorithms for the machine translation of natural language

null

feb # " 13-15"

1984

Cranfield University, UK

null

https://aclanthology.org/1984.bcs-1.5/

Pigott, Ian M.

Proceedings of the International Conference on Methodology and Techniques of Machine Translation: Processing from words to language

null

In studying machine translation software design, computer experts and linguists have traditionally concentrated on a number of phenomena deemed to present special problems and thus require particular attention. Among the favourites in this connection are morphological analysis, prepositional dependencies and the establishment of antecedents. These and similar subjects have been dealt with at great length in the numerous papers written over the years to demonstrate the necessity of adding one or more specific processing features to the software under design or pilot development. Experience in the practical upgrading of operational systems has however tended to reveal a surprising variety of quite different problems and has shown that the fears of designers and theorists are frequently unfounded. Indeed, in tailoring a system for use by translators, many quite unexpected types of error emerge which, in the absence of sufficiently comprehensive studies, have to be eliminated largely on the basis of trial and error. The paper presents several examples of translation problems of this type and explains how difficult it can be to formalize their resolution in computer programs. Special reference is made to the English-French version of Systran, under development at the European Commission in Luxembourg. Explanations are given of the identification of error types, the human effort involved in their study, and the testing procedures used to check the validity of the action taken to reduce their occurrence in routine translation work. Finally, a number of suggestions are made for those working on design aspects of new systems in the hope that by paying lessattention to problems which have already been solved, efforts can be concentrated on the specific areas which continue to cause frustration for those required to correct or use machine translations in practice.

null

104,121

inproceedings

knowles-1984-machine

Machine-aided translation and lexical strategies

null

feb # " 13-15"

1984

Cranfield University, UK

null

https://aclanthology.org/1984.bcs-1.8/

Knowles, Frank

Proceedings of the International Conference on Methodology and Techniques of Machine Translation: Processing from words to language

null

The context of this paper is that of a translator wishing to develop dictionaries for the purposes of machine-aided translation (MAT). A description is given of the ways in which lexical items in running text are statistically ``patterned'', depending on whether these so-called ``types'' are left unaltered as they are extracted from the text or whether they are immediately mapped onto the corresponding dictionary look-up form (``lemma'') for the purpose of statistical analysis. It is obvious, of course, that for translation purposes it is necessary to establish appropriate entry-points into the MAT dictionary, but this is a secondary problem. There are two dimensions which can assist the machine-assisted translator to a considerable extent. One such factor is any degree of homogeneity the greater, the better in the texts he wishes to process. Translators specialising in certain subject areas and types of discourse are at an advantage if they wish to use an MAT system. The second factor is that of the so-called ``multi-word unit''. Although all languages have multi-word units, which are semantically atomic, they are particularly important in English, and even more so in English technical terminology. Frequency studies of multi-word units, although they generate large listings of types, can be very useful for MAT. The machine-assisted translator is faced with the need to view his work as consisting of two distinct modes: dictionary elaboration and text transaction. The second mode, of course, provides important feed-back to guide the first. One thing is clear: the translator must be his own lexicographer to a great extent, at least until the time when software houses realise the commercial value of such ``static'' data as general bi-lingual high-frequency dictionaries ana the potential ``constellation'' of carefully designed and delineated bi-lingual glossaries of technical terminology!

null

104,124

inproceedings

loh-etal-1984-new

A new dictionary structure for bi-directional {MT} system

null

feb # " 13-15"

1984

Cranfield University, UK

null

https://aclanthology.org/1984.bcs-1.10/

Loh, Shiu-chang and Kong, Luan and Hung, Hing-sum

Proceedings of the International Conference on Methodology and Techniques of Machine Translation: Processing from words to language

null

The importance and structure of MT-dictionary were discussed extensively by many researchers in machine, translation in the past. These structures were mainly concerned with MT-dictionaries for one-way translation systems. In the present paper, a new dictionary structure for bi-directional machine translation is being introduced. The new structure is being tested for Chinese-English as well as English-Chinese machine translation.

null

104,126

inproceedings

melby-1984-machine

Machine translation with post editing versus a three-level integrated translator aid system

null

feb # " 13-15"

1984

Cranfield University, UK

null

https://aclanthology.org/1984.bcs-1.19/

Melby, Alan K.

Proceedings of the International Conference on Methodology and Techniques of Machine Translation: Processing from words to language

null

The standard design for a computer-assisted translation system consists of data entry of source text, machine translation, and post editing (i.e. revision) of raw machine translation. This paper discusses this standard design and presents an alternative three-level design consisting of word processing integrated with terminology aids, simple source text processing, and a link to an off-line machine translation system. Advantages of the new design are discussed.

null

104,135

inproceedings

mbaeyi-1984-language

What is the language of memory?

null

feb # " 13-15"

1984

Cranfield University, UK

null

https://aclanthology.org/1984.bcs-1.22/

Mbaeyi, Peter Nwoye O.

Proceedings of the International Conference on Methodology and Techniques of Machine Translation: Processing from words to language

null

This paper outlines the mutual beneficial analogies between the structural dynamics of memory and machine translation, both of which are extensively dependent on fundamental pattern recognition problems. Basically, both processes are faced with a similarly structured problem namely, the problem of condensing large quantities of data into intelligently interpretable smaller volumes (comprised of basic ``information clusters''). For machine translation, the alphabets and words of a language (that make up an essay) define these data, while the multiplicities of physico-chemical objects of sensory perception constitute, amongst others, the data compression problem facing the memory functions of the brain. For the neural systems (underlying the memory functions of the brain) recent advancements in generalized quantum theoretical methods provide some bases. While these foundations will not be discussed here in any detail, they are used to define the components of a language compatible with memory dynamics. Essentially, these culminate in associative (quantum) logical problems with analogical counterparts in linguistics and the use of compartmentalization cum associative logic in essay interpretations. For purposes of computational linguistics, this paper makes these analogies precise (on quantitative analytical basis), with emphasis on discrete recursive generation of larger structures, and equivalents of coding and decoding for machine translation process.

null

104,138

inproceedings

habermann-1984-application

Application of {SYSTRAN} for translation of nuclear technology texts at the Nuclear Center of Karlsruhe

null

feb # " 13-15"

1984

Cranfield University, UK

null

https://aclanthology.org/1984.bcs-1.23/

Habermann, F. W. A.

Proceedings of the International Conference on Methodology and Techniques of Machine Translation: Processing from words to language

null

Four years ago the Nuclear Center of Karlsruhe has commenced to apply the Systran MT Program for the translation of nuclear technology texts from French into English. During this period the Systran program has been updated several times and about 8000 entries have been made in the stem dictionary to adapt the MT program to the special field. This resulted in substantial improvement of the quality of translated texts. Quantitative judgement of this quality could be achieved by repeated statistical analysis of some representative sample texts. The results of these analyses are shown and commented.

null

104,139

inproceedings

arnold-johnson-1984-robust-processing

Robust processing in machine translation

null

feb # " 13-15"

1984

Cranfield University, UK

null

https://aclanthology.org/1984.bcs-1.25/

Arnold, Doug and Johnson, Rod

Proceedings of the International Conference on Methodology and Techniques of Machine Translation: Processing from words to language

null

We attempt to develop a general theory of robust processing for natural language, and especially Machine Translation purposes. That is, a general characterization of methods by which processes can be made resistant to malfunctioning of various kinds. We distinguish three sources of malfunction: (a) deviant inputs, (b) deviant outputs, and (c) deviant pairings of input and output, and describe the assumptions that guide our discussion (sections 1 and 2). We classify existing approaches to (a)and (b)-robustness, noting that not only do such approaches fail to provide a solution to (c)-type problems, but that the natural consequence of these solutions is to make (c)-type malfunctions harder to detect (section 3) In the final section (4) we outline possible solutions to (c)-type malfunctions.

null

104,141

inproceedings

maas-1984-control

Control and data structures in the {MT} system {SUSY}-{E}

null

feb # " 13-15"

1984

Cranfield University, UK

null

https://aclanthology.org/1984.bcs-1.27/

Maas, Heinz Dieter

Proceedings of the International Conference on Methodology and Techniques of Machine Translation: Processing from words to language

null

The MT system SUSY-E which has been developed since 1972 in the Sonderforschungsbereich ``Elektronische Sprachforschung'' of the University of the Saar can be divided into three major subsystems: background, dictionary and kernel systems. The background system represents the interface to implementers, linguists and users. The dictionary system supports the construction and maintenance of the different dictionaries and provides the description of the dictionary entries. The proper translation processes are carried out by the use of the kernel systems containing the linguistic knowledge in different representational schemes and allowing for syntactico-semantic analysis and generation of texts. The most elaborate kernel system of SUSY-E is SUSY which has been constantly developed and tested in the past ten years. Apart from SUSY there exist several new ``prototypes'' which in their architecture show considerable differences between themselves and especially with regard to SUSY. These new approaches are called SUSY-II systems.

null

104,143

article

nn-1978-finite

The {F}INITE {S}TRING, Volume 15, Number 1

Hays, David G.

feb

1978

null

https://aclanthology.org/J78-1001/

null

What Some Semantic Theories Can`t Do (Th R. Hofmann); {NL} in Information Science (Donald E. Walker; Hans Karlgren; Martin Kay); {CAL} in Science Education; New Journal: Annuals Of the History of Computing (Bernard A. Caller); {N}ew {E}ngland Research Application Center; Linguafranca: Document Search ({LLBA}); Demonstration: Interactive Search of {LLBA}; {NFAIS}/{UNESCO} Indexing Education Kit; Symposium: Computer Assisted Learning (J. J. Mathews); 1978 Linguistic Institute: Conferences and Symposia; Data BAses: Usability and Responsiveness (Dr. Allen Baiter); Conferences: Internal Auditing (D. Eugene Shaeffer); Conferences: Briefly Noted (K. Preston Jr.); {NSF} Awards in Computer Science for 1976; {AJCL}: A Description; {AJCL}: Page Format; {AJCL}: Opaque Card Format; {AFIPS} {W}ashington Newsletter

American Journal of Computational Linguistics

null

Microfiche 73

104,989

article

nn-1978-finite-string-volume

The {F}INITE {S}TRING, Volume 15, Number 2 (continued)

Hays, David G.

jun

1978

null

https://aclanthology.org/J78-2005/

null

69--85

Manifesto: The Press At {T}win {W}illows (David G. Hays); Reviews of Micro Hardware and Software to be Published; Publishing {AJCL} (David G. Hays); Conferences: {ASIS} and {HICSS}; Linguistic Structures Processing, Zampolli, ed.; Natural Language in Information Science, Walker, Kalrgren, and Kay, eds.; Description of {AJCL}; {AFIPS} {W}ashington Report, June 78

American Journal of Computational Linguistics

null

Microfiche 75

104,996

article

nn-1978-finite-string-volume-15-number

The {F}INITE {S}TRING, Volume 15, Number 4

Hays, David G.

dec

1978

null

https://aclanthology.org/J78-3001/

null

1--40

{ACL}: Minutes Of the 16th Annual Business Meeting; {ACL} Secretary-Treasurer`s Report; {ACL} Officers For 1979; {ACL} Officers 1963-1979; {NSF}: Support for Computational Linguistics (Paul G. Chapin); News: Short Notes; News: {ARIST} Reprint Request (Martha E. Williams); News: Summer Linguistics at {T}exas; {P}h{D} Programs in Computational Linguistics; Journal: Computational Linguistics and Computer Languages (T. Frey; T. Vamos); Journal: Discourse Processes (Roy D. Freedle); Book Notices (Mel`cuk R. Ravic); {Y}ale {AI} Project Research Reports Available; Summary of Research on Computational Aspects of Evolution Theories (Raymond D. Gumb); Taxonomy: Information Sciences (Editors of Information Systems); Machine Aids to Translation: A Concise State of the Art Bibliography (Wayne Zachary);

American Journal of Computational Linguistics

null

Microfiche 77

105,000

article

nn-1977-finite

The {F}INITE {S}TRING, Volume 14, Number 1

Hays, David G.

feb

1977

null

https://aclanthology.org/J77-1001/

null

1--47

Editorial Board: Three Years Terms Inaugurated; Eulogy Of {A} {L}judskanov (G Rondeau); Letters Concerning {I}gor {M}el`chuk (Donald F. Walker); {IFIP} Congress 77: Invited Speakers, etc; Compcom Spring 1977: Program Excerpts (Stephan W. Miller); {COLING} 76: Invited Papers Published in {SMIL}; {SMIL} Journal Oo Linguistic Calculus (New Policy); Research in Progress: {SSIE} Search Service; Epigraphy: Informatic Methods - Papers Published; Linguistics And Philosophy (New Journal) (Robert Wall); {C}anadian Linguistics Institute; Patent Information and Documentation: Symposium, Munich; {LACUS} Forum (Michael Paradis); {IFIP} on Selection and Acquisition of Data Base Systems; National Computer Conference 1977: Major Speakers, etc (Mark Shepherd Jr.); Information Industry Association Conference; {ASIS} Officers for 1977 (Margeret T. Fischer); Taxonomy of Computer Science; Meetings; {AFIPS} Seminar for {FCC} on Data Communications; Notice to {AJCL} contributors: Short-Paper Format

American Journal of Computational Linguistics

null

Microfiche 59

105,077

article

nn-1977-finite-string-volume-14-number

The {F}INITE {S}TRING, Volume 14, Number 2

Hays, David G.

may

1977

null

https://aclanthology.org/J77-2001/

null

Report of the {ACL} 1977 Annual Meeting Panel on Speech Understanding and Computational Linguistics: A Critical Examination of the {ARPA} Project (Stanley R. Petrick); Essays on Lexical Semantics, Vol {II}, edited by {V}. {J}u. {R}ozencvejg (Ernst von Glasersfeld); Constituent and Pattern in Poetry, {A}rchibald {A}. {H}ill (James Joyce); Current Bibliography

American Journal of Computational Linguistics

null

Microfiche 64

105,087

article

nn-1977-finite-string-volume-14-number-3

The {F}INITE {S}TRING, Volume 14, Number 3

Hays, David G.

may

1977

null

https://aclanthology.org/J77-2002/

null

{ACL} Presidental Address 1977 (Paul G. Chapin); Editor`s Report 1976; Editorial Board Meeting, March 17, 1977; Minutes: 15th Annual {ACL} Business Meeting (Donald E. Walker); {ACL}: Secretary-Treasurer`s Report; Suggestions for Contributors; Researching Foundations (James Klevens); {NSF}: Linguistics Programs, Grant List; National Institute of Education, Grants and Proposals; National Endowment for the Humanities; {NFAIS}: H. W. Koch, President-Elect; {NFAIS}: Overlap Report; {IFIP}: Recent Publications; {UNESCO} {SPINES} Thesaurus; {BBN} Speech Understanding System, Final Report; Natural Language Understanding at {SRI}; {AFCET} Conference (E. Chouraqui; J. Virbel); Fifth International Joint {AI} (Edward Fredkin); 5th International Congress of Applied Linguistics (Jacques D. Gerard); {IFIP} Congress 1977; {MEDINFO} 1977; {C}anadian Linguistics Institute (Robert F. Bell); Fourth {LACUS} Forum (Michel Paradis); International Seminar on {QA} and Data Base Systems (Pr. J. C. Simon; Pr. L. Siklossy); Computer Music Conference; Conference: Very Large Data Bases; International Computer Symposium; Pattern Recognition and Image Processing Conference; {AFIPS} {W}ashington Report; {ACM} Student Paper Competition (J. A. N. Lee)

American Journal of Computational Linguistics

null

Microfiche 65

105,088

article

nn-1977-finite-string-volume-14-number-4

The {F}INITE {S}TRING, Volume 14, Number 4

Hays, David G.

sep

1977

null

https://aclanthology.org/J77-3001/

null

{COLING}-78: Call for Papers (A. Zampolli); Metaphor And Thought: A Conference; Conference on Algorithms for Image and Scene Analysis (K. S. Fu; A. S. Rosefeld); Recent Conferences; {NFAIS} Notes; {N}orthwestern Merges {EE} and {CS} (Stephen S. Yau); {NHPRC} Grant Information; {ICCP} Announces Certificate in Computer Programming; {ACM} Employment Register 1978; {MARSHA}, the Daughter Of {ELIZA} (John K. Cipolaro; Nicholas V. Findler); {AFIPS} Presidential Address, 1976 {NCC}, Dr. Anthony Ralston; {AFIPS} Press Publicatons 1977-1978; {AFIPS} {W}ashington Report (Pender M. McCarter); Linguistic Institute 1978

American Journal of Computational Linguistics

null

Microfiche 66

105,090

article

nn-1977-finite-string-volume-14-number-5

The {F}INITE {S}TRING, Volume 14, Number 5

Hays, David G.

sep

1977

null

https://aclanthology.org/J77-3003/

null

Aspects of {E}nglish Sentence Stress, by Susan F. Schmerling (Dwight Bolinger)); Annual Review of Information Science and Technology, Vol. 11, edited by Martha E. Williams (Ralph Weischedel); Factors Influencing the Placement of {E}nglish Adverbs in Relation to Auxiliaries, by Sven Jacobson (Ivar Tonisson); Fondazione Dalle Molle: Bibliography 1977; New Journal: Linguistic{\ae} Investigationes (John Benjamins B V); New Journal: Studies in language (John Benjamins B V); Arts and Humanities Citation Index (Susan Deutch); Current Bibliography

American Journal of Computational Linguistics

null

Microfiche 68

105,092

article

nn-1977-finite-string-volume-14-number-6

The {F}INITE {S}TRING, Volume 14, Number 6

Hays, David G.

dec

1977

null

https://aclanthology.org/J77-4001/

null

{ACL} Officers 1978; {AJCL} Editorial Board (John L. Bennett; Wallace Chafe); {ACL} Annual Meeting 1978 (David L. Waltz); {ACL} 78 Session Descriptions; {TINLAP}-2 Proceedings Supplement Canceled (Dr. Donald E. Walker); {ACL} Membership List: Individuals 1977; {ACL} {U}nited {S}tates Institutional Members 1977; {ACL} Foreign Institutional Members 1977; Vingt Cinq Annees de Recherches en Synthese de la Parole, Michel Chafcouloff (Andre Malecot); Information * Politics: Proceedings of the {ASIS} Annual Meeting, Vol. 13, compiled by Susan K. Martin (Gerard Salton); Taxonomy of Computer Science (Anthony Ralston); {COLING} 78 (A. Zampolli); {NCC} 78; Improving Data Base Utility and Response: Conference (A. Reiter); Upcoming Conferences; Natural Language and {AI} at {Y}ale; Pattern Recognition and Artificial Intelligence (T. Pavlidis); 1978 Linguistics Institute; {AFIPS} {W}ashington Report

American Journal of Computational Linguistics

null

Microfiche 69

105,094

article

nn-1976-finite

The {F}INITE {S}TRING, Volume 13, Number 1

Hays, David G.

feb

1976

null

https://aclanthology.org/J76-1001/

null

1--22

{ACL} President 1976: Stanley R. Petrick; Personal Notes; Semantics: {G}eorgetown Round Table; {AAAS} Program Excerpts: Science And Expectations; {NEH}: Application Deadlines; {Science and Government} Ralston Speaks at {NCC} 76 (Dr. Ralston); Architecture for Nonnumeric Processing (Y. W. Su; G. Jack Lipovski); {ASIS} President 1976: Melvin S. Day, Literary and Linguistic Computing: Meeting Notes; Abstracting and Indexing Societies: Conference; Instituto per Gli Studi Semantici e Cognitivi; {P}etrarch Translated by Computer (SUNY Binghamton); Stenotype: Computer-Aided Transcription (Michael E. LaBorde); Serials Librarianship: {D}rexel Library Quarterly (Benita M. Weber)

American Journal of Computational Linguistics

null

Microfiche 37

105,100

article

nn-1976-finite-string-volume-13

The {F}INITE {S}TRING, Volume 13, Number 3

Hays, David G.

may

1976

null

https://aclanthology.org/J76-2001/

null

Personal Notes (Jaime Carbonell; Collins); 1976 National Computer Conference (J. Paul Lyet); {NIMH}: Technical Help for Proposers, Minority Programs (Richard Lopez); {NSF}: Foreign Currency Program--{E}gypt, {I}ndia, {P}akistan; Catastrophe Theory: {T}hom at {SIAM} Meeting (Rene Thom); {NATO}: Advanced Study Institutes (Joseph M. Scandura), Structural-Process Theories of Behavior, Man-Computer Interaction, Computer-Based Science Instruction; {C}. {S}. {P}ierce International Congress (Max H. Fisch); New Journal: Cognitive Science (Eugene Charniak; Allan Collins; Roger C. Schank); {NSF}: Rejected Proposals and Reconsideration; Conference Chronicle; 1976 Linguistics Institute, {O}swego, {N}ew {Y}ork; {BAAL}: Seminar On Translation At {E}ssex, {E}ngland (R. R. K. Hartmann; W. S. Dodo); Indexing in Perspective Seminar at {W}arsaw; {NFAIS} Officers 1976-77 (John E. Crepa Jr.); Experiments with a Powerful Parser (Martin Kay); {AFIPS} {W}ashington Report (Anthony Ralston)

American Journal of Computational Linguistics

null

Microfiche 43

105,110

article

nn-1976-finite-string-volume-13-number-7

The {F}INITE {S}TRING, Volume 13, Number 6

Hays, David G.

sep

1976

null

https://aclanthology.org/J76-3001/

null

1--67

{ACL}: 14th Annual Meeting - Program and Abstracts; {ACM}: Employment Register at Computer Science Conference (Orrin E. Taulbee); {NSF} Adivisory Panel for Linguistics (William D. Dingwall; Victoria Fromkin; Ives Goddard; Roger Shuy; Carlota Smith; Arnold Zwicky); {E}uropeon Congress on Information Systems and Networks; New Journal: Transactions On Data Base Systems (David K. Hsaid); Applied Linguistics: 5th International Congress (Jacques D. Garard); {AFIPS}: Officers And Honors (Theodore J. Williams); {ACM}: Officers, 1976-1978 (Herbert R. J. Grosch); {LATSEC}: Congressman Questions Payment; The Future Of {MT} (Rudolph C. Troike); {MT}: {M}oscow International Seminar (I. I. Qubine)

American Journal of Computational Linguistics

null

Microfiche 51

105,124

article

nn-1976-finite-string-volume-13-number-8

The {F}INITE {S}TRING, Volume 13, Number 7

Hays, David G.

dec

1976

null

https://aclanthology.org/J76-4001/

null

{ACL}: New Officers for 1977, Call for Papers, Minutes of 1976 Business Meeting, Secretary-Treasurer`s Report, Financial Report; Humanities - 3rd International Conference (J. S. North); Linguistics and Literary Analysis - 5th International (D. E. Ager); Graphics and Interactive Techiniques - 4th Annual (James E. George); Undergraduate Curricula and Computing Conference (Gerald L. Engel);

American Journal of Computational Linguistics

null

Microfiche 55

105,131

article

nn-1975-finite-string

The {F}INITE {S}TRING, Volume 12, Number 2

Hays, David G.

jul

1975

null

https://aclanthology.org/J75-2001/

null

1--20

Personal Notes; {COLING} 76 - Sixth International Conference on {CL} (Guy Rondeau); Letters - {Y}orick {W}ilks on {LOGOS} {MT} (Fondazione Dalle Molle); Awards - {AFIPS} honors {I}verson, {A}strahan; {NSF} - {C}hapin New Program Officer For Linguistics; {ACM} - {F}orsythe Student Paper Competition; National Computer Conference 1976 - Hammer, Winkler; {AAAS} Section {T} - new name, fellowship program (Joseph Becker); {O}ttawa Linguistics Documentation Centre (Thomas R. Hofmann); {MT} and {MAT} - list of systems and centers (Herbert Bruderer); {NFAIS} officers for 1975 (Ben H. Weil); Abstracting and Indexing - World Inventory of Services (Gaye Hofsman; Toni Carbo Bearman)

American Journal of Computational Linguistics

null

Microfiche 17

105,218

article

nn-1975-finite-string-volume-12-number-4

The {F}INITE {S}TRING, Volume 12, Number 4

Hays, David G.

sep

1975

null

https://aclanthology.org/J75-3001/

null

1--52

{ACL} Nominating Committee (William A. Woods Jr; Robert Simmons; Robert Barnes); 13th Annual Meeting: Abstracts of Papers (Tim Diller; Jon Allen; Joyce Friedman; Bonnie Nash-Webber; Chuck Rieger); {ASIS} Annual Meeting (Ruth Tighe); {ACM} Annual Conference; {SOLAR} Project Terminates--{APRA} Support Ends (Dr. Tim Diller); Energy Inofrmation Tools: {IIA}-{NFAIS} Workshop (Paul Zurkowski); {MT}: {C}hinese Journals Offered on Subscription from {H}ong {K}ong (Shiu Chang Loh); Librarian of Congress: {ASIS} telegram to President {F}ord (Joshua I. Smith); Bibliography on Semantics and Cognition at {C}astagnola (Fondazine Dalle Molle) Recent Publications

American Journal of Computational Linguistics

null

Microfiche 22

105,231

article

nn-1975-finite-string-volume-12-number-5

The {F}INITE {S}TRING, Volume 12, Number 5

Hays, David G.

nov

1975

null

https://aclanthology.org/J75-4001/

null

1--24

{ACL} Officers 1976 (Stanley R. Petrick); {ACL} Executive Committee Meeting (Joshi); {ACL} Financial Report (A. Hood Roberts); Personal Notes; {NSF}: Reorganization (Dr. Edward Creutz); {MT}: Latsec Shows in {Z}urich (M.r Herbert Bruderer); {XII} th International Congress of Linguistics (Wolfgang U Dressler); {ACM} Conference - Employment Register (Orrin E. Taulbee); Compcom 76 (Edward E. David Jr; J. Presper Eckert); Cybernetics and Systems Research (Schottengasse); Literary and Linguistic Computing (J. M. Smith); {C}harles {S}. {P}eirce Society (Carolyn Eisele); Computer Applications to Learning; Historical Linguistics (William Christie); Short Announcements and Reminders; {ACLS}: {S}oviet Studies East {E}uropean Languages; Special Libraries Association Scholarships; Acknowledgement (Allen Klinger)

American Journal of Computational Linguistics

null

Microfiche 29

105,242

article

nn-1975-finite-string-volume-12-number-6-continued

The {F}INITE {S}TRING, Volume 12, Number 6 (continued)

Hays, David G.

nov

1975

null

https://aclanthology.org/J75-4006/

null

17--82

Speech Understanding Research Report, {SRI} (Donald E. Walker); {M}ichigan Early Modern {E}nglish Materials (Richard W. Bailey; James W. Downer; Jay L. Robinson; Patricia V. Lehman; Voice Response Papers at {C}ompcom 75 (Donald A. Biggar); {NFAIS} Reports and Chart; {NYU} Linguistic String Project: Bibliography; Multiple-Valued Logic: Proceedings, Tables of Contents; Artificial Intelligence In {P}oland: Bibliography 1972-1974; Current Bibliography (Januez Stanislaw Bien); {AFIPS} Press Catalog

American Journal of Computational Linguistics

null

Microfiche 30

105,247

article

nn-1974-finite

The {F}INITE {S}TRING, Volume 11, Number 1

Hays, David G.

sep

1974

null

https://aclanthology.org/J74-1001/

null

{NSF} Sponsorship for {AJCL} (A. Hood Roberts); Microfiche Viewing Equipment Guide (Ronald F. Borden); {ACL} Officers 1975 (Aravind K. Joshi); {ACL} Program, July 26-27, 1974; Association for Literary and Linguistic Computing (R. A. Wisbey); Computer at {MIT} Can Read (Jonathan Allen); Computer-Assisted Lexicography - Bibliography (Richard W. Bailey); Current Bibliography (Brian Harris; R. Laskowski)

American Journal of Computational Linguistics

null

Microfiche 1

105,285

article

nn-1974-finite-string

The {F}INITE {S}TRING, Volume 11, Number 2

Hays, David G.

dec

1974

null

https://aclanthology.org/J74-2001/

null

Personal Notes; Computational Semantics Tutorial at {L}ugano in {M}arch; Artificial Intelligence: Directory Being Compiled (Donald E. Walker); Letters: {L}ogos Development Corporation on {MT} System (Yorick Wilks); {S}olar Project Distributes Materials (Tim Diller; John Olney; Nathan Ucuzoglu); {NAS/NRC} Studies International Information Programs; {NFAIS} Meeting, Overlap Study, Indexer Training Kit (Ben H. Weil); On-line Terminal Searching Course at {P}ratt in January (Patricia Breivik); Educational Data Systems Association Convention; Publication Problems: Journal Prices Rising (Philip H. Abelson); 3rd {P}isa Summer School: Report of Courses, Lectures (Antonio Zampoli); Summer School at {S}tuttgart: Report of Lectures (Hans-Jochen Schneider); Information and Philology Conference: Report (Marichal); {A}riosto Concordance in Progress (Cesare Segre); Text Data: Roundtable on Analytic Procedures Held; {SIGLASH} (Michael Lesk; Robert Wachal; Dolores Burton; Karen Mullen); Political Science Concepts to be Collected and Analyzed (George J. Graham); Reliable Software Conference, {L}os {A}ngeles, {A}pril (M. L. Shooman); Psycholinguistics Conference, {N}ew {Y}ork, {J}anuary; {NSF}: Excerpts from the Organizational Directory (H. Guyford Stever); Microfiche Equipment: Background Information for Buyers (Dake Gaddy); Artificial Intelligence in {P}oland: Bibliography; {AAAS} Meeting: {J}anuary (W. M. Carlson); Current Bibliography (Brian Harris; R. Laskowski)

American Journal of Computational Linguistics

null

Microfiche 6

105,291

article

nn-1974-finite-string-volume

The {F}INITE {S}TRING, Volume 11, Number 3

Hays, David G.

dec

1974

null

https://aclanthology.org/J74-3001/

null

1--27

International Conference - {COLING} 76 (Dr. Guy Rondeau); Workshop - Theoretical Issues in Natural Language Processing ({TINLAP}) (Bonnie Nash Webber; Roger Schank); Summer School - Computational Linguistics at {R}ocquencourt (M. Andreewsky); Summer School - Literary Statistics at {C}ambridge, {E}ngland (M. H. T. Alford); International Conference - Computers and the Humanities (Robert Dilligan; Rudolf Hirschmann; Joseph Raben; Donald Ross; Todd K. Bender; Grace C. Hertlein); {NFAIS} Conference - Information Interfaces (Ben H. Weil; Joseph Coyne; Ann Farren; A. Hood Roberts); {IEEE} Conference - Computers to Reach the People (Martin L. Rubin; Susan Wittig; Kerry Mark Joels; O. Firschein And R. K. Summat); {IFIP} Conference - Computers in Education; International Conference - Developing Countries (Dr. H. A. Al-Bayati; A. A. M. Veenhuis; Richard C. Atkinson); {NSF} Deputy Director - Richard C. Atkinson nominated; {NEH} Calendar - grant applications; National Program Draft: Library and Information services; Research Progress: {I}ndex {T}homisticus in press (Roberto Busa S.J.); Computer Security: {AFIPS} and {ACM} publish guides (Robert L. Patrick)

American Journal of Computational Linguistics

null

Microfiche 9

105,295

inproceedings

lehmann-stachowitz-1971-feasibility

Feasibility study on fully automatic high quality translation

null

dec

1971

University of Texas

null

https://aclanthology.org/1971.earlymt-1.1/

Lehmann, Winfred P. and Stachowitz, Rolf

Feasibility Study on Fully Automatic High Quality Translation

1--50

This report presents the results of a theoretical inquiry into the feasibility of a fully automatic high quality translation (FAHQT), according to Bar-Hillel`s definition of this term. The purpose of this inquiry consisted in determining the viability of the FAHQT concept in the light of previous and projected advances in linguistic theory and software/hardware capabilities. The corollary purpose was to determine whether this concept can be taken into consideration as a legitimate and justifiable objective of R{\&}D. The effort was supported by 20 expert consultants from the various universities and research centers in the U.S.A. and abroad. Conclusions and recommendations are presented on pages 44-50 of the report. Individual contributions of participants and consultants reflect a wide range of opinions concerning the prospects of FAHQT in intermediate and long range of R{\&}D.

null

105,368

inproceedings

bellert-1963-necessity

Necessity of introducing some information provided by transformational analysis into {MT} algorithms

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.1/

Bellert, Irena

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

A few examples of ambiguous English constructions and their Polish equivalents are discussed in terms of the correlation between their respective phrase-marker representations and transformational analyses. It is shown by these examples that such an investigation can reveal interesting facts for MT, and therefore should be carried out for any pair of languages for which a given MT program is being constructed. If the phrase-marker of the English construction is set into one-to-one correspondence with the phrasemarker of the Polish equivalent construction, whatever particular transformational analysis of this construction is to be taken into account, then the ambiguous phrasemarker representation can be used as a syntactical model for MT algorithms with good results. If the phrase-marker of the English construction is set into one-to-many correspondence with the phrasemarkers of the Polish equivalents, according to the transformational analyses of this construction, then the ambiguous phrase-structure representation has to be resolved in terms of transformational analysis, for only then is it possible to assign the corresponding phrase structure representation to the Polish equivalents. A tentative scheme of syntactical recognition is provided for the multiply ambiguous adjectival construction in English1 (which proved to belong to the latter case) by means of introducing some information obtained from the transformational analysis of this construction.

null

105,627

inproceedings

betz-hoffman-1963-use

The use of a random access device for dictionary lookup

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.2/

Betz, Robert S. and Hoffman, Walter

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

The purpose of this paper will be to present a scheme to locate for single textual items and idioms in textual order their corresponding dictionary entries stored in an IBM 1301 random access mechanism. Textual items are considered to be 24 characters in length (left justified with following blanks). A dictionary entry consists of a 24 character Russian form, grammar information for the form and a set of translations for that form. Dictionary entries are packed into sequential tracks of the 1301. This paper will cover the method used for dictionary storage. The lookup for a textual item I first consists of a search for the first track that the dictionary entry E (if one exists) for I could be stored in. Once a track has been determined its contents are searched in core by a bisection convergence technique to find E. If E cannot be found, a {\textquotedblleft}no entry{\textquotedblright} indication is made. If E is found a further search is made of the dictionary to find the longest sequence of text, starting with the first item I, that has a dictionary entry. The last such entry found is picked up. Included in the presentation will be examples of the dictionary lookup output for actual text.

null

105,628

inproceedings

borkowski-micklesen-1963-generative

Generative processes for {R}ussian impersonal sentences

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.3/

Borkowski, C. G. and Micklesen, L. R.

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

Impersonal sentences of Russian are those traditionally construed to consist of predicates only. Ever since the first Russian grammar was compiled, they have continued to pose a problem for grammarians. This paper is intended to be a review and evaluation of all types of the so-called impersonal sentences in the Russian language. The investigation of these sentences has been conducted in terms of their relationships to basic (kernel) sentences. Our paper attempts to define the origin for such impersonal sentences, i.e., how such sentences might be derived within the framework of a generative grammar from a set of rules possessing maximal simplicity and maximal generative power. The long-range aim of this investigation involves the most efficient manipulation of such sentences in a recognition device for Russian-English MT.

null

105,629

inproceedings

brady-estes-1963-concerning

Concerning the role of sub-grammars in machine translation

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.4/

Brady, Joyce M. and Estes, William B.

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

The comprehensive grammars being developed at the Linguistics Research Center of the University of Texas will be too large for easy access and manipulation in either experimental programs or practical translation. It is necessary, therefore, to devise some reliable method for selecting subsets of the grammar rules which will be reasonably adequate for a given purpose. Since the majority of the rules are dictionary rules, this problem is closely related both to the problem of constructing microglossaries and to the subsequent problem of choosing a particular microglossary suitable to a given text. Our current approach to this problem entails the construction of key word lists in the first stage of analysis which guide the computer in its choice of a previously constructed microglossary. Work to date indicates adaptations of this technique may not only contribute to the solution of storage and access problems but also facilitate analysis and simplify problems of semantic resolution.

null

105,630

inproceedings

darlington-1963-translating

Translating ordinary language into symbolic logic

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.6/

Darlington, Jared L.

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

The paper describes a computer program, written in COMIT, for translating ordinary English into the notation of propositional logic and first-order functional logic. The program is designed to provide an ordinary language input to a COMIT program for the David-Putnam proof-procedure algorithm. The entire set of operations which are performed on an input sentence or argument are divided into three stages. In Stage I, an input sentence {\textquoteleft}S', such as {\textquotedblleft}The composer who wrote {\textquoteleft}Alcina' wrote some operas in English,{\textquotedblright} is rewritten in a quasi-logical notation, {\textquotedblleft}The X/A such that X/A is a composer and X/A wrote Alcina wrote some X/B such that X/B is an opera and X/B is in English.{\textquotedblright} The quasi-logical notation serves as an intermediate language between logic and ordinary English. In Stage II, S is translated into the logical notation of propositional functions and quantifiers, or of propositional logic, whichever is appropriate. In Stage III, S is run through the proof-procedure program and evaluated. (The sample sentence quoted is of course {\textquoteleft}invalid', i.e. nontautological.) The COMIT program for Stage III is complete, that for Stage II is almost complete, and that for Stage I is incomplete. The paper describes the work done to date on the programs for Stages I and II.

null

105,632

inproceedings

dolby-resnikoff-1963-graphic

The graphic structure of word-breaking

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.7/

Dolby, J. L. and Resnikoff, H. L.

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

In a recent paper1 the authors have shown that it is possible to determine the possible parts of speech of English words from an analysis of the written form. This determination depends upon the ability to determine the number of graphic syllables in the word. It is natural, then, to speculate as to the nature of graphic syllabification and the relation of this phenomenon to the practice of word-breaking in dictionaries and style manuals. It is not at all clear at the start that dictionary wordbreaking is subject to any fixed structure. In fact, certain forms cannot be broken uniquely in isolation since the dictionary provides different forms depending upon whether the word is used as a noun or a verb. However, it is shown in this paper that letter strings can be decomposed into 3 sets of roughly the same size in the following manner: in the first, strings are never broken in English words; in the second, the strings are always broken in English words; and in the third, both situations occur. Rules for breaking vowel strings are obtained by a study of the CVC forms. Breaks involving consonants can be determined by noting whether or not the consonant string occurs in penultimate position with the final c. The final e in compounds also serves to identify the forms that are generally split off from the rest of the word. A thorough analysis is made of the accuracy of the rules given when applied to the 12,000 words of the Government Printing Office Style Manual Supplement on word-breaking. Comparisons are also drawn between this source and several American dictionaries on the basis of a random sample of 500 words.

null

105,633

inproceedings

dougherty-1963-writing

Writing of {C}hinese recognition grammar for machine translation

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.8/

Dougherty, Ching-yi

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

Our approach to this problem is based on the stratificational grammar outlined and the procedures proposed by Dr. Sydney Lamb. How the theory and the procedures can be applied to written Chinese is briefly discussed. For the time being our research is limited to the particular kind of written Chinese found in chemical and biochemical journals. First the Chinese lexes are classified by detailed syntactical analysis, then binary grammar rules are constructed for joining two primary or constitute classes. How a more and more refined classification can eliminate one by one the ambiguity resulting from all possible constructions arising from juxtaposition of two distributional classes is discussed in detail.

null

105,634

inproceedings

edmundson-1963-behavior

The behavior of {E}nglish articles

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.9/

Edmundson, H. P.

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

Machine translation has often been conceived as consisting of three steps: analysis of source-language sentence, transformation of analyzed pieces, and synthesis of target-language sentence. This paper is concerned with one aspect of the last step, namely, the rules of behavior of English articles. Since the classical definitions of definite and indefinite articles are operationally imprecise, proper mechanistic rules must be formulated in order to permit the automatic insertion or non-insertion of English articles. The rules discussed are of syntactic origin; however, note is also taken of their semantic aspects. This paper describes the methods used to derive these rules and offers ideas for further research.

null

105,635

inproceedings

gammon-1963-representing

On representing syntactic structure

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.10/

Gammon, E. R.

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

The idea of sentence depth of Yngve (A Model and an Hypothesis for Language Structure, Proc. Am. Phil. Soc., Vol. 104, No. 5, Oct. 1960) is extended to the notion of {\textquotedblleft}distance{\textquotedblright} between constituents of a construction. The distance between constituents is defined as a weighted sum of the number of IC cuts separating them. Yngve`s depth is then a maximum distance from a sentence to any of its words. Various systems of weighting cuts are investigated. For example, in endocentric structures we may require that the distance from an attribute to the structure exceeds the distance from the head to the structure, and in exocentric structures that the distances from each constituent to the structure are equal. Representations of constructions are considered which preserve the distance between constituents. It is shown that it is impossible to represent some sentences in Euclidean space with exact distances, but a representation may be found if only relative order is preserved. If more general spaces are used then exact distances may be represented. It follows that for a wide class of sentence types, there is a weighting, and a space, in which the distance preserving representations are identical with the diagrams of traditional grammar.

null

105,636

inproceedings

giuliano-1963-word

Word and context association by means of linear networks

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.12/

Giuliano, Vincent E.

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

This paper is concerned with the use of electrical networks for the automatic recognition of statistical associations among words and contexts present in written text. A general mathematical theory is proposed for association by means of linear transformations, and it is shown that this theory can be realized through use of passive linear electrical networks. Several smallscale experimental associative networks have been built, and are briefly described in the paper; one such device will be demonstrated in the course of the oral presentation of the paper. Some of the devices generate measures of association among index terms used to characterize a document collection, and between the index terms and the documents themselves. Another uses syntactic proximity within sentences as a criterion for the generation of word association measures. Examples are given of associations produced by these network devices. It is conjectured that the networkproduced association measures reflect two distinct types of linguistic association{---}{\textquotedblleft}synonymy{\textquotedblright} association which reflects similarity of meaning, and {\textquotedblleft}contiguity{\textquotedblright} association which reflects real-world relationships among designata.

null

105,638

inproceedings

harper-1963-study

A study of the combinatorial properties of {R}ussian nouns

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.13/

Harper, Kenneth E.

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

A statistical study was made of the extent to which Russian nouns enter into certain kinds of syntactic combination. The basis of the study was a corpus of 180,000 running words of Russian physics text prepared for analysis by the Automatic Language Data Processing group at The Rand Corporation; for each sentence of text the syntactic dependency of each word had been previously coded. A data retrieval program was applied, showing for each noun in text the number of occurrences (a) with at least one genitive noun dependent, (b) with at least one adjective dependent, and (c) with either type of dependent. A listing of all nouns in text (64,026 occurrences of 2,993 nouns) was prepared, ordered by frequency, and showing counts for a, b, and c above. Separate listings were prepared, showing for each noun that occurred 50 times or more the probability P that it would be modified in each of these three ways; these listings were ordered on P. The data suggests, among others, the following conclusions: there is statistical significance in the variability with which nouns enter into the given combinations; the partial interchangeability of adjective and genitive noun modification is supported; a general correspondence exists between combinatorial groupings of nouns and morphological or semantic groupings (concrete nouns have low P for genitive complementation, abstract nouns have high P, etc); the use of words in a given field of discourse can be determined empirically (e.g., the use of deverbative nouns either to indicate a process or the result of a process). It is suggested that the distributional approach is a useful supplement to traditional syntactic and semantic classification schemes, and that it is of direct utility in automatic parsing programs.

null

105,639

inproceedings

hays-1963-connectability

Connectability calculations, syntactic functions, and {R}ussian syntax

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.14/

Hays, David G.

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

A program for sentence-structure determination can be divided into routines for analysis of word order and for testing the grammatical connectability of pairs of sentence members. The present paper describes a connectability-test routine that uses the technique called code matching. This technique requires elaborate descriptions of individual items, say the words or morphemes listed in a dictionary, but it avoids the use of large tables or complicated programs for testing connectability. Development of the technique also leads to a certain clarification of the linguistic concepts of function, exocentrism, and homography. In the present paper, a format for the description of Russian items is offered and a program for testing the connectability of pairs of Russian items is sketched. This system recognizes nine dominative functions: subjective; first, second, and third complementary; first, second, and third auxiliary; modifying; and predicative. The nature of a program for testing connectability with respect to coordinative functions (coordination, apposition, etc.) is suggested.

null

105,640

inproceedings

hoffman-etal-1963-application

Application of decision tables to syntactic analysis

null

25-26

1963

Denver, Colorado

null

https://aclanthology.org/1963.earlymt-1.16/

Hoffman, Walter and Janiotis, Amelia and Simon, Sidney

Proceedings of the Annual meeting of the Association for Machine Translation and Computational Linguistics

null

Decision tables have recently become an object of investigation as a possible means of improving problem formulation of data processing procedures. The initial emphasis for this new tool came from systems analysts who were primarily concerned with business data processing problems. The purpose of this paper is to investigate the suitability of decision tables as a means of expressing syntactic relations as an alternative to customary flow charting techniques. The history of decision tables will be briefly reviewed and several kinds of decision tables will be defined. As an example, parts of the predicative blocking routine developed at Wayne State University will be presented as formulated with the aid of decision tables. The aim of the predicative blocking routine is to group a predicative form together with its modal and temporal auxiliaries, infinitive complements, and negative particle, if any of these exist. The object of the search is to define such a syntactic block, but it may turn out instead that an infinitive phrase is defined or that a possible predicative form turns out to be an adverb.

null

105,642