- Home
- e-Journals
- Lingvisticæ Investigationes
- Previous Issues
- Volume 22, Issue 1-2, 1998
Lingvisticæ Investigationes - Volume 22, Issue 1-2, 1998
Volume 22, Issue 1-2, 1998
-
Projet CORAIL
Author(s): Frederic Meunier, Antonio Balvet and Thierry Poibeaupp.: 369–381 (13)More LessThis article shows how a high-quality filtering architecture for targetted documents can be achieved by adapting the intex system to the domain (i.e. ‘economic intelligence’), when expressed in finite state automata filters. A push system named corail (‘request composition by linguistic intelligent agents’) is described, developed by a consortium comprising Thomson-CSF Corporate Laboratory (senior partner), Informatique-CDC, the University of Paris X/CRIS, and the ladl. Both practical and theoretical issues regarding the use of finite state automata are discussed, as for example the notion of the ‘automaton classes’ which are to be used as a paraphrasing agent in the process of document filtering. This project can be considered as an example of how linguistics and computer science can interact in anatural language processing task to meet high-quality standards, namely avoiding noise and reducing silence, thus offering an alternative solution to traditional push systems based on simple keyword-matching. A prototype of the corail system is now operational at Thomson-CSF Central Laboratory and Informatique-CDC.
-
Des lexiques pour la terminologie médicale
Author(s): Pierre Zweigenbaumpp.: 383–395 (13)More LessWe present experiments performed with intex to process medical terms. One of our aims is to identify terms in patient discharge summaries that denote diagnoses and procedures, in order to help in the coding of these diagnoses and procedures in the context of the French national coding programme (pmsi). Some of the experiments presented here have been performed on corpora of the menelas project (P. Zweigenbaum & Consortium menelas 1995) or in the framework of the dome project (B. Séroussi et al. 1996). We have built for this purpose specialised lexica which contain specific semantic features. The search for relevant terms is then performed through regular expressions that make use of these features. For these experiments, intex was mainly used in the form of pipes of Unix filters called through a “ Makefile ”, the principles of which we also briefly present.
-
Quatrième Partie: Le débogueur de grammaires sous INTEX
Author(s): Nathalie Friburger and Max Silberzteinpp.: 399–412 (14)More Lessintex system users have to describe linguistic facts with grammars written by the graph editor. When the number of graphs is important, finding and locating errors is a difficult task. In this article, we suggest a solution using a technique derived from computer science: debugging. To debug graphs, we offer an interface belonging to the intex system to help linguists in their works. We explain how we use Earley’s algorithm, borrowed from graph theory, to create the debugger and demonstrate the usefulness of this debugger for building graphs based on examples.
-
Enhancing the INTEX morphological parser with lexical constraints
Author(s): Christina Motapp.: 413–423 (11)More LessThe purpose of this work is to enhance the morphological parser of intex so it can identify inflected forms that satisfy one or more lexical constraints. These constraints will be stated using expressions such as: un þVþable= unpredictable þAþíssimo= altíssimo(very tall) þNþito = librito (little book)Enhancement of the parser will allow not only identification of words with a certain derivational structure, but also identification of words formed by concatenation of other words. In German, this is a routine process in the creation of compound nouns: þAþþNþ = Dunkelblau (dark blue) þNþþNþþNþ= Haustürschlüssel(key of the door of the house)Such linguistic phenomena are also found in English: þAþþNþ = blackboard, and in Romance languages: þADVþþAþ= bienvenue(welcome) þADVþþAþ= bendisposto(well-disposed) þNþþAþ = aguardente (firewater)We discuss problems encountered in the integration of this new feature into the morphological parser, and propose some solutions.
-
Traitement des expressions figées avec INTEX
Author(s): Max Silberzteinpp.: 425–449 (25)More LessThe intex lexical parser processes linguistic units of four formal types: morphemes, simple words, compound words and frozen expressions. Frozen expressions are units spelled in the form of non-contiguous sequences of tokens (eg. take ... into account), and their recognition requires computation traditionally performed by syntactic parsers. Over 30,000 French frozen expressions have been described in the tables Cxx of the lexicon-grammar. We show how to use these tables to automatically construct FSTs that are capable of recognizing and tagging frozen expressions in texts. Representing the result as tags poses some formal problems that we discuss.
Volumes & issues
-
Volume 47 (2024)
-
Volume 46 (2023)
-
Volume 45 (2022)
-
Volume 44 (2021)
-
Volume 43 (2020)
-
Volume 42 (2019)
-
Volume 41 (2018)
-
Volume 40 (2017)
-
Volume 39 (2016)
-
Volume 38 (2015)
-
Volume 37 (2014)
-
Volume 36 (2013)
-
Volume 35 (2012)
-
Volume 34 (2011)
-
Volume 33 (2010)
-
Volume 32 (2009)
-
Volume 31 (2008)
-
Volume 30 (2007)
-
Volume 29 (2006)
-
Volume 28 (2005)
-
Volume 27 (2004)
-
Volume 26 (2003)
-
Volume 25 (2002)
-
Volume 24 (2001)
-
Volume 23 (2000)
-
Volume 22 (1998)
-
Volume 21 (1997)
-
Volume 20 (1996)
-
Volume 19 (1995)
-
Volume 18 (1994)
-
Volume 17 (1993)
-
Volume 16 (1992)
-
Volume 15 (1991)
-
Volume 14 (1990)
-
Volume 13 (1989)
-
Volume 12 (1988)
-
Volume 11 (1987)
-
Volume 10 (1986)
-
Volume 9 (1985)
-
Volume 8 (1984)
-
Volume 7 (1983)
-
Volume 6 (1982)
-
Volume 5 (1981)
-
Volume 4 (1980)
-
Volume 3 (1979)
-
Volume 2 (1978)
-
Volume 1 (1977)
Most Read This Month
Article
content/journals/15699927
Journal
10
5
false
