@article {13704,
	title = {A Lexical Conceptual Approach to Generation for Machine Translation},
	year = {1988},
	month = {1988/01//},
	institution = {MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB},
	abstract = {Current approaches to generation for machine translation make use of direct-replacement templates, large grammars, and knowledge-based inferencing techniques. Not only are rules language-specific, but they are too simplistic to handle sentences that exhibit more complex phenomena. Furthermore, these systems are not easily extendable to other languages because the rules that map the internal representation to the surface form are entirely dependent on both the domain of the system and the language being generated. Finally an adequate interlingual representation has not yet been discovered; thus, knowledge-based inferencing is necessary and syntactic cross-linguistic generalization cannot be exploited. This report introduces a plan for the development of a theoretically based computational scheme of natural language generation for a translation system. The emphasis of the project is the mapping from the lexical conceptual structure of sentences to an underlying or base syntactic structure called deep structure. This approach tackles the problems of thematic and structural divergence, i.e., it allows generation of target language sentences that are not thematically or structurally equivalent to their conceptually equivalent source language counterparts. Two other more secondary tasks, construction of a dictionary and mapping from deep structure to surface structure, will also be discussed. The generator operates on a constrained grammatical theory rather than on a set of surface level tranformations.},
	keywords = {*MACHINE TRANSLATION, *NATURAL LANGUAGE, *SYSTEMS APPROACH, COMPUTATIONS, CYBERNETICS, Dictionaries, grammars, internal, LEXICOGRAPHY, SURFACES, syntax, THEORY, TRANSLATIONS, WORDS(LANGUAGE)},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA197356},
	author = {Dorr, Bonnie J}
}
@article {11984,
	title = {Determining the Translation of a Rigidly Moving Surface, without Correspondence,},
	year = {1986},
	month = {1986/01//},
	abstract = {A method is presented for the recovery of the three-dimensional translation of a rigidly moving textured object from its images. The novelty of the method consists of the fact that four cameras are used in order to avoid the solution of the correspondence problem. The method seems to be immune to small noise percentages and to have good behavior when the noise increases. Keywords: Computer vision.},
	keywords = {*IMAGE PROCESSING, *OPTICAL DETECTION, *Translation(Image processing), CAMERAS, Computer vision, COMPUTERS, IMMUNITY., MOTION, MOVING TARGETS, NOISE, OPTICAL DETECTION AND DETECTORS, SURFACES, THREE DIMENSIONAL, VISION},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA179409},
	author = {Aloimonos, J. and Basu, Anup}
}
@article {15672,
	title = {Voronoi Diagrams on the Surface of a Polyhedron.},
	year = {1985},
	month = {1985/05//},
	institution = {CENTER FOR AUTOMATION RESEARCH, UNIVERSITY OF MARYLAND COLLEGE PARK},
	abstract = {This document presents an algorithm that computes the Voronol diagram of a set of point lying on the surface of a possibly nonconvex polyhedron. Distances are measured in the Euclidean metric along the surface of the polyhedron. The algorithm runs in O(n squared log n) time and requires O(n squared) space to store the final data structure, where n is the maximum of the number of edges and source points on the polyhedron. This algorithm generalizes or improves the running times of a number of shortest path problems both on polyhedra and in the plane amidst polygonal obstacles. By applying standard algorithms for point location, we can determine the distance from a query point to the nearest source in O(log n) time and can list the shortest path in O(k + log n) time, where k is the number of faces traversed by the path. The algorithm achieves its efficiency by a novel method of searching the polyhedron{\textquoteright}s surface. (Author)},
	keywords = {*POLYGONS, *Polyhedrons, algorithms, DIAGRAMS., EDGES, INTERROGATION, PATHS, PE61102F, POSITION(LOCATION), SURFACES, THEORETICAL MATHEMATICS, WUAFOSR2304A7},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA166220},
	author = {Mount, Dave}
}
