id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cmp-lg/9410018 | Part-of-Speech Tagging with Neural Networks | cmp-lg cs.CL | Text corpora which are tagged with part-of-speech information are useful in
many areas of linguistic research. In this paper, a new part-of-speech tagging
method based on neural networks (Net- Tagger) is presented and its performance
is compared to that of a HMM-tagger and a trigram-based tagger. It is shown
that the... |
cmp-lg/9410019 | Concurrent Lexicalized Dependency Parsing: A Behavioral View on
ParseTalk Events | cmp-lg cs.CL | The behavioral specification of an object-oriented grammar model is
considered. The model is based on full lexicalization, head-orientation via
valency constraints and dependency relations, inheritance as a means for
non-redundant lexicon specification, and concurrency of computation. The
computation model relies upo... |
cmp-lg/9410020 | Construction of a Bilingual Dictionary Intermediated by a Third Language | cmp-lg cs.CL | When using a third language to construct a bilingual dictionary, it is
necessary to discriminate equivalencies from inappropriate words derived as a
result of ambiguity in the third language. We propose a method to treat this by
utilizing the structures of dictionaries to measure the nearness of the
meanings of words... |
cmp-lg/9410021 | Reference Resolution Using Semantic Patterns in Japanese Newspaper
Articles | cmp-lg cs.CL | Reference resolution is one of the important tasks in natural language
processing. In this paper, the author first determines the referents and their
locations of "dousha", literally meaning "the same company", which appear in
Japanese newspaper articles. Secondly, three heuristic methods, two of which
use semantic i... |
cmp-lg/9410022 | Automated tone transcription | cmp-lg cs.CL | In this paper I report on an investigation into the problem of assigning
tones to pitch contours. The proposed model is intended to serve as a tool for
phonologists working on instrumentally obtained pitch data from tone languages.
Motivation and exemplification for the model is provided by data taken from my
fieldwo... |
cmp-lg/9410023 | Korean to English Translation Using Synchronous TAGs | cmp-lg cs.CL | It is often argued that accurate machine translation requires reference to
contextual knowledge for the correct treatment of linguistic phenomena such as
dropped arguments and accurate lexical selection. One of the historical
arguments in favor of the interlingua approach has been that, since it revolves
around a dee... |
cmp-lg/9410024 | A Freely Available Wide Coverage Morphological Analyzer for English | cmp-lg cs.CL | This paper presents a morphological lexicon for English that handles more
than 317000 inflected forms derived from over 90000 stems. The lexicon is
available in two formats. The first can be used by an implementation of a
two-level processor for morphological analysis. The second, derived from the
first one for effic... |
cmp-lg/9410025 | Syntactic Analysis Of Natural Language Using Linguistic Rules And
Corpus-based Patterns | cmp-lg cs.CL | We are concerned with the syntactic annotation of unrestricted text. We
combine a rule-based analysis with subsequent exploitation of empirical data.
The rule-based surface syntactic analyser leaves some amount of ambiguity in
the output that is resolved using empirical patterns. We have implemented a
system for gene... |
cmp-lg/9410026 | A Rule-Based Approach To Prepositional Phrase Attachment Disambiguation | cmp-lg cs.CL | In this paper, we describe a new corpus-based approach to prepositional
phrase attachment disambiguation, and present results comparing performance of
this algorithm with other corpus-based approaches to this problem.
|
cmp-lg/9410027 | Probabilistic Tagging with Feature Structures | cmp-lg cs.CL | The described tagger is based on a hidden Markov model and uses tags composed
of features such as part-of-speech, gender, etc. The contextual probability of
a tag (state transition probability) is deduced from the contextual
probabilities of its feature-value-pairs. This approach is advantageous when
the available tr... |
cmp-lg/9410028 | Minimal Change and Bounded Incremental Parsing | cmp-lg cs.CL | Ideally, the time that an incremental algorithm uses to process a change
should be a function of the size of the change rather than, say, the size of
the entire current input. Based on a formalization of ``the set of things
changed'' by an incremental modification, this paper investigates how and to
what extent it is... |
cmp-lg/9410029 | Disambiguation of Super Parts of Speech (or Supertags): Almost Parsing | cmp-lg cs.CL | In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar
(LTAG), each lexical item is associated with at least one elementary structure
(supertag) that localizes syntactic and semantic dependencies. Thus a parser
for a lexicalized grammar must search a large set of supertags to choose the
right o... |
cmp-lg/9410030 | Feature-Based TAG in place of multi-component adjunction: Computational
Implications | cmp-lg cs.CL | Using feature-based Tree Adjoining Grammar (TAG), this paper presents
linguistically motivated analyses of constructions claimed to require
multi-component adjunction. These feature-based TAG analyses permit parsing of
these constructions using an existing unification-based Earley-style TAG
parser, thus obviating the... |
cmp-lg/9410031 | Towards a More User-friendly Correction | cmp-lg cs.CL | We first present our view of detection and correction of syntactic errors. We
then introduce a new correction method, based on heuristic criteria used to
decide which correction should be preferred. Weighting of these criteria leads
to a flexible and parametrable system, which can adapt itself to the user. A
partitio... |
cmp-lg/9410032 | Planning Argumentative Texts | cmp-lg cs.CL | This paper presents \proverb\, a text planner for argumentative texts.
\proverb\'s main feature is that it combines global hierarchical planning and
unplanned organization of text with respect to local derivation relations in a
complementary way. The former splits the task of presenting a particular proof
into subtas... |
cmp-lg/9410033 | Default Handling in Incremental Generation | cmp-lg cs.CL | Natural language generation must work with insufficient input.
Underspecifications can be caused by shortcomings of the component providing
the input or by the preliminary state of incrementally given input. The paper
aims to escape from such dead-end situations by making assumptions. We discuss
global aspects of def... |
cmp-lg/9410034 | A Comparison of Two Smoothing Methods for Word Bigram Models | cmp-lg cs.CL | A COMPARISON OF TWO SMOOTHING METHODS FOR WORD BIGRAM MODELS
Linda Bauman Peto
Department of Computer Science
University of Toronto Abstract Word bigram models estimated from text corpora
require smoothing methods to estimate the probabilities of unseen bigrams. The
deleted estimation method uses the formula:
... |
cmp-lg/9411001 | Sublanguage Terms: Dictionaries, Usage, and Automatic Classification | cmp-lg cs.CL | The use of terms from natural and social scientific titles and abstracts is
studied from the perspective of sublanguages and their specialized
dictionaries. Different notions of sublanguage distinctiveness are explored.
Objective methods for separating hard and soft sciences are suggested based on
measures of sublang... |
cmp-lg/9411002 | CLARE: A Contextual Reasoning and Cooperative Response Framework for the
Core Language Engine | cmp-lg cs.CL | This report describes the research, design and implementation work carried
out in building the CLARE system at SRI International, Cambridge, England.
CLARE was designed as a natural language processing system with facilities for
reasoning and understanding in context and for generating cooperative
responses. The proj... |
cmp-lg/9411003 | Adnominal adjectives, code-switching and lexicalized TAG | cmp-lg cs.CL | In codeswitching contexts, the language of a syntactic head determines the
distribution of its complements. Mahootian 1993 derives this generalization by
representing heads as the anchors of elementary trees in a lexicalized TAG.
However, not all codeswitching sequences are amenable to a head-complement
analysis. For... |
cmp-lg/9411004 | Determining Determiner Sequencing: A Syntactic Analysis for English | cmp-lg cs.CL | Previous work on English determiners has primarily concentrated on their
semantics or scoping properties rather than their complex ordering behavior.
The little work that has been done on determiner ordering generally splits
determiners into three subcategories. However, this small number of categories
does not captu... |
cmp-lg/9411005 | Constraining Lexical Selection Across Languages Using TAGs | cmp-lg cs.CL | Lexical selection in Machine Translation consists of several related
components. Two that have received a lot of attention are lexical mapping from
an underlying concept or lexical item, and choosing the correct
subcategorization frame based on argument structure. Because most MT
applications are small or relatively ... |
cmp-lg/9411006 | Status of the XTAG System | cmp-lg cs.CL | XTAG is an ongoing project to develop a wide-coverage grammar for English,
based on the Feature-based Lexicalized Tree Adjoining Grammar (FB-LTAG)
formalism. The XTAG system integrates a morphological analyzer, an N-best
part-of-speech tagger, an Early-style parser and an X-window interface, along
with a wide-coverag... |
cmp-lg/9411007 | The Linguistic Relevance of Quasi-Trees | cmp-lg cs.CL | We discuss two constructions (long scrambling and ECM verbs) which challenge
most syntactic theories (including traditional TAG approaches) since they seem
to require exceptional mechanisms and postulates. We argue that these
constructions should in fact be analyzed in a similar manner, namely as
involving a verb whi... |
cmp-lg/9411008 | Parsing Free Word-Order Languages in Polynomial Time | cmp-lg cs.CL | We present a parsing algorithm with polynomial time complexity for a large
subset of V-TAG languages. V-TAG, a variant of multi-component TAG, can handle
free-word order phenomena which are beyond the class LCFRS (which includes
regular TAG). Our algorithm is based on a CYK-style parser for TAGs.
|
cmp-lg/9411009 | Bootstrapping A Wide-Coverage CCG from FB-LTAG | cmp-lg cs.CL | A number of researchers have noted the similarities between LTAGs and CCGs.
Observing this resemblance, we felt that we could make use of the wide-coverage
grammar developed in the XTAG project to build a wide-coverage CCG. To our
knowledge there have been no attempts to construct a large-scale CCG parser
with the le... |
cmp-lg/9411010 | The "Whiteboard" Architecture: a way to integrate heterogeneous
components of NLP systems | cmp-lg cs.CL | We present a new software architecture for NLP systems made of heterogeneous
components, and demonstrate an architectural prototype we have built at ATR in
the context of Speech Translation.
|
cmp-lg/9411011 | Acquiring Knowledge from Encyclopedic Texts | cmp-lg cs.CL | A computational model for the acquisition of knowledge from encyclopedic
texts is described. The model has been implemented in a program, called SNOWY,
that reads unedited texts from {\em The World Book Encyclopedia}, and acquires
new concepts and conceptual relations about topics dealing with the dietary
habits of a... |
cmp-lg/9411012 | From Regular to Context Free to Mildly Context Sensitive Tree Rewriting
Systems: The Path of Child Language Acquisition | cmp-lg cs.CL | Current syntactic theory limits the range of grammatical variation so
severely that the logical problem of grammar learning is trivial. Yet, children
exhibit characteristic stages in syntactic development at least through their
sixth year. Rather than positing maturational delays, I suggest that
acquisition difficult... |
cmp-lg/9411013 | Phoneme-level speech and natural language intergration for agglutinative
languages | cmp-lg cs.CL | A new tightly coupled speech and natural language integration model is
presented for a TDNN-based large vocabulary continuous speech recognition
system. Unlike the popular n-best techniques developed for integrating mainly
HMM-based speech and natural language systems in word level, which is obviously
inadequate for ... |
cmp-lg/9411014 | Automatically Identifying Morphological Relations in = Machine-Readable
Dictionaries | cmp-lg cs.CL | We describe an automated method for identifying classes of morphologically
related words in an on-line dictionary, and for linking individual senses in
the derived form to one or more senses in the base form by means of
morphological relation attributes. We also present an algorithm for computing a
score reflecting t... |
cmp-lg/9411015 | Parsing Using Linearly Ordered Phonological Rules | cmp-lg cs.CL | A generate and test algorithm is described which parses a surface form into
one or more lexical entries using linearly ordered phonological rules. This
algorithm avoids the exponential expansion of search space which a naive
parsing algorithm would face by encoding into the form being parsed the
ambiguities which ari... |
cmp-lg/9411016 | Extending DRT with a Focusing Mechanism for Pronominal Anaphora and
Ellipsis Resolution | cmp-lg cs.CL | Cormack (1992) proposed a framework for pronominal anaphora resolution. Her
proposal integrates focusing theory (Sidner et al.) and DRT (Kamp and Reyle).
We analyzed this methodology and adjusted it to the processing of Portuguese
texts. The scope of the framework was widened to cover sentences containing
restrictive... |
cmp-lg/9411017 | Comlex Syntax: Building a Computational Lexicon | cmp-lg cs.CL | We describe the design of Comlex Syntax, a computational lexicon providing
detailed syntactic information for approximately 38,000 English headwords. We
consider the types of errors which arise in creating such a lexicon, and how
such errors can be measured and controlled.
|
cmp-lg/9411018 | Interlanguage Signs and Lexical Transfer Errors | cmp-lg cs.CL | A theory of interlanguage (IL) lexicons is outlined, with emphasis on IL
lexical entries, based on the HPSG notion of lexical sign. This theory accounts
for idiosyncratic or lexical transfer of syntactic subcategorisation and idioms
from the first language to the IL. It also accounts for developmental stages in
IL le... |
cmp-lg/9411019 | Focus on ``only" and ``Not" | cmp-lg cs.CL | Krifka [1993] has suggested that focus should be seen as a means of providing
material for a range of semantic and pragmatic functions to work on, rather
than as a specific semantic or pragmatic function itself. The current paper
describes an implementation of this general idea, and applies it to the
interpretation o... |
cmp-lg/9411020 | Extraction in Dutch with Lexical Rules | cmp-lg cs.CL | Unbounded dependencies are often modelled by ``traces'' (and ``gap
threading'') in unification-based grammars. Pollard and Sag, however, suggest
an analysis of extraction based on lexical rules, which excludes the notion of
traces (P&S 1994, Chapter 9). In parsing, it suggests a trade of indeterminism
for lexical amb... |
cmp-lg/9411021 | Free-ordered CUG on Chemical Abstract Machine | cmp-lg cs.CL | We propose a paradigm for concurrent natural language generation. In order to
represent grammar rules distributively, we adopt categorial unification grammar
(CUG) where each category owns its functional type. We augment typed lambda
calculus with several new combinators, to make the order of lambda-conversions
free ... |
cmp-lg/9411022 | Adaptive Sentence Boundary Disambiguation | cmp-lg cs.CL | Labeling of sentence boundaries is a necessary prerequisite for many natural
language processing tasks, including part-of-speech tagging and sentence
alignment. End-of-sentence punctuation marks are ambiguous; to disambiguate
them most systems use brittle, special-purpose regular expression grammars and
exception rul... |
cmp-lg/9411023 | Abstract Generation based on Rhetorical Structure Extraction | cmp-lg cs.CL | We have developed an automatic abstract generation system for Japanese
expository writings based on rhetorical structure extraction. The system first
extracts the rhetorical structure, the compound of the rhetorical relations
between sentences, and then cuts out less important parts in the extracted
structure to gene... |
cmp-lg/9411024 | Reverse Queries in DATR | cmp-lg cs.CL | DATR is a declarative representation language for lexical information and as
such, in principle, neutral with respect to particular processing strategies.
Previous DATR compiler/interpreter systems support only one access strategy
that closely resembles the set of inference rules of the procedural semantics
of DATR (... |
cmp-lg/9411025 | Multi-Dimensional Inheritance | cmp-lg cs.CL | In this paper, we present an alternative approach to multiple inheritance for
typed feature structures. In our approach, a feature structure can be
associated with several types coming from different hierarchies (dimensions).
In case of multiple inheritance, a type has supertypes from different
hierarchies. We contra... |
cmp-lg/9411026 | Manipulating Human-oriented Dictionaries with very simple tools | cmp-lg cs.CL | This paper presents a methodology for building and manipulating
human-oriented dictionaries. This methodology has been applied in the
construction of a French-English-Malay dictionary which has been obtained by
"crossing" semi-automatically two bilingual dictionaries. We use only Microsoft
Word, a specialized languag... |
cmp-lg/9411027 | Classifier Assignment by Corpus-based Approach | cmp-lg cs.CL | This paper presents an algorithm for selecting an appropriate classifier word
for a noun. In Thai language, it frequently happens that there is fluctuation
in the choice of classifier for a given concrete noun, both from the point of
view of the whole spe ech community and individual speakers. Basically, there
is no ... |
cmp-lg/9411028 | The Speech-Language Interface in the Spoken Language Translator | cmp-lg cs.CL | The Spoken Language Translator is a prototype for practically useful systems
capable of translating continuous spoken language within restricted domains.
The prototype system translates air travel (ATIS) queries from spoken English
to spoken Swedish and to French. It is constructed, with as few modifications
as possi... |
cmp-lg/9411029 | An Efficient Probabilistic Context-Free Parsing Algorithm that Computes
Prefix Probabilities | cmp-lg cs.CL | We describe an extension of Earley's parser for stochastic context-free
grammars that computes the following quantities given a stochastic context-free
grammar and an input string: a) probabilities of successive prefixes being
generated by the grammar; b) probabilities of substrings being generated by the
nonterminal... |
cmp-lg/9411030 | Complexity of Scrambling: A New Twist to the Competence - Performance
Distinction | cmp-lg cs.CL | In this paper we discuss the following issue: How do we decide whether a
certain property of language is a competence property or a performance
property? Our claim is that the answer to this question is not given a-priori.
The answer depends on the formal devices (formal grammars and machines)
available to us for des... |
cmp-lg/9411031 | Automatic Generation of Technical Documentation | cmp-lg cs.CL | Natural-language generation (NLG) techniques can be used to automatically
produce technical documentation from a domain knowledge base and linguistic and
contextual models. We discuss this application of NLG technology from both a
technical and a usefulness (costs and benefits) perspective. This discussion is
based l... |
cmp-lg/9411032 | Has a Consensus NL Generation Architecture Appeared, and is it
Psycholinguistically Plausible? | cmp-lg cs.CL | I survey some recent applications-oriented NL generation systems, and claim
that despite very different theoretical backgrounds, these systems have a
remarkably similar architecture in terms of the modules they divide the
generation process into, the computations these modules perform, and the way
the modules interac... |
cmp-lg/9412001 | Dependency Grammar and the Parsing of Chinese Sentences | cmp-lg cs.CL | Dependency Grammar has been used by linguists as the basis of the syntactic
components of their grammar formalisms. It has also been used in natural
language parsing. In China, attempts have been made to use this grammar
formalism to parse Chinese sentences using corpus-based techniques. This paper
reviews the proper... |
cmp-lg/9412002 | N-Gram Cluster Identification During Empirical Knowledge Representation
Generation | cmp-lg cs.CL | This paper presents an overview of current research concerning knowledge
extraction from technical texts. In particular, the use of empirical techniques
during the identification and generation of a semantic representation is
considered. A key step is the discovery of useful n-grams and correlations
between clusters ... |
cmp-lg/9412003 | An Extended Clustering Algorithm for Statistical Language Models | cmp-lg cs.CL | Statistical language models frequently suffer from a lack of training data.
This problem can be alleviated by clustering, because it reduces the number of
free parameters that need to be trained. However, clustered models have the
following drawback: if there is ``enough'' data to train an unclustered model,
then the... |
cmp-lg/9412004 | Knowledge Representation for Lexical Semantics: Is Standard First Order
Logic Enough? | cmp-lg cs.CL | Natural language understanding applications such as interactive planning and
face-to-face translation require extensive inferencing. Many of these
inferences are based on the meaning of particular open class words. Providing a
representation that can support such lexically-based inferences is a primary
concern of lex... |
cmp-lg/9412005 | Segmenting speech without a lexicon: The roles of phonotactics and
speech source | cmp-lg cs.CL | Infants face the difficult problem of segmenting continuous speech into words
without the benefit of a fully developed lexicon. Several sources of
information in speech might help infants solve this problem, including prosody,
semantic correlations and phonotactics. Research to date has focused on
determining to whic... |
cmp-lg/9412006 | Robust stochastic parsing using the inside-outside algorithm | cmp-lg cs.CL | The paper describes a parser of sequences of (English) part-of-speech labels
which utilises a probabilistic grammar trained using the inside-outside
algorithm. The initial (meta)grammar is defined by a linguist and further rules
compatible with metagrammatical constraints are automatically generated. During
training,... |
cmp-lg/9412007 | Coupling Phonology and Phonetics in a Constraint-Based Gestural Model | cmp-lg cs.CL | An implemented approach which couples a constraint-based phonology component
with an articulatory speech synthesizer is proposed. Articulatory gestures
ensure a tight connection between both components, as they comprise both
physical-phonetic and phonological aspects. The phonological modelling of e.g.
syllabificatio... |
cmp-lg/9412008 | Analysis of Japanese Compound Nouns using Collocational Information | cmp-lg cs.CL | Analyzing compound nouns is one of the crucial issues for natural language
processing systems, in particular for those systems that aim at a wide coverage
of domains. In this paper, we propose a method to analyze structures of
Japanese compound nouns by using both word collocations statistics and a
thesaurus. An expe... |
cmp-lg/9501001 | Using default inheritance to describe LTAG | cmp-lg cs.CL | We present the results of an investigation into how the set of elementary
trees of a Lexicalized Tree Adjoining Grammar can be represented in the lexical
knowledge representation language DATR (Evans & Gazdar 1989a,b). The LTAG under
consideration is based on the one described in Abeille et al. (1990). Our
approach i... |
cmp-lg/9501002 | NL Understanding with a Grammar of Constructions | cmp-lg cs.CL | We present an approach to natural language understanding based on a
computable grammar of constructions. A "construction" consists of a set of
features of form and a description of meaning in a context. A grammar is a set
of constructions. This kind of grammar is the key element of Mincal, an
implemented natural lang... |
cmp-lg/9501003 | An HPSG Parser Based on Description Logics | cmp-lg cs.CL | In this paper I present a parser based on Description Logics (DL) for a
German HPSG -style fragment. The specified parser relies mainly on the
inferential capabilities of the underlying DL system. Given a preferential
default extension for DL disambiguation is achieved by choosing the parse
containing a qualitatively... |
cmp-lg/9501004 | Lexical Knowledge Representation in an Intelligent Dictionary Help
System | cmp-lg cs.CL | The frame-based knowledge representation model adopted in IDHS (Intelligent
Dictionary Help System) is described in this paper. It is used to represent the
lexical knowledge acquired automatically from a conventional dictionary.
Moreover, the enrichment processes that have been performed on the Dictionary
Knowledge B... |
cmp-lg/9501005 | A Tool for Collecting Domain Dependent Sortal Constraints From Corpora | cmp-lg cs.CL | In this paper, we describe a tool designed to generate semi-automatically the
sortal constraints specific to a domain to be used in a natural language (NL)
understanding system. This tool is evaluated using the SRI Gemini NL
understanding system in the ATIS domain.
|
cmp-lg/9502001 | Interlingual Lexical Organisation for Multilingual Lexical Databases in
NADIA | cmp-lg cs.CL | We propose a lexical organisation for multilingual lexical databases (MLDB).
This organisation is based on acceptions (word-senses). We detail this lexical
organisation and show a mock-up built to experiment with it. We also present
our current work in defining and prototyping a specialised system for the
management ... |
cmp-lg/9502002 | Learning Unification-Based Natural Language Grammars | cmp-lg cs.CL | When parsing unrestricted language, wide-covering grammars often
undergenerate. Undergeneration can be tackled either by sentence correction, or
by grammar correction. This thesis concentrates upon automatic grammar
correction (or machine learning of grammar) as a solution to the problem of
undergeneration. Broadly s... |
cmp-lg/9502003 | ProFIT: Prolog with Features, Inheritance and Templates | cmp-lg cs.CL | ProFIT is an extension of Standard Prolog with Features, Inheritance and
Templates. ProFIT allows the programmer or grammar developer to declare an
inheritance hierarchy, features and templates. Sorted feature terms can be used
in ProFIT programs together with Prolog terms to provide a clearer description
language fo... |
cmp-lg/9502004 | Bottom-Up Earley Deduction | cmp-lg cs.CL | We propose a bottom-up variant of Earley deduction. Bottom-up deduction is
preferable to top-down deduction because it allows incremental processing (even
for head-driven grammars), it is data-driven, no subsumption check is needed,
and preference values attached to lexical items can be used to guide best-first
searc... |
cmp-lg/9502005 | Off-line Optimization for Earley-style HPSG Processing | cmp-lg cs.CL | A novel approach to HPSG based natural language processing is described that
uses an off-line compiler to automatically prime a declarative grammar for
generation or parsing, and inputs the primed grammar to an advanced
Earley-style processor. This way we provide an elegant solution to the problems
with empty heads a... |
cmp-lg/9502006 | Rapid Development of Morphological Descriptions for Full Language
Processing Systems | cmp-lg cs.CL | I describe a compiler and development environment for feature-augmented
two-level morphology rules integrated into a full NLP system. The compiler is
optimized for a class of languages including many or most European ones, and
for rapid development and debugging of descriptions of new languages. The key
design decisi... |
cmp-lg/9502007 | Utilization of a Lexicon for Spelling Correction in Modern Greek | cmp-lg cs.CL | In this paper we present an interactive spelling correction system for Modern
Greek. The entire system is based on a morphological lexicon. Emphasis is given
to the development of the lexicon, especially as far as storage economy, speed
efficiency and dictionary coverage is concerned. Extensive research was
conducted... |
cmp-lg/9502008 | A Robust and Efficient Three-Layered Dialogue Component for a
Speech-to-Speech Translation System | cmp-lg cs.CL | We present the dialogue component of the speech-to-speech translation system
VERBMOBIL. In contrast to conventional dialogue systems it mediates the
dialogue while processing maximally 50% of the dialogue in depth. Special
requirements like robustness and efficiency lead to a 3-layered hybrid
architecture for the dia... |
cmp-lg/9502009 | On Learning More Appropriate Selectional Restrictions | cmp-lg cs.CL | We present some variations affecting the association measure and thresholding
on a technique for learning Selectional Restrictions from on-line corpora. It
uses a wide-coverage noun taxonomy and a statistical measure to generalize the
appropriate semantic classes. Evaluation measures for the Selectional
Restrictions ... |
cmp-lg/9502010 | NPtool, a detector of English noun phrases | cmp-lg cs.CL | NPtool is a fast and accurate system for extracting noun phrases from English
texts for the purposes of e.g. information retrieval, translation unit
discovery, and corpus studies. After a general introduction, the system
architecture is presented in outline. Then follows an examination of a recently
written Constrain... |
cmp-lg/9502011 | Specifying a shallow grammatical representation for parsing purposes | cmp-lg cs.CL | Is it possible to specify a grammatical representation (descriptors and their
application guidelines) to such a degree that it can be consistently applied by
different grammarians e.g. for producing a benchmark corpus for parser
evaluation? Arguments for and against have been given, but very little
empirical evidence... |
cmp-lg/9502012 | A syntax-based part-of-speech analyser | cmp-lg cs.CL | There are two main methodologies for constructing the knowledge base of a
natural language analyser: the linguistic and the data-driven. Recent
state-of-the-art part-of-speech taggers are based on the data-driven approach.
Because of the known feasibility of the linguistic rule-based approach at
related levels of des... |
cmp-lg/9502013 | Ambiguity resolution in a reductionistic parser | cmp-lg cs.CL | We are concerned with dependency-oriented morphosyntactic parsing of running
text. While a parsing grammar should avoid introducing structurally
unresolvable distinctions in order to optimise on the accuracy of the parser,
it also is beneficial for the grammarian to have as expressive a structural
representation avai... |
cmp-lg/9502014 | Ellipsis and Quantification: a substitutional approach | cmp-lg cs.CL | The paper describes a substitutional approach to ellipsis resolution giving
comparable results to Dalrymple, Shieber and Pereira (1991), but without the
need for order-sensitive interleaving of quantifier scoping and ellipsis
resolution. It is argued that the order-independence results from viewing
semantic interpret... |
cmp-lg/9502015 | The Semantics of Resource Sharing in Lexical-Functional Grammar | cmp-lg cs.CL | We argue that the resource sharing that is commonly manifest in semantic
accounts of coordination is instead appropriately handled in terms of
structure-sharing in LFG f-structures. We provide an extension to the previous
account of LFG semantics (Dalrymple et al., 1993b) according to which
dependencies between f-str... |
cmp-lg/9502016 | Higher-order Linear Logic Programming of Categorial Deduction | cmp-lg cs.CL | We show how categorial deduction can be implemented in higher-order (linear)
logic programming, thereby realising parsing as deduction for the associative
and non-associative Lambek calculi. This provides a method of solution to the
parsing problem of Lambek categorial grammar applicable to a variety of its
extension... |
cmp-lg/9502017 | Deterministic Consistency Checking of LP Constraints | cmp-lg cs.CL | We provide a constraint based computational model of linear precedence as
employed in the HPSG grammar formalism. An extended feature logic which adds a
wide range of constraints involving precedence is described. A sound, complete
and terminating deterministic constraint solving procedure is given.
Deterministic com... |
cmp-lg/9502018 | Algorithms for Analysing the Temporal Structure of Discourse | cmp-lg cs.CL | We describe a method for analysing the temporal structure of a discourse
which takes into account the effects of tense, aspect, temporal adverbials and
rhetorical structure and which minimises unnecessary ambiguity in the temporal
structure. It is part of a discourse grammar implemented in Carpenter's ALE
formalism. ... |
cmp-lg/9502019 | Integrating "Free" Word Order Syntax and Information Structure | cmp-lg cs.CL | This paper describes a combinatory categorial formalism called Multiset-CCG
that can capture the syntax and interpretation of ``free'' word order in
languages such as Turkish. The formalism compositionally derives the
predicate-argument structure and the information structure (e.g. topic, focus)
of a sentence in para... |
cmp-lg/9502020 | Formalization and Parsing of Typed Unification-Based ID/LP Grammars | cmp-lg cs.CL | This paper defines unification based ID/LP grammars based on typed feature
structures as nonterminals and proposes a variant of Earley's algorithm to
decide whether a given input sentence is a member of the language generated by
a particular typed unification ID/LP grammar. A solution to the problem of the
nonlocal f... |
cmp-lg/9502021 | A Tractable Extension of Linear Indexed Grammars | cmp-lg cs.CL | It has been shown that Linear Indexed Grammars can be processed in polynomial
time by exploiting constraints which make possible the extensive use of
structure-sharing. This paper describes a formalism that is more powerful than
Linear Indexed Grammar, but which can also be processed in polynomial time
using similar ... |
cmp-lg/9502022 | Stochastic HPSG | cmp-lg cs.CL | In this paper we provide a probabilistic interpretation for typed feature
structures very similar to those used by Pollard and Sag. We begin with a
version of the interpretation which lacks a treatment of re-entrant feature
structures, then provide an extended interpretation which allows them. We
sketch algorithms al... |
cmp-lg/9502023 | Splitting the Reference Time: Temporal Anaphora and Quantification in
DRT | cmp-lg cs.CL | This paper presents an analysis of temporal anaphora in sentences which
contain quantification over events, within the framework of Discourse
Representation Theory. The analysis in (Partee 1984) of quantified sentences,
introduced by a temporal connective, gives the wrong truth-conditions when the
temporal connective... |
cmp-lg/9502024 | A Robust Parser Based on Syntactic Information | cmp-lg cs.CL | In this paper, we propose a robust parser which can parse extragrammatical
sentences. This parser can recover them using only syntactic information. It
can be easily modified and extended because it utilize only syntactic
information.
|
cmp-lg/9502025 | Principle Based Semantics for HPSG | cmp-lg cs.CL | The paper presents a constraint based semantic formalism for HPSG. The
syntax-semantics interface directly implements syntactic conditions on
quantifier scoping and distributivity. The construction of semantic
representations is guided by general principles governing the interaction
between syntax and semantics. Each... |
cmp-lg/9502026 | On Reasoning with Ambiguities | cmp-lg cs.CL | The paper adresses the problem of reasoning with ambiguities. Semantic
representations are presented that leave scope relations between quantifiers
and/or other operators unspecified. Truth conditions are provided for these
representations and different consequence relations are judged on the basis of
intuitive corre... |
cmp-lg/9502027 | Towards an Account of Extraposition in HPSG | cmp-lg cs.CL | This paper investigates the syntax of extraposition in the HPSG framework. We
present English and German data (partly taken from corpora), and provide an
analysis using lexical rules and a nonlocal dependency. The condition for
binding this dependency is formulated relative to the antecedent of the
extraposed phrase,... |
cmp-lg/9502028 | Lexical Acquisition via Constraint Solving | cmp-lg cs.CL | This paper describes a method to automatically acquire the syntactic and
semantic classifications of unknown words. Our method reduces the search space
of the lexical acquisition problem by utilizing both the left and the right
context of the unknown word. Link Grammar provides a convenient framework in
which to impl... |
cmp-lg/9502029 | Topic Identification in Discourse | cmp-lg cs.CL | This paper proposes a corpus-based language model for topic identification.
We analyze the association of noun-noun and noun-verb pairs in LOB Corpus. The
word association norms are based on three factors: 1) word importance, 2) pair
co-occurrence, and 3) distance. They are trained on the paragraph and sentence
level... |
cmp-lg/9502030 | Bi-directional memory-based dialog translation: The KEMDT approach | cmp-lg cs.CL | A bi-directional Korean/English dialog translation system is designed and
implemented using the memory-based translation technique. The system KEMDT
(Korean/English Memory-based Dialog Translation system) can perform Korean to
English, and English to Korean translation using unified memory network and
extended marker... |
cmp-lg/9502031 | Cooperative Error Handling and Shallow Processing | cmp-lg cs.CL | This paper is concerned with the detection and correction of sub-sentential
English text errors. Previous spelling programs, unless restricted to a very
small set of words, have operated as post-processors. And to date, grammar
checkers and other programs which deal with ill-formed input usually step
directly from sp... |
cmp-lg/9502032 | An NLP Approach to a Specific Type of Texts: Car Accident Reports | cmp-lg cs.CL | The work reported here is the result of a study done within a larger project
on the ``Semantics of Natural Languages'' viewed from the field of Artificial
Intelligence and Computational Linguistics. In this project, we have chosen a
corpus of insurance claim reports. These texts deal with a relatively
circumscribed d... |
cmp-lg/9502033 | An Algorithm to Co-Ordinate Anaphora Resolution and PPS Disambiguation
Process | cmp-lg cs.CL | This paper concerns both anaphora resolution and prepositional phrase (PP)
attachment that are the most frequent ambiguities in natural language
processing. Several methods have been proposed to deal with each phenomenon
separately, however none of proposed systems has considered the way of dealing
both phenomena. We... |
cmp-lg/9502034 | Grouping Words Using Statistical Context | cmp-lg cs.CL | This paper (cmp-lg/yymmnnn) has been accepted for publication in the student
session of EACL-95. It outlines ongoing work using statistical and unsupervised
neural network methods for clustering words in untagged corpora. Such
approaches are of interest when attempting to understand the development of
human intuitive... |
cmp-lg/9502035 | Incorporating "Unconscious Reanalysis" into an Incremental, Monotonic
Parser | cmp-lg cs.CL | This paper describes an implementation based on a recent model in the
psycholinguistic literature. We define a parsing operation which allows the
reanalysis of dependencies within an incremental and monotonic processing
architecture, and discuss search strategies for its application in a
head-initial language (Englis... |
cmp-lg/9502036 | Literal Movement Grammars | cmp-lg cs.CL | Literal movement grammars (LMGs) provide a general account of extraposition
phenomena through an attribute mechanism allowing top-down displacement of
syntactical information. LMGs provide a simple and efficient treatment of
complex linguistic phenomena such as cross-serial dependencies in German and
Dutch---separati... |
cmp-lg/9502037 | A State-Transition Grammar for Data-Oriented Parsing | cmp-lg cs.CL | This paper presents a grammar formalism designed for use in data-oriented
approaches to language processing. The formalism is best described as a
right-linear indexed grammar extended in linguistically interesting ways. The
paper goes on to investigate how a corpus pre-parsed with this formalism may be
processed to p... |
cmp-lg/9502038 | Implementation and evaluation of a German HMM for POS disambiguation | cmp-lg cs.CL | A German language model for the Xerox HMM tagger is presented. This model's
performance is compared with two other German taggers with partial parameter
re-estimation and full adaption of parameters from pre-tagged corpora. The
ambiguity types resolved by this model are analysed and compared to ambiguity
types of Eng... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.