|
Q-systems
Q-systems are a method of directed graph transformations according to given grammar rules, developed at the Université de Montréal by Alain Colmerauer in 1967–70 for use in natural language processing. The Université de Montréal's machine translation system, TAUM system, TAUM-73, used the Q-Systems as its language formalism. The data structure manipulated by a Q-system is a Q-graph, which is a directed acyclic graph with one entry node and one exit node, where each arc bears a labelled ordered tree. An input sentence is usually represented by a linear Q-graph where each arc bears a word (tree reduced to one node labelled by this word). After analysis, the Q-graph is usually a bundle of 1-arc paths, each arc bearing a possible analysis tree. After generation, the goal is usually to produce as many paths as desired outputs, with again one word per arc. A Q-System consists of a sequence of Q-treatments, each being a set of Q-rules, of the form []. The Q-treatments are appli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
METEO System
The METEO System is a machine translation system specifically designed for the translation of the weather forecasts issued daily by Environment Canada. The system was used from 1981 to 30 September 2001 by Environment Canada to translate forecasts issued in French in the province of Quebec into English and those issued in English in other Canadian provinces into French. , July 30, 2002, consulted 2007-02-10 Since then, a competitor program has replaced METEO System after an open governmental bid. The system was developed by John Chandioux and was often mentioned as one of the few success stories in the field of machine translation. History The METEO System was in operational use at Environment Canada fro ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alain Colmerauer
Alain Colmerauer (24 January 1941 – 12 May 2017) was a French computer scientist. He was a professor at Aix-Marseille University, and the creator of the logic programming language Prolog. Early life Alain Colmerauer was born on 24 January 1941 in Carcassonne. He graduated from the Grenoble Institute of Technology, and he earned a PhD from the Ensimag in Grenoble. Career Colmerauer spent 1967–1970 as assistant professor at the University of Montreal, where he created Q-Systems, one of the earliest linguistic formalisms used in the development of the TAUM-METEO machine translation prototype. Developing Prolog III in 1984, he was one of the main founders of the field of constraint logic programming. Colmerauer became an associate professor at Aix-Marseille University in Luminy in 1970. He was promoted to full professor in 1979. From 1993 to 1995, he was head of the Laboratoire d'Informatique de Marseille (LIM), a joint laboratory of the Centre National de la Recherche Scie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
TAUM System
TAUM (''Traduction Automatique à l'Université de Montréal'') is the name of a research group which was set up at the Université de Montréal in 1965. Most of its research was done between 1968 and 1980. It gave birth to the TAUM-73 and TAUM-METEO machine translation prototypes, using the Q-Systems programming language created by Alain Colmerauer, which were among the first attempts to perform automatic translation through linguistic analysis. The prototypes were never used in actual production. The TAUM-METEO name has been erroneously used for many years to designate the METEO System The METEO System is a machine translation system specifically designed for the translation of the weather forecasts issued daily by Environment Canada. The system was used from 1981 to 30 September 2001 by Environment Canada to translate forecast ... subsequently developed by John Chandioux. External links www.chin.gc.ca Canadian Heritage Information Network, CHIN, 2003 {{Webarchive, url=ht ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Directed Graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. Definition In formal terms, a directed graph is an ordered pair where * ''V'' is a set whose elements are called '' vertices'', ''nodes'', or ''points''; * ''A'' is a set of ordered pairs of vertices, called ''arcs'', ''directed edges'' (sometimes simply ''edges'' with the corresponding set named ''E'' instead of ''A''), ''arrows'', or ''directed lines''. It differs from an ordinary or undirected graph, in that the latter is defined in terms of unordered pairs of vertices, which are usually called ''edges'', ''links'' or ''lines''. The aforementioned definition does not allow a directed graph to have multiple arrows with the same source and target nodes, but some authors consider a broader definition that allows directed graphs to have such multiple arcs (namely, they allow the arc set to be a m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unification (computer Science)
In logic and computer science, unification is an algorithmic process of solving equations between symbolic expressions. Depending on which expressions (also called ''terms'') are allowed to occur in an equation set (also called ''unification problem''), and which expressions are considered equal, several frameworks of unification are distinguished. If higher-order variables, that is, variables representing functions, are allowed in an expression, the process is called higher-order unification, otherwise first-order unification. If a solution is required to make both sides of each equation literally equal, the process is called syntactic or free unification, otherwise semantic or equational unification, or E-unification, or unification modulo theory. A ''solution'' of a unification problem is denoted as a substitution, that is, a mapping assigning a symbolic value to each variable of the problem's expressions. A unification algorithm should compute for a given problem a ''complete ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Linguistics
Computational linguistics is an Interdisciplinarity, interdisciplinary field concerned with the computational modelling of natural language, as well as the study of appropriate computational approaches to linguistic questions. In general, computational linguistics draws upon linguistics, computer science, artificial intelligence, mathematics, logic, philosophy, cognitive science, cognitive psychology, psycholinguistics, anthropology and neuroscience, among others. Sub-fields and related areas Traditionally, computational linguistics emerged as an area of artificial intelligence performed by computer scientists who had specialized in the application of computers to the processing of a natural language. With the formation of the Association for Computational Linguistics (ACL) and the establishment of independent conference series, the field consolidated during the 1970s and 1980s. The Association for Computational Linguistics defines computational linguistics as: The term "comp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Chandioux
John is a common English name and surname: * John (given name) * John (surname) John may also refer to: New Testament Works * Gospel of John, a title often shortened to John * First Epistle of John, often shortened to 1 John * Second Epistle of John, often shortened to 2 John * Third Epistle of John, often shortened to 3 John People * John the Baptist (died c. AD 30), regarded as a prophet and the forerunner of Jesus Christ * John the Apostle (lived c. AD 30), one of the twelve apostles of Jesus * John the Evangelist, assigned author of the Fourth Gospel, once identified with the Apostle * John of Patmos, also known as John the Divine or John the Revelator, the author of the Book of Revelation, once identified with the Apostle * John the Presbyter, a figure either identified with or distinguished from the Apostle, the Evangelist and John of Patmos Other people with the given name Religious figures * John, father of Andrew the Apostle and Saint Peter * Pope John ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Philippe Roussel
Philippe is a masculine sometimes feminin given name, cognate to Philip. It may refer to: * Philippe of Belgium (born 1960), King of the Belgians (2013–present) * Philippe (footballer) (born 2000), Brazilian footballer * Prince Philippe, Count of Flanders, father to Albert I of Belgium * Philippe d'Orléans (other), multiple people * Philippe A. Autexier (1954–1998), French music historian * Philippe Blain, French volleyball player and coach * Philippe Najib Boulos (1902–1979), Lebanese lawyer and politician * Philippe Coutinho, Brazilian footballer * Philippe Daverio (1949–2020), Italian art historian * Philippe Dubuisson-Lebon, Canadian football player * Philippe Ginestet (born 1954), French billionaire businessman, founder of GiFi * Philippe Gilbert, Belgian bicycle racer * Philippe Petit, French performer and tightrope artist * Philippe Petitcolin (born 1952/53), French businessman, CEO of Safran * Philippe Russo, French singer * Philippe Sella, French rugby pla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prolog
Prolog is a logic programming language associated with artificial intelligence and computational linguistics. Prolog has its roots in first-order logic, a formal logic, and unlike many other programming languages, Prolog is intended primarily as a declarative programming language: the program logic is expressed in terms of relations, represented as facts and rules. A computation is initiated by running a ''query'' over these relations. The language was developed and implemented in Marseille, France, in 1972 by Alain Colmerauer with Philippe Roussel, based on Robert Kowalski's procedural interpretation of Horn clauses at University of Edinburgh. Prolog was one of the first logic programming languages and remains the most popular such language today, with several free and commercial implementations available. The language has been used for theorem proving, expert systems, term rewriting, type systems, and automated planning, as well as its original intended field of use, nat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Instance (computer Science)
In a computer system, any time a new context is created based on some model, it is said that the model has been instantiated. In practice, this instance usually has a data structure in common with other instances, but the values stored in the instances are separate. Changing the values in one instance will then not interfere with the values of some other instance. A compute instance can be software or hardware which can run code, for example a CPU, GPU or a virtual machine. Computer graphics In computer graphics, a polygonal model can be instantiated in order to be drawn several times in different locations in a scene. This is a technique that can be used to improve the performance of rendering, since the work needed to display each instance overlaps. Object-oriented programming In object-oriented programming (OOP), an instance is a concrete occurrence of any object, existing usually during the runtime of a computer program. Formally, "instance" is synonymous with "object" ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
