ID large_stringlengths 10 67 | year int64 1.96k 2.03k | title large_stringlengths 4 560 | abstract large_stringlengths 0 12.8k |
|---|---|---|---|
wittenburg-1991-parsing | 1,991 | Parsing with Relational Unification Grammars | 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-... |
costagliola-chang-1991-parsing | 1,991 | Parsing 2-D Languages with Positional Grammars | 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 tw... |
kasper-1989-unification | 1,989 | Unification and Classification: An Experiment in Information-Based Parsing | 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 experi... |
gerdemann-1989-using | 1,989 | Using Restriction to Optimize Unification Parsing | |
maxwell-iii-kaplan-1989-overview | 1,989 | An Overview of Disjunctive Constraint Satisfaction | |
lang-1989-uniform | 1,989 | A Uniform Formal Framework for Parsing | |
satta-stock-1989-head | 1,989 | Head-Driven Bidirectional Parsing: A Tabular Method | |
kay-1989-head | 1,989 | Head-Driven Parsing | |
gibson-1989-parsing | 1,989 | Parsing with Principles: Predicting a Phrasal Node Before Its Head Appears | |
fong-berwick-1989-computational | 1,989 | The Computational Implementation of Principle-Based Parsers | 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... |
fujisaki-etal-1989-probabilistic | 1,989 | Probabilistic Parsing Method for Sentence Disambiguation | |
su-etal-1989-sequential | 1,989 | A Sequential Truncation Parsing Algorithm Based on the Score Function | 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 pa... |
wright-wrigley-1989-probabilistic | 1,989 | Probabilistic LR Parsing for Speech Recognition | 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... |
huber-1989-parsing | 1,989 | Parsing Speech for Structure and Prominence | |
kita-etal-1989-parsing | 1,989 | Parsing Continuous Speech by HMM-LR Method | 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 ... |
kogure-1989-parsing | 1,989 | Parsing Japanese Spoken Sentences Based on HPSG | 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 wh... |
van-zuijlen-1989-probabilistic | 1,989 | Probabilistic Methods in Dependency Grammar Parsing | 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... |
wall-wittenburg-1989-predictive | 1,989 | Predictive Normal Forms for Composition in Categorical Grammars | 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 Gramm... |
steedman-1989-parsing | 1,989 | Parsing Spoken Language Using Combinatory Grammars | |
vijay-shanker-weir-1989-recognition | 1,989 | Recognition of Combinatory Categorial Grammars and Linear Indexed Grammars | |
nozohoor-farshi-1989-handling | 1,989 | Handling of Ill-Designed Grammars in Tomita`s Parsing Algorithm | In this paper, we show that some non-cyclic context-free grammars with $\varepsilon$-rules cannot be handled by Tomita`s algorithm properly. We describe a modified version of the algorithm which remedies the problem. |
kipps-1989-analysis | 1,989 | Analysis of Tomita`s Algorithm for General Context-Free Parsing | 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 red... |
johnson-1989-computational | 1,989 | The Computational Complexity of Tomita`s Algorithm | |
seneff-1989-probabilistic | 1,989 | Probabilistic Parsing for Spoken Language Applications | 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 a... |
mcclelland-1989-connectionist | 1,989 | Connectionist Models of Language | |
jain-waibel-1989-connectionist | 1,989 | A Connectionist Parser Aimed at Spoken Language | 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 ty... |
kitano-etal-1989-massively | 1,989 | Massively Parallel Parsing in $\Phi$DmDialog: Integrated Architecture for Parsing Speech Inputs | 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 pa... |
nijholt-1989-parallel | 1,989 | Parallel Parsing Strategies in Natural Language Processing | 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,... |
hausser-1989-complexity | 1,989 | Complexity and Decidability in Left-Associative Grammar | |
shann-1989-selection | 1,989 | The selection of a parsing strategy for an on-line machine translation system in a sublanguage domain. A new practical comparison | |
black-1989-finite | 1,989 | Finite State Machines from Feature Grammars | 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. Th... |
yamai-etal-1989-effective | 1,989 | An Effective Enumeration Algorithm of Parses for Ambiguous CFL | 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... |
weber-1989-morphological | 1,989 | A Morphological Parser for Linguistic Exploration | |
adriaens-1989-parallel | 1,989 | The Parallel Expert Parser: A Meaning-Oriented, Lexically-Guided, Parallel-Interactive Model of Natural Language Understanding | 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 ... |
thompson-1989-chart | 1,989 | Chart Parsing for Loosely Coupled Parallel Systems | |
tanaka-numazaki-1989-parallel | 1,989 | Parallel Generalized LR Parsing based on Logic Programming | 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... |
schabes-joshi-1989-relevance | 1,989 | The Relevance of Lexicalization to Parsing | In this paper, we investigate the processing of the so-called {\textquoteleft}lexicalized' grammar. In {\textquoteleft}lexicalized' grammars (Schabes, Abeille and Joshi, 1988), each elementary structure is systema tically associated with a lexical {\textquoteleft}head'. These structures specify extended domains of loca... |
marino-1989-framework | 1,989 | A Framework for the Development of Natural Language Grammars | 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... |
malone-felshin-1989-efficient | 1,989 | An Efficient Method for Parsing Erroneous Input | In a natural language processing system designed for language learners, it is necessary to accept both well-formed and ill-formed input. This paper describes a method of maintaining parsing efficiency for well-formed sentences while still accepting a wide range of ill-formed input. |
yoon-kim-1989-analysis | 1,989 | Analysis Techniques for Korean Sentences Based on Lexical Functional Grammar | 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 phen... |
matsumoto-etal-1989-learning | 1,989 | Learning Cooccurrences by using a Parser | 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 ea... |
church-etal-1989-parsing-word | 1,989 | Parsing, Word Associations and Typical Predicate-Argument Relations | 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 pa... |
simpkins-hancox-1989-efficient | 1,989 | An Efficient, Primarily Bottom-Up Parser for Unification Grammars | The search for efficient parsing strategies has a long history, dating back to at least the Cocke/Younger/Kusami parser of the early sixties. The publication of the Earley parser in 1970 has had a significant influence on context-free (CF) parsing for natural language processing, evidenced by the interest in the variet... |
slator-wilks-1989-premo | 1,989 | PREMO: Parsing by Conspicuous Lexical Consumption | 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 que... |
tomita-1989-parsing | 1,989 | Parsing 2-Dimensional Language | 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 fo... |
jensen-1989-broad | 1,989 | A Broad-Coverage Natural Language Analysis System | |
asija-1989-pseudo | 1,989 | Pseudo Parsing Swift-Answer Algorithm | |
hajicova-1989-dependency | 1,989 | A Dependency-Based Parser for Topic and Focus | |
budhiraja-etal-1989-parsing | 1,989 | Parsing Generalized Phrase Structure Grammar with Dynamic Expansion | 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 t... |
thouin-1984-machine | 1,984 | Machine translation from designers to users: management problems and solutions | Today Machine Translation (MT) systems are at best unique combinations of mathematical, linguistic and algorithmic theories, and of the absence of any theory of translation. In most instances, be it or not because of the complexity of the theories and models involved, managers and translators have been kept out, or kep... |
pigott-1984-difficulty | 1,984 | The difficulty of developing logical algorithms for the machine translation of natural language | 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 establ... |
knowles-1984-machine | 1,984 | Machine-aided translation and lexical strategies | 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 ... |
loh-etal-1984-new | 1,984 | A new dictionary structure for bi-directional MT system | 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 ... |
nakamura-nagao-1984-software | 1,984 | A software system for describing a grammar of machine translation: GRADE | A new software system for describing a grammar of a machine translation system has been developed. This software system is called GRADE (GRAmmar DEscriber). GRADE has the following features: 1. GRADE allows a grammar writer to divide a whole grammar into several parts. Each part of the grammar is called a subgrammar. A... |
adorni-massone-1984-production | 1,984 | Production of sentences: a general algorithm and a case study | In this paper a procedure for the production of sentences is described, producing written sentences in a particular language starting from formal representations of their meaning. After a brief description of the internal representation used, the algorithm is presented, and some results and future trends are discussed. |
huang-1984-generation | 1,984 | The generation of Chinese sentences from semantic representations of English sentences | The paper describes the CASSEX package, a parser which takes as input English sentences and produces semantic representations of them, and gives an account of the generation procedure which translates these semantic representations into Chinese sentences. |
melby-1984-machine | 1,984 | Machine translation with post editing versus a three-level integrated translator aid system | 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 t... |
mbaeyi-1984-language | 1,984 | What is the language of memory? | 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 quan... |
habermann-1984-application | 1,984 | Application of SYSTRAN for translation of nuclear technology texts at the Nuclear Center of Karlsruhe | 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 progra... |
arnold-johnson-1984-robust-processing | 1,984 | Robust processing in machine translation | 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) ... |
maas-1984-control | 1,984 | Control and data structures in the MT system SUSY-E | 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 use... |
paskaleva-bulgaria-1982-formal | 1,982 | A Formal Procedure for Bulgarian Word Form Generation | |
lehmann-stachowitz-1971-feasibility | 1,971 | Feasibility study on fully automatic high quality translation | 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... |
bellert-1963-necessity | 1,963 | Necessity of introducing some information provided by transformational analysis into MT algorithms | 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 shoul... |
betz-hoffman-1963-use | 1,963 | The use of a random access device for dictionary lookup | 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... |
borkowski-micklesen-1963-generative | 1,963 | Generative processes for Russian impersonal sentences | 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 Russia... |
brady-estes-1963-concerning | 1,963 | Concerning the role of sub-grammars in machine translation | 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 whic... |
charney-1963-word | 1,963 | Word-meaning and sentence-meaning | A theory of semantics is presented which (1) defines the meanings of the most frequently occurring semantic morphemes ({\textquoteleft}all', {\textquoteleft}unless', {\textquoteleft}only', {\textquoteleft}if', {\textquoteleft}not', etc.), (2) explains their role, as semantically interdependent structural-constants, in ... |
darlington-1963-translating | 1,963 | Translating ordinary language into symbolic logic | 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 operati... |
dolby-resnikoff-1963-graphic | 1,963 | The graphic structure of word-breaking | 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 graph... |
dougherty-1963-writing | 1,963 | Writing of Chinese recognition grammar for machine translation | 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 ... |
edmundson-1963-behavior | 1,963 | The behavior of English articles | 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 ... |
gammon-1963-representing | 1,963 | On representing syntactic structure | 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 ... |
gentilhomme-1963-la | 1,963 | La traduction automatique et l`enseignement du russe | Les recherches effectu{\'e}es depuis quelques ann{\'e}es en vue de la Traduction Automatique ont conduit {\`a} des m{\'e}thodes de travail et {\`a} des r{\'e}sultats int{\'e}ressant la p{\'e}dagogie des langues. Une exp{\'e}rience d`enseignement du russe a l`usage des scientifiques fond{\'e}e sur ces donn{\'e}es a {\'e... |
giuliano-1963-word | 1,963 | Word and context association by means of linear networks | 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 u... |
harper-1963-study | 1,963 | A study of the combinatorial properties of Russian nouns | 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 te... |
hays-1963-connectability | 1,963 | Connectability calculations, syntactic functions, and Russian syntax | 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 de... |
hirschberg-1963-punctuation | 1,963 | Punctuation and automatic syntactic analysis | In this paper we discuss how algorithms for automatic analysis can take advantage of information carried by the punctuation marks. We neglect stylistic aspects of punctuation because they lack universality of usage and we restrict ourselves to those rules which any punctuation must observe in order to be intelligible. ... |
hoffman-etal-1963-application | 1,963 | Application of decision tables to syntactic analysis | 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 inves... |
jaffe-1963-simultaneous | 1,963 | Simultaneous computation of lexical and extralinguistic information measures in dialogue | An approach to the study of information processing in verbal interaction is described. It compares patterns of two indices of dispersion in recorded dialogue. The lexical measure is the mean segmental type{---}token ratio, based on 25-word segments of the running conversation. It is computed from a key punched transcri... |
jonas-1963-design | 1,963 | Design of a generalized information system | While mechanical translation research involves the design of a computer system which simulates language processes, there is the associated problem of collecting the language data which are to be used in translation. Because large quantities of information will be needed, the computer may be useful for data accumulation... |
klein-1963-experiments | 1,963 | Some experiments performed with an automatic paraphraser | The automatic paraphrasing system used in the experiments described herein consisted of a phrase structure, grammatically correct nonsense generator coupled with a monitoring system that required the dependency relations of the sentence in production to be in harmony with those of a source text. The output sentences al... |
klima-1963-interlingual | 1,963 | Interlingual correspondence at the syntactic level | The paper will investigate a few major construction types in several related European languages: relative clauses, attributive phrases, and certain instances of coordinate conjunction involving these constructions. In each of the languages independently, the constructions will be described as resulting from syntactic m... |
kuno-1963-sentence | 1,963 | Sentence structure diagrams | A system for automatically producing a sentence structure diagram for each analysis of a given sentence has been added to the program of the multiple-path syntactic analyzer. A structure code, consisting of a series of structure symbols or phrase markers that identify the successive higher-order structures to which the... |
lamb-1963-linguistic | 1,963 | Linguistic structure and machine translation | If one understands the nature of linguistic structure, one will know what design features an adequate machine translation system must have. To put it the other way around, it is futile to attempt the construction of a machine translation system without a knowledge of what the structure of language is like. This princip... |
lehmann-1963-redundancy | 1,963 | On redundancy in artificial languages | Artificial languages are one concern of work in computational linguistics, if only as a mnemonic device for interlinguas which will be developed. Even if it does not gain wider use, the structure of an artificial language is of general interest. In contrast to the artificial languages which have been widely proposed, l... |
lieberman-1963-procedure | 1,963 | A procedure for automatic sentence structure analysis | The two main considerations in the design of this procedure were the economical recognition and representation of multiple readings of syntactically ambiguous sentences, and general applicability to {\textquotedblleft}all{\textquotedblright} languages (English, Russian, Chinese). The following features will be discusse... |
micklesen-smith-1963-algorithm | 1,963 | An algorithm for the translation of Russian inorganic-chemistry terms | An algorithm has been devised, and a computer program written, to translate certain recurring types of inorganic-chemistry terms from Russian to English. The terms arc all noun-phrases, and several different types of such phrases have been included in the program. Examples are: AZOTNONATRIEVA4 SOL6 sodium nitrate SOL6 ... |
opler-etal-1963-application | 1,963 | The application of table processing concepts to the Sakai translation technique | In 1961, I. Sakai described a new technique for the mechanical translation of languages. The method utilizes large tables which contain the syntactic rules of the source and target languages. As part of a study of the AN/GSQ-16 Lexical Processing Machine, a modification of the Sakai method was developed. Five of six pl... |
pacak-1963-slavic | 1,963 | Slavic languages---comparative morphosyntactic research | An appropriate goal for present-day linguistics is the development of a general theory of relations between languages. One necessary requirement in the development of such a theory is the identification and classification of inflected forms in terms of their morphosyntactic properties in a set of presumably related lan... |
pendergraft-1963-types | 1,963 | Types of language hierarchy | Various relations lead to hierarchical systems of linguistic description. This paper considers briefly a typology of descriptive metalanguages based on such relations and sketches possible consequences for computational linguistics. Its scope is accordingly limited to metalanguages having operational interpretations wh... |
plath-1963-path | 1,963 | Path economization in exhaustive left-to-right syntactic analysis | In exhaustive left-to-right syntactic analysis using the predictive approach, each path of syntactic connection which originates at the beginning of a sentence must be followed until it is clear whether or not it will lead to the production of a well-formed analysis. The original scheme of following each path until it ... |
raphael-1963-computer | 1,963 | A computer representation for semantic information | This paper deals with the problem of representing in a useful form, within a digital computer, the information content of statements in natural language. The model proposed consists of words and list-structure associations between words. Statements in simple English are thought of as describing relations between object... |
tabory-1963-specifications | 1,963 | Specifications for generative grammars used in language data processing | It becomes more and more evident that successful pragmatics (i.e. automatic recognition and production procedures for sentences) cannot be performed without previously written generative grammars for the languages involved, using an underlying meta-theoretical framework proposed by the present school of mathematical li... |
tosh-1963-collecting | 1,963 | Collecting linguistic data for the grammar of a language | Establishing the grammatical description of a language is one of the major tasks facing the technician in machine translation. Another is that of creating the system of programs with which to carry out the translation process. The Linguistics Research Center of The University of Texas recognizes the advantages in maint... |
wahlgren-1963-derivational | 1,963 | Derivational suffixes in Russian general vocabulary and in chemical nomenclature | A grammar based upon a conventional morphemic analysis of Russian will have a rather large inventory of derivational suffixes. A relatively small number of these recur with sufficient generality to acquire lexemic status (i.e., to be what is usually termed {\textquotedblleft}productive{\textquotedblright}). Names of ch... |
yngve-1963-order | 1,963 | On the order of clauses | We used to think that the output of a translation machine would be stylistically inelegant, but this would be tolerable if only the message got across. We now find that getting the message across accurately is difficult, but we may be able to have stylistic elegance in the output since much of style reflects depth phen... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.