waashk/dblp huggingface dataset:
on froff: a text processing system for english texts and figures. in order to meet the needs of a publication of papers in english, many systems to run off texts have been developed. in this paper, we report a system froff which can make a fair copy of not only texts but also graphs and tables indispensable to our papers. its selection of fonts, specification of character size are dinamically changeable, and the typing location can be also changed in lateral or longitudinal directions. each character has its own width and a line length is counted by the sum of each character. by using commands or rules which are defined to facilitate the construction of format expected or some mathematical expressions, elaborate and pretty documments can be successfully obtained.
incremental identification of inflectional types. we present an approach to the incremental accrual of lexical information for unknown words that is constraint-based and compatible with standard unification-based grammars. although the techniques are language-independent and can be applied to all kinds of information, in this paper we concentrate on the domain of german noun inflection. we show how morphological information, especially inflectional class, is successfully acquired using a type-based hpsg-like analysis. furthermore, we sketch an alternative strategy which makes use of finite-state transducers.
parsing french with tree adjoining grammar: some linguistic accounts. we present the first sizable grammar written for tag. we present the linguistic coverage of our grammar, and explain the linguistic reasons which lead us to choose the particular representations. we show that tag formalism provides sufficient constraints for handling most of the linguistic phenomena, with minimal linguistic stipulations. we first state the basic structures needed for parsing french, with a particular emphasis on tag's extended domain of locality that enables us to state complex sub-categorization phenomena in a natural way. we then give a detailed analysis of sentential complements, because it has lead us to introduce substitution in the formalism, and because tag makes interesting predictions. we discuss the different linguistic phenomena corresponding to adjunction and to substitution respectively. we then move on to support verb constructions, which are represented in a tag in a simpler way than the usual double analysis. it is the first time support verb constructions are handled in a parser. we lastly give an overview of the treatment of adverbs, and suggest a treatment of idioms which make them fall into the same representations as 'free' structures.
reasoning in metaphor understanding: the att-meta approach and system. a detailed approach has been developed for core aspects of the task of understanding a broad class of metaphorical utterances. the utterances in question are those that depend on known metaphorical mappings but that nevertheless contain elements not mapped by those mappings. a reasoning system has been implemented that partially instantiates the theoretical approach. the system, called att meta, will be demonstrated. the paper briefly indicates how the system works, and outlines some specific aspects of the system, approach and the overall project.
a word database for natural language processing. the paper describes the design of a fair sized lexical database that is to be used with a natural language based expert system with german as the language of interaction. sources for entries and tools for constructing and maintaining the database are discussed, as well as the information needed in the lexicon for the purposes of syntactic and semantic processing.
using lexicalized tags for machine translation. lexicalized tree adjoining grammar (ltag) is an attractive formalism for linguistic description mainly because of its extended domain of locality and its factoring recursion out from the domain of local dependencies (joshi, 1985, kroch and joshi, 1985, abeill&eacute;, 1988). ltag's extended domain of locality enables one to localize syntactic dependencies (such as filler-gap), as well as semantic dependencies (such as predicate-arguments). the aim of this paper is to show that these properties combined with the lexicalized property of ltag are especially attractive for machine translation.the transfer between two languages, such as french and english, can be done by putting directly into correspondence large elementary units without going through some interlingual representation and without major changes to the source and target grammars. the underlying formalism for the transfer is "synchronous tree adjoining grammars" (shieber and schabes [1990]). transfer rules are stated as correspondences between nodes of trees of large domain of locality which are associated with words. we can thus define lexical transfer rules that avoid the defects of a mere word-to-word approach but still benefit from the simplicity and elegance of a lexical approach.we rely on the french and english ltag grammars (abeill&eacute; [1988], abeille [1990 (b)], abeille et al. [1990], abeille and schabes [1989, 1990]) that have been designed over the past two years jointly at university of pennsylvania and university of paris 7-jussieu.
wordform- and class-based prediction of the components of german nominal compounds in an aac system. in word prediction systems for augmentative and alternative communication (aac), productive word-formation processes such as compounding pose a serious problem. we present a model that predicts german nominal compounds by splitting them into their modifier and head components, instead of trying to predict them as a whole. the model is improved further by the use of class-based modifier-head bigrams constructed using semantic classes automatically extracted from a corpus. the evaluation shows that the split compound model with class bigrams leads to an improvement in keystroke savings of more than 15% over a no split compound baseline model. we also present preliminary results obtained with a word prediction model integrating compound and simple word prediction.
extending drt with a focusing mechanism for pronominal anaphora and ellipsis resolution. 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 relative clauses and subject ellipsis. tests were conceived and applied to probe the adequacy of proposed modifications when dealing with processing of current texts.
concept clustering and knowledge integration from a children's dictionary. knowledge structure called concept clustering knowledge graphs (cckgs) are introduced along with a process for their construction from a machine readable dictionary. cckgs contain multiple concepts interrelated through multiple semantic relations together forming a semantic cluster represented by a conceptual graph. the knowledge acquisition is performed on a children's first dictionary. the concepts involved are general and typical of a daily life conversation. a collection of conceptual clusters together can form the basis of a lexical knowledge base, where each cckg contains a limited number of highly connected words giving useful information about a particular domain or situation.
a modular architecture for constraint-based parsing. this paper presents a framework and a system for implementing, comparing and analyzing parsers for the some classes of constraint-based grammars. the framework consists in a uniform theoretic description of parsing algorithms, and provides the structure for decomposing the system into logical components, with possibly several interchangeable implementations. many parsing algorithms can be obtained by composition of the modules of our system. modularity is also a way of achieving code sharing for the common parts of these various algorithms. furthemore, the design helps reusing the existing modules when implementing, other algorithms. the system uses the flexible modularity provided by the programing languages alcool-90, based on a type system that ensures the safety of module composition.
a logic programming view of relational morphology. we use the more abstract term "relational morphology" in place of tile usual "two-level morphology" in order to emphasize an aspect of koskenniemi's work which has been overlooked in favor of implementation issues using the finite state paradigm, namely, that a mathematical relation can be specified between the lexical and surface levels of a language. relations, whether finite state or not, can be computed using any of several paradigms, and we present a logical reading of a notation for relational morphological rules (similar to that of koskenniemi's) which can in fact be used to automatically generate prolog program clauses. like the finite state implementations, the relation can be computed in either direction, either from the surface to the lexieal level, or vice versa. at rite very least, this provides a morphological complement to logic grammars which deal mainly with syntax and semantics, in a programming environment which is more user-friendly than the finite state programming paradigm. the morphological rules often compile simply into unification of the arguments in the generated morphology predicate followed by a recursive call of the said predicate. further speed can be obtained when a prolog compiler, rather than an interpreter, is used for execution.
a "not-so-shallow" parser for collocational analysis. collocational analysis is the basis of many studies on lexical acquisition. collocations are extracted from corpora using more or less shallow processing techniques, that span from purely statistical methods to patial parsers. our point is that, despite one of the objectives of collocational analysis is to acquire high-coverage lexical data at low human cost, this is often not the case. human work is in fact required for the initial training of most statistically based methods. a more serious problem is that shallow processing techniques produce a noise that is not acceptable for a fully automated system.we propose in this paper a not-so-shallow parsing strategy that reliably detects binary and ternary relations among words. we show that adding more syntactic knowledge to the recipe significantly improves the recall and precision of the detected collocations, regardless of any subsequent statistical computation, while still meeting the computational requirements of corpus parsers.
decision trees as explicit domain term definitions. terminology acquisition (ta) methods are viable solutions for the knowledge bottleneck problem that confines knowledge-intensive information access systems (such as information extraction systems) to restricted application scenarios. ta can be seen as a way to inspect large text collections for extracting concise domain knowledge. in this paper we argue that major insights over the notion of term can be obtained by investigating a more domain-based term definition. we propose a decision tree learning approach as an interesting model of the human ta activity. an incremental model is proposed to study the evolution of the term definition during the ta process over a particular implicit domain model. the experimental apparatus is based on robust text processing tools that support a large scale investigation. the good results suggest that the proposed automatic ta model can support the development of conceptual domain dictionaries as required by knowledge-based information systems.
cognitive models for computer vision. this paper is focused on the relations existing between language and vision. its goal is to discuss how linguistic informations about objects, shapes, positions and spatial relations with other objects can be integrated into a cognitive model tailored to spatial inferencing operations.
finding translation equivalents: an application of grammatical metaphor. in this paper i describe how a significant class of cases that would involve (possibly complex) structural transfer in machine translation can be handled avoiding transfer. this is achieved by applying a semantic organization developed for monolingual text generation that is sufficiently abstract to remain invariant, within theoretically specifiable limits, across different languages. the further application of a mechanism motivated from within monolingual text generation, 'grammatical metaphor', then allows candidate appropriate translations to be isolated. the incorporation of these essentially monolingual mechanisms within the machine translation process promises to significantly improve translational capabilities; examples of this are presented for english and german.
natural language driven image generation. in this paper the experience made through the development of a natural language driven image generation is discussed. this system is able to imagine a static scene described by means of a sequence of simple phrases. in particular, a theory for equilibrium and support will be outlined together with the problem of object positioning.
the nondirectional representation of systemic functional grammars and semantics as typed feature structures. a small fragment of the systemic functional grammar of the penman system is reformulated in the typed feature structure language. through this reformulation we gain full reversibility for the sfg description and access for unification-based grammar descriptions to the rich semantic levels of description that sfg supports. we illustrate this reformulation with respect to both generation and semantic analysis and set out the future goals for research this result establishes.
converting large on-line valency dictionaries for nlp applications: from proton descriptions to metal frames. in this paper, we report on a large-scale conversion experiment with on-line valency dictionaries. a linguistically motivated valency dictionary in prolog is converted into a valency dictionary for a large-scale machine translation system. several aspects of the two dictionaries and their background projects are discussed, as well as the way their representations are mapped. the results of the conversion are looked at from an economic perspective (fast conding for nlp), and also from a computational-lexicographic perspective (requirements for conversions and for standardization of lexicon information).
integrating syntactic and prosodic information for the efficient detection of empty categories. we describe a number of experiments that demonstrate the usefulness of prosodic information for a processing module which parses spoken utterances with a feature-based grammar employing empty categories. we show that by requiring certain prosodic properties from those positions in the input, where the presence of an empty category has to be hypothesized, a derivation can be accomplished more efficiently. the approach has been implemented in the machine translation project verbmobil and results in a significant reduction of the work-load for the parser.
from cogram to alcogram: toward a controlled english grammar checker. in this paper we describe the roots of controlled english (ce), the analysis of several existing ce grammars, the development of a well-founded 150-rule ce grammar (cogram), the elaboration of an algorithmic variant (alcogram) as a basis for nlp applications, the use of alcogram in a cai program teaching writers how to use it effectively, and the preparatory study into a controlled english grammar and style checker within a desktop publishing (dtp) environment.
customizing and evaluating a multilingual discourse module. in this paper, we first describe how we have customized our data-driven multilingual discourse module within our text understanding system for different languages and for a particular nlp application by utilizing hierarchically organized discourse kb's. then, we report quantitative and qualitative findings from evaluating the system both with and without discourse processing, and discuss how resolving certain kinds of anaphora affects system performance.
an empirical evaluation of lfg-dop. this paper presents an empirical assessment of the lfg-dop model introduced by bod & kaplan (1998). the parser we describe uses fragments from lfg-annotated sentences to parse new sentences and monte carlo techniques to compute the most probable parse. while our main goal is to test bod & kaplan's model, we will also test a version of lfg-dop which treats generalized fragments as previously unseen events. experiments with the verbmobil and homecentre corpora show that our version of lfg-dop outperforms bod & kaplan's model, and that lfg's functional information improves the parse accuracy of tree structures.
a word-grammar based morphological analyzer for agglutinative languages. agglutinative languages present rich morphology and for some applications they need deep analysis at word level. the work here presented proposes a model for designing a full morphological analyzer.the model integrates the two-level formalism and a unification-based formalism. in contrast to other works, we propose to separate the treatment of sequential and non-sequential morphotactic constraints. sequential constraints are applied in the segmentation phase, and non-sequential ones in the final feature-combination phase. early application of sequential morphotactic constraints during the segmentation process makes feasible an efficient implementation of the full morphological analyzer.the result of this research has been the design and implementation of a full morphosyntactic analysis procedure for each word in unrestricted basque texts.
tge: tlinks generation environment. this paper describes the enhancements made, within a unification framework, based on typed feature structures, in order to support linking of lexical entries to their translation equivalents. to help this task we have developed an interactive environment: tge. several experiments, corresponding to rather "closed" semantic domains, have been developed in order to generate lexical cross-relations between english and spanish.
efficiency considerations for lfg-parsers - incremental and table-lookup techniques. the paper presents a concise description of the lfg-parser-generator developed at the ewh in koblenz. special attention is paid to efficiency considerations to speed up the system in the execution phase. lexicon is separated, 11(k)-parsing tables are used and some preliminary unifications are carried out before the actual execution. the run time system follows the single path strategy and produces the f-structures simultaneously with the processing of the c-structures.
a morphological recognizer with syntactic and phonological rules. this paper describes a morphological analyzer which, when parsing a word, uses two sets of rules: rules describing the syntax of words, and rules describing facts about orthography.
word sense disambiguation using conceptual density. this paper present a method for the resolution of lexical ambiguity of nouns and its automatic evaluation over the brown corpus. the method relies on the use of the wide-coverage noun taxonomy of wordnet and the notion of conceptual distance among concepts, captured by a conceptual density formula developed for this purpose. this fully automatic method requires no hand coding of lexical entries, hand tagging of text nor any kind of training process. the results of the experiments have been automatically evaluted against semcor, the sense-tagged version of the brown corpus.
functional constraints in knowledge-based natural language understanding. many knowledge-based systems of semantic interpretation rely explicitly or implicitly on an assumption of structural isomorphy between syntactic and semantic objects, handling exceptions by ad hoc measures. in this paper i argue that constraint equations of the kind used in the lfg- (or patr-) fomalisms provide a more general, and yet restricted formalism in which not only isomorphic correspondences are expressible, but also many cases of non-isomorphic correspondences. i illustrate with treatments of idioms, speech act interpretation and discourse pragmatics.
backwards phonology. this paper constitutes an investigation into the generative capabilities of two-level phonology with respect to unilevel generative phonological rules. proponents of two-level phonology have claimed, but not demonstrated, that two-level rules and grammars of two-level rules are reversible and that grammars of unilevel rules are not. this paper makes "reversibility" explicit and demonstrates by means of examples from tunica and klamath that two-level phonology does have certain desirable cababilities that are not found in grammars of unilevel rules.
a grammar combining phrase structure and field structure. a grammar formalism, field and category grammar (fcg), is described, which beside constituent structure and functional structure recognizes a level of field structure. it is argued that the formalism offers descriptive and computational advantages for the analysis of scandinavian and other languages that distinguish clause types topologically. it is also argued that the clear distinction between fields and constituents makes fcgs theoretically sounder than other proposed field grammars. a comparison is made of the word order rules and assumptions of fcgs with the partial orderings employed by gpsg and other models.
storing text using integer codes. traditionally, text is stored on computers as a stream of characters. the goal of this research is to store text in a form that facilitates word manipulation whilst reducing storage space. a word list with syntactic linear ordering is stored and words in a text are given two-byte integar codes that point to their respective positions in this list. the implementation of the encoding scheme is described and the performance statistics of this encoding scheme is presented.
machine translation using isomorphic ucgs. this paper discusses the application of unification categorial grammar (ucg) to the framework of isomorphic grammars for machine translation pioneered by landsbergen. the isomorphic grammars approach to mt involves developing the grammars of the source and target languages in parallel, in order to ensure that sl and tl expressions which stand in the translation relation have isomorphic derivations. the principle advantage of this approach is that knowledge concerning translation equivalence of expressions may be directly exploited, obviating the need for answers to semantic questions that we do not yet have. semantic and other information may still be incorporated, but as constraints on the translation relation, not as levels of textual representation.after introducing this approach to mt system design, and the basics of monolingual ucg, we will show how the two can be integrated, and present an example from an implemented bi-directional english-spanish fragment. finally we will present some outstanding problems with the approach.
a method of cluster-based indexing of textual data. this paper presents a framework for clustering in text-based information retrieval systems. the prominent feature of the proposed method is that documents, terms, and other related elements of textual information are clustered simultaneously into small overlapping clusters. in the paper, the mathematical formulation and implementation of the clustering method are briefly introduced, together with some experimental results.
a compositional approach to the translation of temporal expression in the rosetta system. this paper discusses the translation of temporal expressions, in the framework of the machine translation system rosetta. the translation method of rosetta, the 'isomorphic grammar method', is based on montague's compositionality principle. it is shown that a compositional approach leads to a transparent account of the complex aspects of time in natural language and can be used for the translation of temporal expressions.