Articles

This paper outlines the linguistic semantic com- mitments underlying an application which au- tomatically constructs depictions of verbal spa- tial descriptions. Our approach draws on the ideational view of linguistic semantics developed by Ronald Langacker in his theory of Cognitive Grammar, and the conceptual representation of physical objects from the …...

Interactive spoken dialog provides many new challenges for spoken language systems. One of the most critical is the prevalence of speech repairs. This paper presents an al- gorithm that detects and corrects speech repairs based on finding the repair pattern. The repair pattern is built by find- ing word matches …...

The paper demonstrates that exponential com- plexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results imply that the study and optimisation of unification-based parsing must rely on empirical data until complex- ity theory …...

This paper describes a modular connectionist model of the acquisition of receptive inflectional morphology. The model takes inputs in the form of phones one at a time and outputs the associated roots and in- flections. Simulations using artificial language stimuli demonstrate the capacity of the model to learn suffix- ation, …...

In many applications of natural language processing it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may need to determine which of the two word combinations "eat a peach" and "eat a beach" is more likely. Statis- tical NLP methods determine the …...

This paper defines multiset-valued linear index gram- mar and unordered vector grammar with dominance links. The former models certain uses of multiset- valued feature structures in unification-based for- malisms, while the latter is motivated by word order variation and by "quasi-trees", a generalization of trees. The two formalisms are weakly …...

This paper provides a model theoretic semantics to fea- ture terms augmented with set descriptions. We pro- vide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership con- straints, restricted universal role quantifications, set union, intersection, subset and disjointness. A sound, complete and terminating consistency checking proce- …...

An automatic compound retrieval method is pro- posed to extract compounds within a text mes- sage. It uses n-gram mutual information, relative frequency count and parts of speech as the features for compound extraction. The problem is mod- eled as a two-class classification problem based on the distributional characteristics of …...

To acquire noun phrases from running texts is useful for many applications, such as word grouping, terminology indexing, etc. The reported literatures adopt pure probabilistic approach, or pure rule-based noun phrases a grammar to tackle this problem. In this paper, we apply probabilistic chunker to deciding the implicit boundaries of …...

Machine translation (MT) has recently been for- mulated in terms of constraint-based knowledge representation and unification theories~ but it is becoming more and more evident that it is not possible to design a practical MT system without an adequate method of handling mismatches be- tween semantic representations in the source …...

We present an efficient procedure for cost-based ab- duction, which is based on the idea of using chart parsers as proof procedures. We discuss in de- tail three features of our algorithm -- goal-driven bottom-up derivation, tabulation of the partial re- sults, and agenda control mechanism -- and report the …...

We show that more head-driven parsing algorithms can he formulated than those occurring in the existing lit- erature. These algorithms are inspired by a family of left-to-right parsing algorithms from a recent publica- tion. We further introduce a more advanced notion of "head-driven parsing" which allows more detailed spec- ification …...

The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filtering during parsing. This problem is N P-complete and untractable on large grammars. An approximation algorithm is presented. The quality of the suboptimal …...

We present a new approach to disambiguating syn- tactically ambiguous words in context, based on Variable Memory Markov (VMM) models. In con- trast to fixed-length Markov models, which predict based on fixed-length histories, variable memory Markov models dynamically adapt their history length based on the training data, and hence may …...

1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in the description, despite disjunctions inherent in the theory of trees. The resulting algorithm allows for descriptions which go beyond sets of atomic …...

We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LC, FGs of Schabes and Waters but with consider- ably less restriction on the form of the grammars. The class provides …...

We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recur- sive constraints. In particular, the...

Most probabilistic classifiers used for word-sense disam- biguation have either been based on only one contextual feature or have used a model that is simply assumed to characterize the interdependencies among multiple contextual features. In this paper, a different approach to formulating a probabilistic model is presented along with a …...

This paper will focus on the semantic representa- tion of verbs in computer systems and its impact on lexical selection problems in machine transla- tion (MT). Two groups of English and Chinese verbs are examined to show that lexical selec- tion must be based on interpretation of the sen- tence …...

Considering the speed in which humans resolve syn- tactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selec- tion of the analysis whose interpretation is the most 'sensible', one comes to the conclusion that inter- pretation, hence parsing take place incrementally, just about every word. Considerations of …...