waashk/dblp huggingface dataset:
sense classification of verbal polysemy based-on bilingual class/class association. in the field of statistical analysis of natural langauge data, the measure of word/class association has proved to be quite useful for discovering a meaningful sense cluster in an arbitrary level of the thesaurus. in this paper, we apply its idea to the sense classification of japanese verbal polysemy in case frame acquisition from japanese-english parallel corpora. measures of bilingual class/class association and bilingual class/frame association are introduced and used for discovering sense clusters in the sense distribution of english predicates and japanese case element nouns. in a small experiment, 93.3% of the discovered clusters are correct in that none of them contains examples of more than one hand-classified senses.
buildrs: an implementation of dr theory and lfg. this paper examines a particular prolog implementation of discourse representation theory (dr theory) constructed at the university of texas. the implementation also contains a lexical functional grammar parser that provides f-structures: these f-structures are then translated into the semantic representations posited by dr theory, structures which are known as discourse representation structures (drss). our program handles some linguistically interesting phenomena in english such as (i) scope ambiguities of singular quantifiers, (ii) functional control phenomena, and (iii) long distance dependencies. finally, we have implemented an algorithm for anaphora resolution. our goal is to use purely linguistically available information in constructing a semantic representation of discourse as far as is feasible and to forego appeals to world knowledge.
bilingual text, matching using bilingual dictionary and statistics. this paper describes a unified framework for bilingual text matching by combining existing hand-written bilingual dictionaries and statistical techniques. the process of bilingual text matching consists of two major steps: sentence alignment and structural matching of bilingual sentences. statistical techniques are applied to estimate word correspondences not included in bilingual dictionaries. estimated word correspondences are useful for improving both sentence alignment and structural matching.
lexical knowledge acquisition from bilingual corpora. for practical research in natural language processing, it is indispensable to develop a large scale semantic dictionary for computers. it is especially important to improve the techniques for compiling semantic dictionaries from natural language texts such as those in existing human dictionaries or in large corpora. however, there are at least two difficulties in analyzing existing texts: the problem of syntactic ambiguities and the problem of polysemy. our approach to solve these difficulties is to make use of translation examples in two distinct languages that have quite different syntactic structures and word meanings. the reason we took this approach is that in many cases both syntactic and semantic ambiguities are resolved by comparing analyzed results from both languages. in this paper, we propose a method for resolving the syntactic ambiguities of translation examples of bilingual corpora and a method for acquiring lexical knowledge, such as case frames of verbs and attribute sets of nouns.
thesaurus-based efficient example retrieval by generating retrieval queries from similarities. in example-based nlp, the problem of computational cost of example retrieval is severe, since the retrieval time increases in proportion to the number of examples in the database. this paper proposes a novel example retrieval method for avoiding full retrieval of examples. the proposed method has the following three features, 1) it generates retrieval queries from similarities, 2) efficient example retrieval through the tree structure of a thesaurus, 3) binary search along subsumption ordering of retrieval queries. example retrieval time drastically decreases with the method.
a chart-parsing algorithm for efficient semantic analysis. in some contexts, well-formed natural language cannot be expected as input to information or communication systems. in these contexts, the use of grammar-independent input (sequences of uninflected semantic units like e.g. language-independent icons) can be an answer to the users' needs. however, this requires that an intelligent system should be able to interpret this input with reasonable accuracy and in reasonable time. here we propose a method allowing a purely semantic-based analysis of sequences of semantic units. it uses an algorithm inspired by the idea of "chart parsing" known in natural language processing, which stores intermediate parsing results in order to bring the calculation time down.
evaluation of an algorithm for the recognition and classification of proper names. we describe an information extraction system in which four classes of naming expressions - organisation, person, location and time names - are recognised and classified with nearly 92% combined precision and recall. the system applies a mixture of techniques to perform this task and these are described in detail. we have quantitatively evaluated the system against a blind test set of wall street journal business articles and report results not only for the system as a whole, but for each component technique and for each class of name. these results show that in order to have high recall, the system needs to make use not only of information internal to the naming expression but also information from outside the name. they also show that the contribution of each system component varies from one class of name expression to another.
an implementation of formal semantics in the formalism of relational databases. this paper presents an implementation of formal semantics as described in keenan and faltz's boolean semantics for natural language (4). the main characteristic of this implementation is that it avoids the intermediate step of translating nl into a formal language, such as an extended version of predicate calculus. my choice of not using any intermediate language, which montague already suggested in universal grammar (5), makes my implementation free of the problems related to the syntax of such a language like binding the variables and resolving scope ambiguities. on the other hand, not translating nl into an intermediate language requires every denotation (i.e. semantic value) to be explicitly and accurately represented in a database.
clustering verbs semantically according to their alternation behaviour. verbs were clustered semantically on the basis of their alternation behaviour, as characterised by their syntactic subcategorisation frames extracted from maximum probability parses of a robust statistical parser, and completed by assigning wordnet classes as selectional preferences to the frame arguments. the clustering was achieved (a) iteratively by measuring the relative entropy between the verbs' probability distributions over the frame types, and (b) by utilising a latent class analysis based on the joint frequencies of verbs and frame types.
algorithm for automatic interpretation of noun sequences. this paper describes an algorithm for automatically interpreting noun sequences in unrestricted text. this system uses broadcoverage semantic information which has been acquired automatically by analyzing the definitions in an on-line dictionary. previously, computational studies of noun sequences made use of hand-coded semantic information, and they applied the analysis rules sequentially. in contrast, the task of analyzing noun sequences in unrestricted text strongly favors an algorithm according to which the rules are applied in parallel and the best interpretation is determined by weights associated with rule applications.
natural-language-access systems and the organization and use of information. this paper describes a program of research whose objectives are to (1) develop systems that provide users with access to both data and text files through natural language dialogues; (2) study how people actually use the information to test hypotheses and solve problems; (3) modify the system designs on the basis of the results of the studies so that the systems more effectively support such uses and increasingly come to model the behavior of the users. two of the systems are in the medical domain: the first provides physicians with formatted information derived from patient medical records; the second responds to requests by eliciting relevant passages from a medical monograph. the third system is a more general information retrieval facility that will support interactions among system users and enable their successive experiences to be accumulated within the system database.
fluency and completeness in instance-based natural language generation. a fundamental assumption underlying candidate ranking in corpus-based approaches to natural language generation is the idea that in order to be fluent the output should be as similar to a (human-authored) corpus as possible. however, the goal of maximizing fluency can conflict with other goals, like conveying the maximal amount of input and being faithful. we employ an instance-based sentence generation system to investigate how the right balance between the different goals can be struck and show empirical results supporting our proposals.
machine-readable dictionaries. the papers in this panel consider machine-readable dictionaries from several perspectives: research in computational linguistics and computational lexicology, the development of tools for improving accessibility, the design of lexical reference systems for educational purposes, and applications of machine-readable dictionaries in information science contexts. as background and by way of introduction, a description is provided of a workshop on machine-readable dictionaries that was held at sri international in april 1983.
why human translators still sleep in peace? (four engineering and linguistic gaps in nlp). because they will keep their job quite for a few.this paper has been inspired by a recent editorial on the financial times, that gives a discouraging overview of commercial natural language processing systems ('the computer that can sustain a natural language conversation... is unlikely to exist for several decades'). computational linguists are not so much concerned with applications but computer scientists have the ultimate objective to build systems that can 'increase the acceptability of computers in everyday situations.' eventually, linguists as well would profit by a significant break-through in natural language processing.this paper is a brief dissertation on four engineering and linguistic issues we believe critical for a more striking success of nlp: extensive acquisition of the semantic lexicon, formal performance evaluation methods to evaluate systems, development of shell systems for rapid prototyping and customization, and finally a more linguistically motivated approach to word categorization.
cross-serial dependencies are not hard to process. cross-serial dependencies in dutch and swiss-german are the only known extracontext free natural language syntactic phenomena. psycholinguistic evidence suggests cross-serial orderings tend to be easier to process than nested constructions. we argue that the expressivity requirements of the corresponding formal languages do not actually entail that processing reduplication languages require the worst-case time complexity for languages of the same expressive class. we distinguish between context-free representability and context-free processing. we show that for any language with up to context free expressive power, processing cross-serial dependencies can be accommodated without affecting parsing complexity. this is related to other work on reduplication phenomena in formal models of computation.
utilisation du parallelisme en traduction automatisee par ordinateur. on pr&eacute;sente un syst&egrave;me de transformation de structures arborescentes adapt&eacute; au traitement parall&egrave;le. les structures de donn&eacute;es, appel&eacute;es <u>mat</u>, permettent une manipulation ais&eacute;e des ambigu&iuml;t&eacute;s et des choix structuraux. les r&egrave;gles et grammaires du syst&egrave;me, appel&eacute; star-pale, peuvent exprimer un certain nombre d'options de contr&ocirc;le, de reconnaissance et de transformation. on donne les id&eacute;es de base pour l'impl&eacute;mentation de ce type de syst&egrave;mes.
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 thehypothesized factors, and present experimental results on an effective strategy for supporting deliberation. the proposed method of computational dialogue simulation provides a new empirical basis for computational linguistics.
a case study of natural language customisation: the practical effects of world knowledge. this paper proposes a methodology for the customisation of natural language interfaces to information retrieval applications. we report a field study in which we tested this methodology by customising a commercially available natural language system to a large database of sales and marketing information. we note that it was difficult to tailor the common sense reasoning capabilities of the particular system we used to our application. this study validates aspects of the suggested methodology as well as providing insights that should inform the design of natural language systems for this class of applications.
xmltrans: a java-based xml transformation language for structured data. the recently completed mlis dicopro project addressed the need for a uniform, platform-independent interface for accessing multiple dictionaries and other lexical resources via the internet/intranets. lexical data supplied by dictionary publishers for the project was in a variety of sgml formats. in order to transform this data to a convenient standard format (html), a high level transformation language was developed. this language is simple to use, yet powerful enough to perform complex transformations not possible with similar transformation tools. xmltrans provides rooted/recursive transductions, similar to transducers used for natural language translation. the tool is written in standard java and is available to the general public.
morphosyntactic correction in natural language interfaces. morphosyntax cannot be simply ignored in natural-language man-machine dialogue since it constitutes an important part of the meaning. nevertheless, troublesome side effects can arise when morphosyntactic errors are combined with other types of errors. we describe here an efficient means of handling quite complex combinations of typographical, phonographic and agreement errors in french, which are typical of c.a.i. users: a sentence as erroneous as les cott&eacute; adgassan &agrave; i'ippeauttainuz son perpndiqul&egrave;re (!) will be perfectly recognized and translated into les c&ocirc;t&eacute;s adjacents &agrave; l'hypot&eacute;nuse sont perpendiculaires (the legs adjacent to the hypotenuse are perpendicular).
disjunctive feature structures as hypergraphs. in this paper, we present a new mathematical framework in which disjunctive feature structures are defined as directed acyclic hypergraphs. disjunction is defined in the feature structure domain, and not at the syntactic level in feature descriptions. this enables us to study properties and specify operations in terms of properties of, or operations on, hypergraphs rather than in syntactic terms. we illustrate the expressive power of this framework by defining a class of disjunctive feature structures with interesting properties (factored normal from or fnf), such as closure under factoring, unfactoring, unification, and generalization. unification, in particular, has the intuitive appeal of preserving as much as possible the particular factoring of the disjunctive feature structures to be unified. we also show that unification in the fnf class can be extremely efficient in practical applications.
syntactic preferences for robust parsing with semantic preferences. using constraints in robust parsing seems to have what we call "robust parsing paradox". preference semantics and connectionism both offered a promising approach to this problem. however, preference semantics has not addressed the problem of how to make full use of syntactic constraints, and connectionism has some inherent difficulties of its own which prevent it producing a practical system. in this paper we are proposing a method to add syntactic preferences to the preference semantics paradigm while maintaining its fundamental philosophy. it will be shown that syntactic preferences can be coded as a set of weights associated with the set of symbolically manipulatable rules of a new grammar formalism. the syntactic preferences such coded can be easily used to compute with semantic preferences. with the help of some techniques borrowed from connectionism, these weights can be adjusted through training.
word sense disambiguation with very large neural networks extracted from machine readable dictionaries. in this paper, we describe a means for automatically building very large neural networks (vlnns) from definition texts in machine-readable dictionaries, and demonstrate the use of these networks for word sense disambiguation. our method brings together two earlier, independent approaches to word sense disambiguation: the use of machine-readable dictionaries and spreading and activation models. the automatic construction of vlnns enables real-size experiments with neural networks for natural language processing, which in turn provides insight into their behaviour and design and can lead to possible improvements.
recognizing unregistered names for mandarin word identification. word identification has been an important and active issue in chinese natural language processing. in this paper, a new mechanism, based on the concept of sublanguage, is proposed for identifying unknown words, especially personal names, in chinese newspapers. the proposed mechanism includes title-driven name recognition, adaptive dynamic word formation, identification of 2-character and 3-character chinese names without title. we will show the experimental results for two corpora and compare them with the results by the nthu's statistic-based system, the only system that we know has attacked the same problem. the experimental results have shown significant improvements over the wi systems without the name identification capability.
a feature-based model for lexical databases. to date, no fully suitable data model for lexical databases has been proposed. as lexical databases have proliferated in multiple formats, there has been growing concern over the reusability of lexical resources. in this paper, we propose a model based on feature structures which overcomes most of the problems inherent in classical database models, and in particular enables accessing, manipulating or merging information structured in multiple ways. because of their widespread use in the representation of linguistic information, the applicability of feature structures to lexical databases seems natural, although to our knowledge this has not yet been implemented. the use of feature structures in lexical databases also opens up the possibility of compatibility with computational lexicons.
corpus-based development and evaluation of a system for processing definite descriptions. we present an implemented system for processing definite descriptions. the system is based on the results of a corpus analysis previously reported, which showed how common discourse-new descriptions are in newspaper corpora, and identified several problems to be dealt with when developing computational methods for interpreting bridging descriptions. the annotated corpus produced in this earlier work was used to extensively evaluate the proposed techniques for matching definite descriptions with their antecedents, discourse segmentation, recognizing discourse-new descriptions, and suggesting anchors for bridging descriptions.
building a large-scale annotated chinese corpus. in this paper we address issues related to building a large-scale chinese corpus. we try to answer four questions: (i) how to speed up annotation, (ii) how to maintain high annotation quality, (iii) for what purposes is the corpus applicable, and finally (iv) what future work we anticipate.
feature structures based tree adjoining grammars. we have embedded tree adjoining grammars (tag) in a feature structure based unification system. the resulting system, feature structure based tree adjoining grammars (ftag), captures the principle of factoring dependencies and recursion, fundamental to tag's. we show that ftag has an enhanced descriptive capacity compared to tag formalism. we consider some restricted versions of this system and some possible linguistic stipulations that can be made. we briefly describe a calculus to represent the structures used by this system, extending on the work of rounds, and kasper [rounds et al. 1986, kasper et al. 1986] involving the logical formulation of feature structures.
construction of a hierarchical translation memory. translation memories are promising devices for automatic translation. their main weakness, however, is poor coverage on unseen text. in this paper, the use of a hierarchical translation memory, consisting of a cascade of finite state transducers, is proposed. a number of transducers is applied to convert sentence pairs from a bilingual corpus into translation patterns, which are then used as a translation memory. preliminary results on the german english verbmobil corpus are given.
structure sharing in lexicalized tree-adjoining grammars. we present a scheme for efficiently representing a lexicalized tree-adjoining grammar (ltag). the proposed representational scheme allows for structure-sharing between lexical entries and the trees associated with the lexical items. a compact organization is achieved by organizing the lexicon in a hierarchical fashion and using inheritance as well as by using lexical and syntactic rules.while different organizations (flickinger, 1987; pollard and sag, 1987; shieber, 1986) of the lexicon have been proposed, in the scheme we propose, the inheritance hierarchy not only provides structure-sharing of lexical information but also of the associated elementary trees of extended domain of locality. furthermore, the lexical and syntactic rules can be used to derive new elementary trees from the default structures specified in the hierarchical lexicon.in the envisaged scheme, the use of a hierarchical lexicon and of lexical and syntactic rules for lexicalized tree-adjoining grammars will capture important linguistic generalizations and also allows for a space efficient representation of the grammar. this will allow for easy maintenance and facilitate updates to the grammar.
hmm-based word alignment in statistical translation. in this paper, we describe a new model for word alignment in statistical translation and present experimental results. the idea of the model is to make the alignment probabilities dependent on the differences in the alignment positions rather than on the absolute positions. to achieve this goal, the approach uses a first-order hidden markov model (hmm) for the word alignment problem as they are used successfully in speech recognition for the time alignment problem. the difference to the time alignment hmm is that there is no monotony constraint for the possible word orderings. we describe the details of the model and test the model on several bilingual corpora.