Skip to content

Computation and Language papers — page 17

cmp-lgBrowse archive

Learning Part-of-Speech Guessing Rules from Lexicon: Extension to Non-Concatenative Operations
One of the problems in part-of-speech tagging of real-word texts is that of unknown to the lexicon words. In Mikheev (ACL-96 cmp-lg/9604022), a technique for fully unsupervised statistical…
Andrei MikheevApr 30, 1996
Learn
Connectivity in Bag Generation
This paper presents a pruning technique which can be used to reduce the number of paths searched in rule-based bag generators of the type proposed by poznanskietal95 and popowich95.…
Arturo Trujillo, Simon BerryApr 30, 1996
Learn
A Model-Theoretic Framework for Theories of Syntax
A natural next step in the evolution of constraint-based grammar formalisms from rewriting formalisms is to abstract fully away from the details of the grammar mechanism---to express syntactic…
James RogersApr 30, 1996
Learn
Unsupervised Learning of Word-Category Guessing Rules
Words unknown to the lexicon present a substantial problem to part-of-speech tagging. In this paper we present a technique for fully unsupervised statistical acquisition of rules which guess possible…
Andrei MikheevApr 30, 1996
Learn
Extended Dependency Structures and their Formal Interpretation
We describe two ``semantically-oriented'' dependency-structure formalisms, U-forms and S-forms. U-forms have been previously used in machine translation as interlingual representations, but…
Marc Dymetman, Max CoppermanApr 29, 1996
Learn
Translating into Free Word Order Languages
In this paper, I discuss machine translation of English text into Turkish, a relatively ``free'' word order language. I present algorithms that determine the topic and the focus of each…
Beryl HoffmanApr 29, 1996
Learn
Magic for Filter Optimization in Dynamic Bottom-up Processing
Off-line compilation of logic grammars using Magic allows an incorporation of filtering into the logic underlying the grammar. The explicit definite clause characterization of filtering resulting…
Guido MinnenApr 29, 1996
Learn
The Measure of a Model
This paper describes measures for evaluating the three determinants of how well a probabilistic classifier performs on a given test set. These determinants are the appropriateness, for the test set,…
Rebecca Bruce, Janyce Wiebe, Ted PedersenApr 28, 1996
Learn
Fast Parsing using Pruning and Grammar Specialization
We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based on explanation-based…
Manny Rayner, David CarterApr 26, 1996
Learn
Processing Metonymy: a Domain-Model Heuristic Graph Traversal Approach
We address here the treatment of metonymic expressions from a knowledge representation perspective, that is, in the context of a text understanding system which aims to build a conceptual…
Jacques Bouaud, Bruno Bachimont, Pierre ZweigenbaumApr 26, 1996
Learn
Computing Prosodic Morphology
This paper establishes a framework under which various aspects of prosodic morphology, such as templatic morphology and infixation, can be handled under two-level theory using an implemented…
George Anton KirazApr 25, 1996
Learn
The importance of being lazy -- using lazy evaluation to process queries to HPSG grammars
Linguistic theories formulated in the architecture of hpsg can be very precise and explicit since hpsg provides a formally well-defined setup. However, when querying a faithful…
Thilo Götz, Walt Detmar MeurersApr 25, 1996
Learn
Syntactic Analyses for Parallel Grammars: Auxiliaries and Genitive NPs
This paper focuses on two disparate aspects of German syntax from the perspective of parallel grammar development. As part of a cooperative project, we present an innovative approach to auxiliaries…
Miriaam Butt, Christian Fortman, Christian RohrerApr 24, 1996
Learn
SemHe: A Generalised Two-Level System
This paper presents a generalised two-level implementation which can handle linear and non-linear morphological operations. An algorithm for the interpretation of multi-tape two-level rules is…
George Anton KirazApr 24, 1996
Learn
Multi-level post-processing for Korean character recognition using morphological analysis and linguistic evaluation
Most of the post-processing methods for character recognition rely on contextual information of character and word-fragment levels. However, due to linguistic characteristics of Korean, such…
Geunbae Lee, Jong-Hyeok Lee, JinHee YooApr 24, 1996
Learn
Off-line Constraint Propagation for Efficient HPSG Processing
We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a HPSG theory more specific at those places where…
Walt Detmar Meurers, Guido MinnenApr 23, 1996
Learn
Another Facet of LIG Parsing
In this paper we present a new parsing algorithm for linear indexed grammars (LIGs) in the same spirit as the one described in (Vijay-Shanker and Weir, 1993) for tree adjoining grammars. For a LIG…
Pierre BoullierApr 23, 1996
Learn
Efficient Algorithms for Parsing the DOP Model
Excellent results have been reported for Data-Oriented Parsing (DOP) of natural language texts (Bod, 1993). Unfortunately, existing algorithms are both computationally intensive and difficult to…
Joshua GoodmanApr 22, 1996
Learn
Collocational Grammar
A perspective of statistical language models which emphasizes their collocational aspect is advocated. It is suggested that strings be generalized in terms of classes of relationships instead of…
Robert John FreemanApr 19, 1996
Learn
The Role of the Gricean Maxims in the Generation of Referring Expressions
Grice's maxims of conversation [Grice 1975] are framed as directives to be followed by a speaker of the language. This paper argues that, when considered from the point of view of natural…
Robert Dale, Ehud ReiterApr 18, 1996
Learn
Better Language Models with Model Merging
This paper investigates model merging, a technique for deriving Markov models from text or speech corpora. Models are derived by starting with a large and specific model and by successively combining…
Thorsten BrantsApr 17, 1996
Learn
Apportioning Development Effort in a Probabilistic LR Parsing System through Evaluation
We describe an implemented system for robust domain-independent syntactic parsing of English, using a unification-based grammar of part-of-speech and punctuation labels coupled with a probabilistic…
John Carroll, Ted BriscoeApr 12, 1996
Learn
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree approximately, that is, within a certain error tolerance. It has natural…
Kemal OflazerApr 11, 1996
Learn
Combining Hand-crafted Rules and Unsupervised Learning in Constraint-based Morphological Disambiguation
This paper presents a constraint-based morphological disambiguation approach that is applicable languages with complex morphology--specifically agglutinative languages with productive inflectional…
Kemal Oflazer, Gokhan TurApr 11, 1996
Learn
A Constraint-based Case Frame Lexicon
We present a constraint-based case frame lexicon architecture for bi-directional mapping between a syntactic case frame and a semantic frame. The lexicon uses a semantic sense as the basic unit and…
Kemal Oflazer, Okan YilmazApr 11, 1996
Learn
← PreviousPage 17Next →