id large_stringlengths 9 16 | title large_stringlengths 1 382 | abstract large_stringlengths 3 6.09k | publish_date date32 | update_date date32 | categories large listlengths 1 13 | authors large_stringlengths 3 62.8k |
|---|---|---|---|---|---|---|
cmp-lg/9506013 | A Study of the Context(s) in a Specific Type of Texts: Car Accident
Reports | This paper addresses the issue of defining context, and more specifically the
different contexts needed for understanding a particular type of texts. The
corpus chosen is homogeneous and allows us to determine characteristic
properties of the texts from which certain inferences can be drawn by the
reader. These charact... | 1995-06-13 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Dominique Estival (ISSCO, Universite de Geneve), Francoise Gayral
(LIPN, Universite Paris-Nord) |
cmp-lg/9506011 | Unification-Based Glossing | We present an approach to syntax-based machine translation that combines
unification-style interpretation with statistical processing. This approach
enables us to translate any Japanese newspaper article into English, with
quality far better than a word-for-word translation. Novel ideas include the
use of feature struc... | 1995-06-10 | 2009-09-25 | [
"cmp-lg",
"cs.CL"
] | Vasileios Hatzivassiloglou (Columbia University) and Kevin Knight
(USC/Information Sciences Institute) |
cmp-lg/9506009 | Filling Knowledge Gaps in a Broad-Coverage Machine Translation System | Knowledge-based machine translation (KBMT) techniques yield high quality in
domains with detailed semantic models, limited vocabulary, and controlled input
grammar. Scaling up along these dimensions means acquiring large knowledge
resources. It also means behaving reasonably when definitive knowledge is not
yet availab... | 1995-06-10 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Kevin Knight, Ishwar Chander, Matthew Haines, Vasileios
Hatzivassiloglou, Eduard Hovy, Masayo Iida, Steve K. Luk, Richard Whitney,
Kenji Yamada (USC/Information Sciences Institute) |
cmp-lg/9506012 | Presenting Punctuation | Until recently, punctuation has received very little attention in the
linguistics and computational linguistics literature. Since the publication of
Nunberg's (1990) monograph on the topic, however, punctuation has seen its
stock begin to rise: spurred in part by Nunberg's ground-breaking work, a
number of valuable inq... | 1995-06-10 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Michael White (CoGenTex, Inc.) |
cmp-lg/9506010 | Two-level, Many-Paths Generation | Large-scale natural language generation requires the integration of vast
amounts of knowledge: lexical, grammatical, and conceptual. A robust generator
must be able to operate well even when pieces of knowledge are missing. It must
also be robust against incomplete or inaccurate inputs. To attack these
problems, we hav... | 1995-06-10 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Kevin Knight (USC/Information Sciences Institute) and Vasileios
Hatzivassiloglou (Columbia University) |
cmp-lg/9506008 | CLiFF Notes: Research in the Language, Information and Computation
Laboratory of the University of Pennsylvania | Short abstracts by computational linguistics researchers at the University of
Pennsylvania describing ongoing individual and joint projects. | 1995-06-09 | 2012-08-27 | [
"cmp-lg",
"cs.CL"
] | Editors: Matthew Stone and Libby Levison |
cmp-lg/9506006 | Automatic Extraction of Tagset Mappings from Parallel-Annotated Corpora | This paper describes some of the recent work of project AMALGAM (automatic
mapping among lexico-grammatical annotation models). We are investigating ways
to map between the leading corpus annotation schemes in order to improve their
resuability. Collation of all the included corpora into a single large
annotated corpus... | 1995-06-08 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | John Hughes, Clive Souter and Eric Atwell (University of Leeds, UK) |
cmp-lg/9506007 | Features and Agreement | This paper compares the consistency-based account of agreement phenomena in
`unification-based' grammars with an implication-based account based on a
simple feature extension to Lambek Categorial Grammar (LCG). We show that the
LCG treatment accounts for constructions that have been recognized as
problematic for `unifi... | 1995-06-08 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Sam Bayer and Mark Johnson (Brown University) |
cmp-lg/9506005 | A Support Tool for Tagset Mapping | Many different tagsets are used in existing corpora; these tagsets vary
according to the objectives of specific projects (which may be as far apart as
robust parsing vs. spelling correction). In many situations, however, one would
like to have uniform access to the linguistic information encoded in corpus
annotations w... | 1995-06-08 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Simone Teufel (IMS-CL, University of Stuttgart) |
cmp-lg/9506004 | Using Higher-Order Logic Programming for Semantic Interpretation of
Coordinate Constructs | Many theories of semantic interpretation use lambda-term manipulation to
compositionally compute the meaning of a sentence. These theories are usually
implemented in a language such as Prolog that can simulate lambda-term
operations with first-order unification. However, for some interesting cases,
such as a Combinator... | 1995-06-06 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Seth Kulick (University of Pennsylvania) |
cmp-lg/9506003 | Syllable parsing in English and French | In this paper I argue that Optimality Theory provides for an explanatory
model of syllabic parsing in English and French. The argument is based on
psycholinguistic facts that have been mysterious up to now. This argument is
further buttressed by the computational implementation developed here. This
model is important f... | 1995-06-02 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Michael Hammond (University of Arizona) |
cmp-lg/9506002 | Weak subsumption Constraints for Type Diagnosis: An Incremental
Algorithm | We introduce constraints necessary for type checking a higher-order
concurrent constraint language, and solve them with an incremental algorithm.
Our constraint system extends rational unification by constraints x$\subseteq$
y saying that ``$x$ has at least the structure of $y$'', modelled by a weak
instance relation b... | 1995-06-02 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Martin Mueller, Joachim Niehren (German Research Center for Artificial
Intelligence (DFKI), Saarbr"ucken, mmueller) |
cmp-lg/9506001 | Ma(r)king concessions in English and German | In order to generate cohesive discourse, many of the relations holding
between text segments need to be signalled to the reader by means of cue words,
or {\em discourse markers}. Programs usually do this in a simplistic way, e.g.,
by using one marker per relation. In reality, however, language offers a very
wide range ... | 1995-06-01 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Brigitte Grote (FAW Ulm), Nils Lenke (Universitaet Duisburg), Manfred
Stede (FAW Ulm and University of Toronto) |
cmp-lg/9505045 | Hybrid Transfer in an English-French Spoken Language Translator | The paper argues the importance of high-quality translation for spoken
language translation systems. It describes an architecture suitable for rapid
development of high-quality limited-domain translation systems, which has been
implemented within an advanced prototype English to French spoken language
translator. The f... | 1995-05-26 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Manny Rayner (SRI International, Cambridge, UK), Pierrette Bouillon
(ISSCO, Geneva, Switzerland) |
cmp-lg/9505044 | Automatic Evaluation and Uniform Filter Cascades for Inducing N-Best
Translation Lexicons | This paper shows how to induce an N-best translation lexicon from a bilingual
text corpus using statistical properties of the corpus together with four
external knowledge sources. The knowledge sources are cast as filters, so that
any subset of them can be cascaded in a uniform framework. A new objective
evaluation mea... | 1995-05-25 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | I. Dan Melamed (University of Pennsylvania) |
cmp-lg/9505042 | Robust Parsing Based on Discourse Information: Completing partial parses
of ill-formed sentences on the basis of discourse information | In a consistent text, many words and phrases are repeatedly used in more than
one sentence. When an identical phrase (a set of consecutive words) is repeated
in different sentences, the constituent words of those sentences tend to be
associated in identical modification patterns with identical parts of speech
and ident... | 1995-05-24 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Tetsuya Nasukawa (IBM Research, Tokyo Research Laboratory) |
cmp-lg/9505043 | Using Decision Trees for Coreference Resolution | This paper describes RESOLVE, a system that uses decision trees to learn how
to classify coreferent phrases in the domain of business joint ventures. An
experiment is presented in which the performance of RESOLVE is compared to the
performance of a manually engineered set of rules for the same task. The
results show th... | 1995-05-24 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Joseph F. McCarthy and Wendy G. Lehnert (University of Massachusetts) |
cmp-lg/9505040 | Text Chunking using Transformation-Based Learning | Eric Brill introduced transformation-based learning and showed that it can do
part-of-speech tagging with fairly high accuracy. The same method can be
applied at a higher level of textual interpretation for locating chunks in the
tagged text, including non-recursive ``baseNP'' chunks. For this purpose, it is
convenient... | 1995-05-23 | 2009-09-25 | [
"cmp-lg",
"cs.CL"
] | Lance A. Ramshaw (Bowdoin College) and Mitchell P. Marcus (University
of Pennsylvania) |
cmp-lg/9505039 | Generating efficient belief models for task-oriented dialogues | We have shown that belief modelling for dialogue can be simplified if the
assumption is made that the participants are cooperating, i.e., they are not
committed to any goals requiring deception. In such domains, there is no need
to maintain individual representations of deeply nested beliefs; instead, three
specific ty... | 1995-05-23 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Jasper Taylor (Human Communication Research Centre University of
Edinburgh) |
cmp-lg/9505038 | Ubiquitous Talker: Spoken Language Interaction with Real World Objects | Augmented reality is a research area that tries to embody an electronic
information space within the real world, through computational devices. A
crucial issue within this area, is the recognition of real world objects or
situations.
In natural language processing, it is much easier to determine
interpretations of ut... | 1995-05-23 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Katashi Nagao and Jun Rekimoto (Sony Computer Science Laboratory Inc.) |
cmp-lg/9505041 | On Descriptive Complexity, Language Complexity, and GB | We introduce $L^2_{K,P}$, a monadic second-order language for reasoning about
trees which characterizes the strongly Context-Free Languages in the sense that
a set of finite trees is definable in $L^2_{K,P}$ iff it is (modulo a
projection) a Local Set---the set of derivation trees generated by a CFG. This
provides a fl... | 1995-05-23 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | James Rogers (Institute for Research in Cognitive Science, University
of Pennsylvania) |
cmp-lg/9505037 | Identifying Word Translations in Non-Parallel Texts | Common algorithms for sentence and word-alignment allow the automatic
identification of word translations from parallel texts. This study suggests
that the identification of word translations should also be possible with
non-parallel and even unrelated texts. The method proposed is based on the
assumption that there is... | 1995-05-22 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Reinhard Rapp (ISSCO, University of Geneva) |
cmp-lg/9505036 | Integrating Gricean and Attentional Constraints | This paper concerns how to generate and understand discourse anaphoric noun
phrases. I present the results of an analysis of all discourse anaphoric noun
phrases (N=1,233) in a corpus of ten narrative monologues, where the choice
between a definite pronoun or phrasal NP conforms largely to Gricean
constraints on inform... | 1995-05-19 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Rebecca J. Passonneau (Bellcore) |
cmp-lg/9505035 | Development of a Spanish Version of the Xerox Tagger | This paper describes work performed withing the CRATER ({\em C}orpus {\em
R}esources {\em A}nd {\em T}erminology {\em E}xt{\em R}action, MLAP-93/20)
project, funded by the Commission of the European Communities. In particular,
it addresses the issue of adapting the Xerox Tagger to Spanish in order to tag
the Spanish ve... | 1995-05-19 | 2016-08-15 | [
"cmp-lg",
"cs.CL"
] | Fernando S\'anchez Le\'on (Laboratorio de Ling\"u\'istica
Inform\'atica, Facultad de Filosof\'ia y Letras, Universidad Aut\'onoma de
Madrid), and Amalio F. Nieto Serrano (Departamento de Ingenier\'ia de
Sistemas Telem\'aticos, Escuela Superior de Ingenieros de Telecomunicaciones,
Universidad Polit\'ecnica de Ma... |
cmp-lg/9505033 | User-Defined Nonmonotonicity in Unification-Based Formalisms | A common feature of recent unification-based grammar formalisms is that they
give the user the ability to define his own structures. However, this
possibility is mostly limited and does not include nonmonotonic operations. In
this paper we show how nonmonotonic operations can also be user-defined by
applying default lo... | 1995-05-16 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Lena Stromback (Department of Computer and Information Science
Linkoping University, Sweden) |
cmp-lg/9505034 | Semantic Ambiguity and Perceived Ambiguity | I explore some of the issues that arise when trying to establish a connection
between the underspecification hypothesis pursued in the NLP literature and
work on ambiguity in semantics and in the psychological literature. A theory of
underspecification is developed `from the first principles', i.e., starting
from a def... | 1995-05-16 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Massimo Poesio (University of Edinburgh, Centre for Cognitive Science) |
cmp-lg/9505030 | Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic
Inheritance Hierarchy | This paper shows how DATR, a widely used formal language for lexical
knowledge representation, can be used to define an LTAG lexicon as an
inheritance hierarchy with internal lexical rules. A bottom-up featural
encoding is used for LTAG trees and this allows lexical rules to be implemented
as covariation constraints wi... | 1995-05-15 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Roger Evans (University of Brighton), Gerald Gazdar, David Weir
(University of Sussex) |
cmp-lg/9505032 | Context and ontology in understanding of dialogs | We present a model of NLP in which ontology and context are directly included
in a grammar. The model is based on the concept of {\em construction},
consisting of a set of features of form, a set of semantic and pragmatic
conditions describing its application context, and a description of its
meaning. In this model ont... | 1995-05-15 | 2016-08-31 | [
"cmp-lg",
"cs.CL"
] | Wlodek Zadrozny (IBM Research, T. J. Watson Research Center) |
cmp-lg/9505031 | The Compactness of Construction Grammars | We present an argument for {\em construction grammars} based on the minimum
description length (MDL) principle (a formal version of the Ockham Razor). The
argument consists in using linguistic and computational evidence in setting up
a formal model, and then applying the MDL principle to prove its superiority
with resp... | 1995-05-15 | 2016-08-31 | [
"cmp-lg",
"cs.CL"
] | Wlodek Zadrozny (IBM Research, T. J. Watson Research Center) |
cmp-lg/9505029 | Mapping Scrambled Korean Sentences into English Using Synchronous TAGs | Synchronous Tree Adjoining Grammars can be used for Machine Translation.
However, translating a free order language such as Korean to English is
complicated. I present a mechanism to translate scrambled Korean sentences into
English by combining the concepts of Multi-Component TAGs (MC-TAGs) and
Synchronous TAGs (STAGs... | 1995-05-13 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Hyun S. Park, (University of Cambridge) |
cmp-lg/9505028 | D-Tree Grammars | DTG are designed to share some of the advantages of TAG while overcoming some
of its limitations. DTG involve two composition operations called subsertion
and sister-adjunction. The most distinctive feature of DTG is that, unlike TAG,
there is complete uniformity in the way that the two DTG operations relate
lexical it... | 1995-05-12 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Owen Rambow, K. Vijay-Shanker, and David Weir |
cmp-lg/9505026 | Tagging the Teleman Corpus | Experiments were carried out comparing the Swedish Teleman and the English
Susanne corpora using an HMM-based and a novel reductionistic statistical
part-of-speech tagger. They indicate that tagging the Teleman corpus is the
more difficult task, and that the performance of the two different taggers is
comparable. | 1995-05-11 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Thorsten Brants and Christer Samuelsson (Universit"at des Saarlandes,
Computational Linguistics, Saarbr"ucken, Germany) |
cmp-lg/9505027 | Quantifier Scope and Constituency | Traditional approaches to quantifier scope typically need stipulation to
exclude readings that are unavailable to human understanders. This paper shows
that quantifier scope phenomena can be precisely characterized by a semantic
representation constrained by surface constituency, if the distinction between
referential ... | 1995-05-11 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Jong C. Park (Department of Computer and Information Science,
University of Pennsylvania) |
cmp-lg/9505024 | Exploring the role of Punctuation in Parsing Natural Text | Few, if any, current NLP systems make any significant use of punctuation.
Intuitively, a treatment of punctuation seems necessary to the analysis and
production of text. Whilst this has been suggested in the fields of discourse
structure, it is still unclear whether punctuation can help in the syntactic
field. This inv... | 1995-05-10 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Bernard Jones (Centre for Cognitive Science, University of Edinburgh,
UK) |
cmp-lg/9505023 | Some Novel Applications of Explanation-Based Learning to Parsing
Lexicalized Tree-Adjoining Grammars | In this paper we present some novel applications of Explanation-Based
Learning (EBL) technique to parsing Lexicalized Tree-Adjoining grammars. The
novel aspects are (a) immediate generalization of parses in the training set,
(b) generalization over recursive structures and (c) representation of
generalized parses as Fi... | 1995-05-10 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | B. Srinivas and Aravind Joshi (Department of Computer and Information
Science, University of Pennsylvania) |
cmp-lg/9505025 | Combining Multiple Knowledge Sources for Discourse Segmentation | We predict discourse segment boundaries from linguistic features of
utterances, using a corpus of spoken narratives as data. We present two methods
for developing segmentation algorithms from training data: hand tuning and
machine learning. When multiple types of features are used, results approach
human performance on... | 1995-05-10 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Diane J. Litman (AT\&T Bell Laboratories) and Rebecca J. Passonneau
(Bellcore) |
cmp-lg/9505022 | Generating One-Anaphoric Expressions: Where Does the Decision Lie? | Most natural language generation systems embody mechanisms for choosing
whether to subsequently refer to an already-introduced entity by means of a
pronoun or a definite noun phrase. Relatively few systems, however, consider
referring to entites by means of one-anaphoric expressions such as
\lingform{the small green on... | 1995-05-09 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Robert Dale (Microsoft, Sydney) |
cmp-lg/9505021 | Improving the Efficiency of a Generation Algorithm for Shake and Bake
Machine Translation Using Head-Driven Phrase Structure Grammar | A Shake and Bake machine translation algorithm for Head-Driven Phrase
Structure Grammar is introduced based on the algorithm proposed by Whitelock
for unification categorial grammar. The translation process is then analysed to
determine where the potential sources of inefficiency reside, and some
proposals are introduc... | 1995-05-09 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Fred Popowich (Simon Fraser University) |
cmp-lg/9505020 | CRYSTAL: Inducing a Conceptual Dictionary | One of the central knowledge sources of an information extraction system is a
dictionary of linguistic patterns that can be used to identify the conceptual
content of a text. This paper describes CRYSTAL, a system which automatically
induces a dictionary of "concept-node definitions" sufficient to identify
relevant inf... | 1995-05-09 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Stephen Soderland, David Fisher, Jonathan Aseltine, Wendy Lehnert
(University of Massachusetts) |
cmp-lg/9505018 | Acquiring a Lexicon from Unsegmented Speech | We present work-in-progress on the machine acquisition of a lexicon from
sentences that are each an unsegmented phone sequence paired with a primitive
representation of meaning. A simple exploratory algorithm is described, along
with the direction of current work and a discussion of the relevance of the
problem for chi... | 1995-05-08 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Carl de Marcken (MIT AI Laboratory) |
cmp-lg/9505017 | Robust Parsing of Spoken Dialogue Using Contextual Knowledge and
Recognition Probabilities | In this paper we describe the linguistic processor of a spoken dialogue
system. The parser receives a word graph from the recognition module as its
input. Its task is to find the best path through the graph. If no complete
solution can be found, a robust mechanism for selecting multiple partial
results is applied. We s... | 1995-05-08 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Gerhard Hanrieder and Guenther Goerz (Bavarian Research Center for
Knowledge Based Systems, Erlangen, Germany) |
cmp-lg/9505019 | Measuring semantic complexity | We define {\em semantic complexity} using a new concept of {\em meaning
automata}. We measure the semantic complexity of understanding of prepositional
phrases, of an "in depth understanding system", and of a natural language
interface to an on-line calendar. We argue that it is possible to measure some
semantic comple... | 1995-05-08 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Wlodek Zadrozny (IBM Research, T. J. Watson Research Center) |
cmp-lg/9505016 | A Pattern Matching method for finding Noun and Proper Noun Translations
from Noisy Parallel Corpora | We present a pattern matching method for compiling a bilingual lexicon of
nouns and proper nouns from unaligned, noisy parallel texts of
Asian/Indo-European language pairs. Tagging information of one language is
used. Word frequency and position information for high and low frequency words
are represented in two differ... | 1995-05-06 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Pascale Fung (Computer Science Department, Columbia Univ) |
cmp-lg/9505013 | Utilizing Statistical Dialogue Act Processing in Verbmobil | In this paper, we present a statistical approach for dialogue act processing
in the dialogue component of the speech-to-speech translation system \vm.
Statistics in dialogue processing is used to predict follow-up dialogue acts.
As an application example we show how it supports repair when unexpected
dialogue states oc... | 1995-05-05 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Norbert Reithinger and Elisabeth Maier (DFKI GmbH, Saarbr\"ucken,
Germany) |
cmp-lg/9505014 | Compositionality for Presuppositions over Tableaux | Tableaux originate as a decision method for a logical language. They can also
be extended to obtain a structure that spells out all the information in a set
of sentences in terms of truth value assignments to atomic formulas that appear
in them. This approach is pursued here. Over such a structure, compositional
rules ... | 1995-05-05 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Pablo Gervas (Department of Computing, Imperial College, London) |
cmp-lg/9505015 | Efficient Analysis of Complex Diagrams using Constraint-Based Parsing | This paper describes substantial advances in the analysis (parsing) of
diagrams using constraint grammars. The addition of set types to the grammar
and spatial indexing of the data make it possible to efficiently parse real
diagrams of substantial complexity. The system is probably the first to
demonstrate efficient di... | 1995-05-05 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Robert P. Futrelle and Nikos Nikolakis (Northeastern U.) |
cmp-lg/9505011 | Evaluation of Semantic Clusters | Semantic clusters of a domain form an important feature that can be useful
for performing syntactic and semantic disambiguation. Several attempts have
been made to extract the semantic clusters of a domain by probabilistic or
taxonomic techniques. However, not much progress has been made in evaluating
the obtained sema... | 1995-05-04 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Rajeev Agarwal (Mississippi State University) |
cmp-lg/9505012 | A Symbolic and Surgical Acquisition of Terms through Variation | Terminological acquisition is an important issue in learning for NLP due to
the constant terminological renewal through technological changes. Terms play a
key role in several NLP-activities such as machine translation, automatic
indexing or text understanding. In opposition to classical once-and-for-all
approaches, we... | 1995-05-04 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Christian Jacquemin (Institut de Recherches en Informatique de Nantes) |
cmp-lg/9505007 | Parsing a Flexible Word Order Language | A logic formalism is presented which increases the expressive power of the
ID/LP format of GPSG by enlarging the inventory of ordering relations and
extending the domain of their application to non-siblings. This allows a
concise, modular and declarative statement of intricate word order
regularities. | 1995-05-03 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Vladimir Pericliev and Alexander Grigorov (Institute of Mathematics,
Sofia, Bulgaria) |
cmp-lg/9505010 | Tagset Reduction Without Information Loss | A technique for reducing a tagset used for n-gram part-of-speech
disambiguation is introduced and evaluated in an experiment. The technique
ensures that all information that is provided by the original tagset can be
restored from the reduced one. This is crucial, since we are interested in the
linguistically motivated ... | 1995-05-03 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Thorsten Brants (Universit\"at des Saarlandes, Computational
Linguistics) |
cmp-lg/9505006 | Treating Coordination with Datalog Grammars | In previous work we studied a new type of DCGs, Datalog grammars, which are
inspired on database theory. Their efficiency was shown to be better than that
of their DCG counterparts under (terminating) OLDT-resolution. In this article
we motivate a variant of Datalog grammars which allows us a meta-grammatical
treatment... | 1995-05-03 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Veronica Dahl, Paul Tarau, Lidia Moreno, Manolo Palomar |
cmp-lg/9505008 | Conciseness through Aggregation in Text Generation | Aggregating different pieces of similar information is necessary to generate
concise and easy to understand reports in technical domains. This paper
presents a general algorithm that combines similar messages in order to
generate one or more coherent sentences for them. The process is not as trivial
as might be expecte... | 1995-05-03 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | James Shaw (Columbia University) |
cmp-lg/9505009 | Compilation of HPSG to TAG | We present an implemented compilation algorithm that translates HPSG into
lexicalized feature-based TAG, relating concepts of the two theories. While
HPSG has a more elaborated principle-based theory of possible phrase
structures, TAG provides the means to represent lexicalized structures more
explicitly. Our objective... | 1995-05-03 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Robert Kasper (Ohio State University), Bernd Kiefer (DFKI
Saarbruecken), Klaus Netter (DFKI Saarbruecken), and K. Vijay-Shanker
(University of Delaware) |
cmp-lg/9505003 | Compiling HPSG type constraints into definite clause programs | We present a new approach to HPSG processing: compiling HPSG grammars
expressed as type constraints into definite clause programs. This provides a
clear and computationally useful correspondence between linguistic theories and
their implementation. The compiler performs off-line constraint inheritance and
code optimiza... | 1995-05-02 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Thilo Goetz and Walt Detmar Meurers (SFB 340, Univ. Tuebingen) |
cmp-lg/9505004 | DATR Theories and DATR Models | Evans and Gazdar introduced DATR as a simple, non-monotonic language for
representing natural language lexicons. Although a number of implementations of
DATR exist, the full language has until now lacked an explicit, declarative
semantics. This paper rectifies the situation by providing a mathematical
semantics for DAT... | 1995-05-02 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Bill Keller (University of Sussex) |
cmp-lg/9505005 | Learning Syntactic Rules and Tags with Genetic Algorithms for
Information Retrieval and Filtering: An Empirical Basis for Grammatical Rules | The grammars of natural languages may be learned by using genetic algorithms
that reproduce and mutate grammatical rules and part-of-speech tags, improving
the quality of later generations of grammatical components. Syntactic rules are
randomly generated and then evolve; those rules resulting in improved parsing
and oc... | 1995-05-02 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Robert M. Losee (U. of North Carolina, Chapel Hill) |
cmp-lg/9504034 | Bayesian Grammar Induction for Language Modeling | We describe a corpus-based induction algorithm for probabilistic context-free
grammars. The algorithm employs a greedy heuristic search within a Bayesian
framework, and a post-pass using the Inside-Outside algorithm. We compare the
performance of our algorithm to n-gram models and the Inside-Outside algorithm
in three ... | 1995-05-01 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Stanley F. Chen (Harvard University) |
cmp-lg/9505001 | Response Generation in Collaborative Negotiation | In collaborative planning activities, since the agents are autonomous and
heterogeneous, it is inevitable that conflicts arise in their beliefs during
the planning process. In cases where such conflicts are relevant to the task at
hand, the agents should engage in collaborative negotiation as an attempt to
square away ... | 1995-05-01 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Jennifer Chu-Carroll and Sandra Carberry (University of Delaware) |
cmp-lg/9505002 | New Techniques for Context Modeling | We introduce three new techniques for statistical language models: extension
modeling, nonmonotonic contexts, and the divergence heuristic. Together these
techniques result in language models that have few states, even fewer
parameters, and low message entropies. For example, our techniques achieve a
message entropy of... | 1995-05-01 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Eric Sven Ristad and Robert G. Thomas (Princeton University) |
cmp-lg/9504030 | Statistical Decision-Tree Models for Parsing | Syntactic natural language parsers have shown themselves to be inadequate for
processing highly-ambiguous large-vocabulary text, as is evidenced by their
poor performance on domains like the Wall Street Journal, and by the movement
away from parsing-based approaches to text-processing in general. In this
paper, I descr... | 1995-04-29 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | David M. Magerman |
cmp-lg/9504032 | The Replace Operator | This paper introduces to the calculus of regular expressions a replace
operator, ->, and defines a set of replacement expressions that concisely
encode several alternate variations of the operation.
The basic case is unconditional obligatory replacement:
UPPER -> LOWER
Conditional versions of replacement, such as... | 1995-04-29 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Lauri Karttunen, Rank Xerox Research Centre |
cmp-lg/9504031 | Error-tolerant Finite State Recognition with Applications to
Morphological Analysis and Spelling Correction | Error-tolerant recognition enables the recognition of strings that deviate
mildly from any string in the regular set recognized by the underlying finite
state recognizer. Such recognition has applications in error-tolerant
morphological processing, spelling correction, and approximate string matching
in information ret... | 1995-04-29 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Kemal Oflazer (Department of Computer Engineering and Information
Science Bilkent University, Ankara Turkey) |
cmp-lg/9504028 | Memoization of Coroutined Constraints | Some linguistic constraints cannot be effectively resolved during parsing at
the location in which they are most naturally introduced. This paper shows how
constraints can be propagated in a memoizing parser (such as a chart parser) in
much the same way that variable bindings are, providing a general treatment of
const... | 1995-04-28 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Mark Johnson (Brown University) and Jochen D\"orre (Universit\"at
Stuttgart) |
cmp-lg/9504026 | The intersection of Finite State Automata and Definite Clause Grammars | Bernard Lang defines parsing as the calculation of the intersection of a FSA
(the input) and a CFG. Viewing the input for parsing as a FSA rather than as a
string combines well with some approaches in speech understanding systems, in
which parsing takes a word lattice as input (rather than a word string).
Furthermore, ... | 1995-04-28 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Gertjan van Noord (Alfa-informatica and BCN, Groningen) |
cmp-lg/9504033 | Corpus Statistics Meet the Noun Compound: Some Empirical Results | A variety of statistical methods for noun compound analysis are implemented
and compared. The results support two main conclusions. First, the use of
conceptual association not only enables a broad coverage, but also improves the
accuracy. Second, an analysis model based on dependency grammar is
substantially more accu... | 1995-04-28 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Mark Lauer (Microsoft Institute, Sydney) |
cmp-lg/9504029 | Quantifiers, Anaphora, and Intensionality | The relationship between Lexical-Functional Grammar (LFG) {\em functional
structures} (f-structures) for sentences and their semantic interpretations can
be expressed directly in a fragment of linear logic in a way that correctly
explains the constrained interactions between quantifier scope ambiguity, bound
anaphora a... | 1995-04-28 | 2016-08-31 | [
"cmp-lg",
"cs.CL"
] | Mary Dalrymple (Xerox PARC), John Lamping (Xerox PARC), Fernando
Pereira (AT&T Bell Laboratories), Vijay Saraswat (Xerox PARC) |
cmp-lg/9504027 | An Efficient Generation Algorithm for Lexicalist MT | The lexicalist approach to Machine Translation offers significant advantages
in the development of linguistic descriptions. However, the Shake-and-Bake
generation algorithm of (Whitelock, COLING-92) is NP-complete. We present a
polynomial time algorithm for lexicalist MT generation provided that sufficient
information ... | 1995-04-28 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Victor Poznanski, John L. Beaven, Pete Whitelock |
cmp-lg/9504025 | Discourse Processing of Dialogues with Multiple Threads | In this paper we will present our ongoing work on a plan-based discourse
processor developed in the context of the Enthusiast Spanish to English
translation system as part of the JANUS multi-lingual speech-to-speech
translation system. We will demonstrate that theories of discourse which
postulate a strict tree structu... | 1995-04-27 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Carolyn Penstein Rose' (Carnegie Mellon University), Barbara Di
Eugenio (Carnegie Mellon University), Lori S. Levin (Carnegie Mellon
University), Carol Van Ess-Dykema (Department Of Defense) |
cmp-lg/9504024 | A Morphographemic Model for Error Correction in Nonconcatenative Strings | This paper introduces a spelling correction system which integrates
seamlessly with morphological analysis using a multi-tape formalism. Handling
of various Semitic error problems is illustrated, with reference to Arabic and
Syriac examples. The model handles errors vocalisation, diacritics, phonetic
syncopation and mo... | 1995-04-27 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Tanya Bowden (University of Cambridge) and George Anton Kiraz
(University of Cambridge) |
cmp-lg/9504017 | A Uniform Treatment of Pragmatic Inferences in Simple and Complex
Utterances and Sequences of Utterances | Drawing appropriate defeasible inferences has been proven to be one of the
most pervasive puzzles of natural language processing and a recurrent problem
in pragmatics. This paper provides a theoretical framework, called ``stratified
logic'', that can accommodate defeasible pragmatic inferences. The framework
yields an ... | 1995-04-26 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Daniel Marcu and Graeme Hirst (University of Toronto) |
cmp-lg/9504023 | TAKTAG: Two-phase learning method for hybrid statistical/rule-based
part-of-speech disambiguation | Both statistical and rule-based approaches to part-of-speech (POS)
disambiguation have their own advantages and limitations. Especially for
Korean, the narrow windows provided by hidden markov model (HMM) cannot cover
the necessary lexical and long-distance dependencies for POS disambiguation. On
the other hand, the ru... | 1995-04-26 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Geunbae Lee, Jong-Hyeok Lee, Sanghyun Shin (Department of Computer
Science & Engineering and Postech Information Research Laboratory, Pohang
University of Science & Technology) |
cmp-lg/9504021 | Phonological Derivation in Optimality Theory | Optimality Theory is a constraint-based theory of phonology which allows
constraints to be violated. Consequently, implementing the theory presents
problems for declarative constraint-based processing frameworks. On the basis
of two regularity assumptions, that candidate sets are regular and that
constraints can be mod... | 1995-04-26 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | T. Mark Ellison (now INESC, Lisbon) |
cmp-lg/9504019 | A Formalism and an Algorithm for Computing Pragmatic Inferences and
Detecting Infelicities | Since Austin introduced the term ``infelicity'', the linguistic literature
has been flooded with its use, but no formal or computational explanation has
been given for it. This thesis provides one for those infelicities that occur
when a pragmatic inference is cancelled.
Our contribution assumes the existence of a fi... | 1995-04-26 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Daniel Marcu (University of Toronto) |
cmp-lg/9504022 | Constraints, Exceptions and Representations | This paper shows that default-based phonologies have the potential to capture
morphophonological generalisations which cannot be captured by non-defaul
theories. In achieving this result, I offer a characterisation of
Underspecification Theory and Optimality Theory in terms of their methods for
ordering defaults. The r... | 1995-04-26 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | T. Mark Ellison (currently INESC, Lisbon) |
cmp-lg/9504018 | An Implemented Formalism for Computing Linguistic Presuppositions and
Existential Commitments | We rely on the strength of linguistic and philosophical perspectives in
constructing a framework that offers a unified explanation for presuppositions
and existential commitment. We use a rich ontology and a set of methodological
principles that embed the essence of Meinong's philosophy and Grice's
conversational princ... | 1995-04-26 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Daniel Marcu and Graeme Hirst (University of Toronto) |
cmp-lg/9504020 | Computational Interpretations of the Gricean Maxims in the Generation of
Referring Expressions | We examine the problem of generating definite noun phrases that are
appropriate referring expressions; i.e, noun phrases that (1) successfully
identify the intended referent to the hearer whilst (2) not conveying to her
any false conversational implicatures (Grice, 1975). We review several possible
computational interp... | 1995-04-26 | 2016-08-31 | [
"cmp-lg",
"cs.CL"
] | Robert Dale (Microsoft, Sydney) and Ehud Reiter (CoGenTeX, Ithaca) |
cmp-lg/9504016 | Memoization of Top Down Parsing | This paper discusses the relationship between memoized top-down recognizers
and chart parsers. It presents a version of memoization suitable for
continuation-passing style programs. When applied to a simple formalization of
a top-down recognizer it yields a terminating parser. | 1995-04-25 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Mark Johnson (Brown University) |
cmp-lg/9504014 | LexGram - a practical categorial grammar formalism - | We present the LexGram system, an amalgam of (Lambek) categorial grammar and
Head Driven Phrase Structure Grammar (HPSG), and show that the grammar
formalism it implements is a well-structured and useful tool for actual grammar
development. | 1995-04-24 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Esther Koenig (University of Stuttgart) |
cmp-lg/9504015 | Estimating Lexical Priors for Low-Frequency Syncretic Forms | Given a previously unseen form that is morphologically n-ways ambiguous, what
is the best estimator for the lexical prior probabilities for the various
functions of the form? We argue that the best estimator is provided by
computing the relative frequencies of the various functions among the hapax
legomena --- the form... | 1995-04-24 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Harald Baayen (Max Planck Institute for Psycholinguistics), Richard
Sproat (AT&T Bell Laboratories) |
cmp-lg/9504013 | NLG vs. Templates | One of the most important questions in applied NLG is what benefits (or
`value-added', in business-speak) NLG technology offers over template-based
approaches. Despite the importance of this question to the applied NLG
community, however, it has not been discussed much in the research NLG
community, which I think is a ... | 1995-04-23 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Ehud Reiter (CoGenTex, Ithaca, USA) |
cmp-lg/9504012 | Linear Logic for Meaning Assembly | Semantic theories of natural language associate meanings with utterances by
providing meanings for lexical items and rules for determining the meaning of
larger units given the meanings of their parts. Meanings are often assumed to
combine via function application, which works well when constituent structure
trees are ... | 1995-04-18 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Mary Dalrymple, John Lamping, Fernando Pereira, and Vijay Saraswat |
cmp-lg/9504011 | A Processing Model for Free Word Order Languages | Like many verb-final languages, Germn displays considerable word-order
freedom: there is no syntactic constraint on the ordering of the nominal
arguments of a verb, as long as the verb remains in final position. This effect
is referred to as ``scrambling'', and is interpreted in transformational
frameworks as leftward ... | 1995-04-15 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Owen Rambow and Aravind K. Joshi |
cmp-lg/9504009 | Abstract Machine for Typed Feature Structures | This paper describes an abstract machine for linguistic formalisms that are
based on typed feature structures, such as HPSG. The core design of the
abstract machine is given in detail, including the compilation process from a
high-level language to the abstract machine language and the implementation of
the abstract in... | 1995-04-13 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Shuly Wintner and Nissim Francez (Computer Science, Technion, Israel
Institute of Techniology, Haifa 32000, Israel) |
cmp-lg/9504010 | MAXIMUM LIKELIHOOD AND MINIMUM ENTROPY IDENTIFICATION OF GRAMMARS | Using the Thermodynamic Formalism, we introduce a Gibbsian model for the
identification of regular grammars based only on positive evidence. This model
mimics the natural language acquisition procedure driven by prosody which is
here represented by the thermodynamical potential. The statistical question we
face is how ... | 1995-04-13 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | P.Collet (CNRS), A.Galves (USP), A.Lopes (UFRGS) |
cmp-lg/9504008 | SKOPE: A connectionist/symbolic architecture of spoken Korean processing | Spoken language processing requires speech and natural language integration.
Moreover, spoken Korean calls for unique processing methodology due to its
linguistic characteristics. This paper presents SKOPE, a connectionist/symbolic
spoken Korean processing engine, which emphasizes that: 1) connectionist and
symbolic te... | 1995-04-07 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Geunbae Lee and Jong-Hyeok Lee (Department of Computer Science &
Engineering and Postech Information Research Laboratory Pohang University of
Science & Technology, Hoja-Dong, Pohang, Korea) |
cmp-lg/9504007 | Mixed Initiative in Dialogue: An Investigation into Discourse
Segmentation | Conversation between two people is usually of mixed-initiative, with control
over the conversation being transferred from one person to another. We apply a
set of rules for the transfer of control to 4 sets of dialogues consisting of a
total of 1862 turns. The application of the control rules lets us derive
domain-inde... | 1995-04-05 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Marilyn Walker (University of Pennsylvania), Steve Whittaker (Hewlett
Packard Laboratories) |
cmp-lg/9504006 | Cues and control in Expert-Client Dialogues | We conducted an empirical analysis into the relation between control and
discourse structure. We applied control criteria to four dialogues and
identified 3 levels of discourse structure. We investigated the mechanism for
changing control between these structures and found that utterance type and not
cue words predicte... | 1995-04-05 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Steve Whittaker (Hewlett Packard Laboratories), Phil Stenton (Hewlett
Packard Laboratories) |
cmp-lg/9504005 | Constraint Logic Programming for Natural Language Processing | This paper proposes an evaluation of the adequacy of the constraint logic
programming paradigm for natural language processing. Theoretical aspects of
this question have been discussed in several works. We adopt here a pragmatic
point of view and our argumentation relies on concrete solutions. Using actual
contraints (... | 1995-04-05 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Philippe Blache (2LC-CNRS) and Nabil Hathout (INaLF-CNRS) |
cmp-lg/9504003 | Collaborating on Referring Expressions | This paper presents a computational model of how conversational participants
collaborate in order to make a referring action successful. The model is based
on the view of language as goal-directed behavior. We propose that the content
of a referring expression can be accounted for by the planning paradigm. Not
only doe... | 1995-04-04 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Peter A. Heeman (University of Rochester) and Graeme Hirst (University
of Toronto) |
cmp-lg/9504004 | A Computational Treatment of HPSG Lexical Rules as Covariation in
Lexical Entries | We describe a compiler which translates a set of HPSG lexical rules and their
interaction into definite relations used to constrain lexical entries. The
compiler ensures automatic transfer of properties unchanged by a lexical rule.
Thus an operational semantics for the full lexical rule mechanism as used in
HPSG lingui... | 1995-04-04 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Walt Detmar Meurers and Guido Minnen (SFB 340, Univ. T"ubingen) |
cmp-lg/9504001 | Automatic processing proper names in texts | This paper shows first the problems raised by proper names in natural
language processing. Second, it introduces the knowledge representation
structure we use based on conceptual graphs. Then it explains the techniques
which are used to process known and unknown proper names. At last, it gives the
performance of the sy... | 1995-04-03 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Francis Wolinski, Frantz Vichot, Bruno Dillet (Informatique CDC) |
cmp-lg/9504002 | Tagset Design and Inflected Languages | An experiment designed to explore the relationship between tagging accuracy
and the nature of the tagset is described, using corpora in English, French and
Swedish. In particular, the question of internal versus external criteria for
tagset design is considered, with the general conclusion that external
(linguistic) cr... | 1995-04-03 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | David Elworthy |
cmp-lg/9503025 | Co-occurrence Vectors from Corpora vs. Distance Vectors from
Dictionaries | A comparison was made of vectors derived by using ordinary co-occurrence
statistics from large text corpora and of vectors derived by measuring the
inter-word distances in dictionary definitions. The precision of word sense
disambiguation by using co-occurrence vectors from the 1987 Wall Street Journal
(20M total words... | 1995-04-01 | 2016-08-31 | [
"cmp-lg",
"cs.CL"
] | Yoshiki Niwa and Yoshihiko Nitta (ARL, Hitachi, Ltd.) |
cmp-lg/9503024 | From compositional to systematic semantics | We prove a theorem stating that any semantics can be encoded as a
compositional semantics, which means that, essentially, the standard definition
of compositionality is formally vacuous. We then show that when compositional
semantics is required to be "systematic" (that is, the meaning function cannot
be arbitrary, but... | 1995-03-24 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Wlodek Zadrozny |
cmp-lg/9503023 | A fast partial parse of natural language sentences using a connectionist
method | The pattern matching capabilities of neural networks can be used to locate
syntactic constituents of natural language. This paper describes a fully
automated hybrid system, using neural nets operating within a grammatic
framework. It addresses the representation of language for connectionist
processing, and describes m... | 1995-03-22 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Caroline Lyon and Bob Dickerson (University of Hertfordshire) |
cmp-lg/9503021 | A Note on the Complexity of Restricted Attribute-Value Grammars | The recognition problem for attribute-value grammars (AVGs) was shown to be
undecidable by Johnson in 1988. Therefore, the general form of AVGs is of no
practical use. In this paper we study a very restricted form of AVG, for which
the recognition problem is decidable (though still NP-complete), the R-AVG. We
show that... | 1995-03-21 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Leen Torenvliet and Marten Trautwein (University of Amsterdam) |
cmp-lg/9503022 | Assessing Complexity Results in Feature Theories | In this paper, we assess the complexity results of formalisms that describe
the feature theories used in computational linguistics. We show that from these
complexity results no immediate conclusions can be drawn about the complexity
of the recognition problem of unification grammars using these feature
theories. On th... | 1995-03-21 | 2008-02-03 | [
"cmp-lg",
"cs.CL"
] | Marten Trautwein (University of Amsterdam) |
cmp-lg/9503019 | SATZ - An Adaptive Sentence Segmentation System | This paper provides a detailed description of the sentence segmentation
system first introduced in cmp-lg/9411022. It provides results of systematic
experiments involving sentence boundary determination, including context size,
lexicon size, and single-case texts. Also included are the results of
successfully adapting ... | 1995-03-20 | 2016-08-31 | [
"cmp-lg",
"cs.CL"
] | David D. Palmer (University of California at Berkeley) |
cmp-lg/9503020 | Different Issues in the Design of a Lemmatizer/Tagger for Basque | This paper presents relevant issues that have been considered in the design
of a general purpose lemmatizer/tagger for Basque (EUSLEM). The
lemmatizer/tagger is conceived as a basic tool necessary for other linguistic
applications. It uses the lexical data base and the morphological analyzer
previously developed and im... | 1995-03-20 | 2009-09-25 | [
"cmp-lg",
"cs.CL"
] | I. Aduriz, I. Alegria, J. M. Arriola, X. Artola, Diaz de Illarraza A.,
N. Ezeiza, K. Gojenola, M. Maritxalar |
cmp-lg/9503018 | Discourse and Deliberation: Testing a Collaborative Strategy | A discourse strategy is a strategy for communicating with another agent.
Designing effective dialogue systems requires designing agents that can choose
among discourse strategies. We claim that the design of effective strategies
must take cognitive factors into account, propose a new method for testing the
hypothesized... | 1995-03-16 | 2016-08-31 | [
"cmp-lg",
"cs.CL"
] | Marilyn A. Walker (Mitsubishi Electric Research Laboratories) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.